Show simple item record

dc.contributor.authorRubinfeld, Ronitt
dc.contributor.authorShapira, Asaf
dc.date.accessioned2012-05-04T22:25:23Z
dc.date.available2012-05-04T22:25:23Z
dc.date.issued2011-11
dc.date.submitted2011-02
dc.identifier.issn0895-4801
dc.identifier.issn1095-7146
dc.identifier.urihttp://hdl.handle.net/1721.1/70521
dc.description.abstractSublinear 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant 0732334)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant 0728645)en_US
dc.description.sponsorshipMarie Curie International Reintegration Grants (grant PIRG03-GA-2008-231077)en_US
dc.description.sponsorshipIsrael Science Foundation (grant 1147/09)en_US
dc.description.sponsorshipIsrael Science Foundation (grant 1675/09)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant DMS-0901355)en_US
dc.description.sponsorshipIsrael Science Foundation (grant 224/11)en_US
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/100791075en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSIAMen_US
dc.titleSublinear Time Algorithmsen_US
dc.typeArticleen_US
dc.identifier.citationRubinfeld, Ronitt, and Asaf Shapira. “Sublinear Time Algorithms.” SIAM Journal on Discrete Mathematics 25.4 (2011): 1562. Web. 4 May 2012. © 2011 Society for Industrial and Applied Mathematicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.approverRubinfeld, Ronitt
dc.contributor.mitauthorRubinfeld, Ronitt
dc.relation.journalSIAM Journal on Discrete Mathematicsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsRubinfeld, Ronitt; Shapira, Asafen
dc.identifier.orcidhttps://orcid.org/0000-0002-4353-7639
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record