Sublinear time algorithms

Ronitt Rubinfeld*, Asaf Shapira

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 types of answers that one can hope to achieve in this setting.

Original languageEnglish
Pages (from-to)1562-1588
Number of pages27
JournalSIAM Journal on Discrete Mathematics
Issue number4
StatePublished - 2011


  • Approximation algorithms
  • Property testing
  • Randomized algorithms
  • Sublinear time algorithms


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

Cite this