Sublinear time algorithms

Ronitt Rubinfeld; Asaf Shapira

doi:https://doi.org/10.1137/100791075

Sublinear time algorithms

Ronitt Rubinfeld, Asaf Shapira

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-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 types of answers that one can hope to achieve in this setting.

Original language	English
Pages (from-to)	1562-1588
Number of pages	27
Journal	SIAM Journal on Discrete Mathematics
Volume	25
Issue number	4
DOIs	https://doi.org/10.1137/100791075
State	Published - 2011

Keywords

Approximation algorithms
Property testing
Randomized algorithms
Sublinear time algorithms

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

https://doi.org/10.1137/100791075

Cite this

@article{96ef1711a7004688b94715bd2f53f51b,

title = "Sublinear time algorithms",

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

keywords = "Approximation algorithms, Property testing, Randomized algorithms, Sublinear time algorithms",

author = "Ronitt Rubinfeld and Asaf Shapira",

year = "2011",

doi = "https://doi.org/10.1137/100791075",

language = "الإنجليزيّة",

volume = "25",

pages = "1562--1588",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Sublinear time algorithms

AU - Rubinfeld, Ronitt

AU - Shapira, Asaf

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Property testing

KW - Randomized algorithms

KW - Sublinear time algorithms

UR - http://www.scopus.com/inward/record.url?scp=84855660450&partnerID=8YFLogxK

U2 - https://doi.org/10.1137/100791075

DO - https://doi.org/10.1137/100791075

M3 - مقالة

SN - 0895-4801

VL - 25

SP - 1562

EP - 1588

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 4

ER -

Sublinear time algorithms

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this