Sublinear time algorithms

Research output: Contribution to conferencePaperpeer-review

Abstract

Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the sorts of answers that one might be able to achieve in this new setting.

Original languageEnglish
Pages1095-1110
Number of pages16
StatePublished - 2006
Externally publishedYes
Event25th International Congress of Mathematicians, ICM 2006 - Madrid, Spain
Duration: 22 Aug 200630 Aug 2006

Conference

Conference25th International Congress of Mathematicians, ICM 2006
Country/TerritorySpain
CityMadrid
Period22/08/0630/08/06

Keywords

  • Property testing
  • Sublinear time algorithms

Fingerprint

Dive into the research topics of 'Sublinear time algorithms'. Together they form a unique fingerprint.

Cite this