{"id":"https://openalex.org/W2018431582","doi":"https://doi.org/10.1145/1959045.1959062","title":"Guest column: testing linear properties","display_name":"Guest column: testing linear properties","publication_year":2011,"publication_date":"2011-03-15","ids":{"openalex":"https://openalex.org/W2018431582","doi":"https://doi.org/10.1145/1959045.1959062","mag":"2018431582"},"language":"en","primary_location":{"id":"doi:10.1145/1959045.1959062","doi":"https://doi.org/10.1145/1959045.1959062","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1959045.1959062","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489","observed_orcids":["https://orcid.org/0000-0003-3718-6489","https://orcid.org/0009-0005-6560-9663","https://orcid.org/0000-0001-7713-7003"]},"institutions":[{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA","Microsoft Research New England, Cambridge, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA","institution_ids":["https://openalex.org/I4400600948"]},{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA#TAB#","institution_ids":["https://openalex.org/I4400600948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101519422"],"corresponding_institution_ids":["https://openalex.org/I4400600948"],"apc_list":null,"apc_paid":null,"fwci":1.0442,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73291161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":"42","issue":"1","first_page":"59","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8515999913215637,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8515999913215637,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.026599999517202377,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.02630000002682209,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.9409999847412109},{"id":"https://openalex.org/keywords/linear-properties","display_name":"linear properties","score":0.8859999775886536},{"id":"https://openalex.org/keywords/probabilistically-checkable-proofs","display_name":"probabilistically checkable proofs","score":0.9559999704360962},{"id":"https://openalex.org/keywords/locally-testable-codes","display_name":"locally testable codes","score":0.9990000128746033},{"id":"https://openalex.org/keywords/property-testing","display_name":"property testing","score":0.878000020980835}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7965682744979858},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7039288282394409},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6192225813865662},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5930473208427429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5743441581726074},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.5327175855636597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48067864775657654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384670615196228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3821484446525574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22384977340698242},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08009657263755798},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C203014093","wikidata":"https://www.wikidata.org/wiki/Q101929","display_name":"Immunology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C159654299","wikidata":"https://www.wikidata.org/wiki/Q79460","display_name":"Antibody","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1959045.1959062","doi":"https://doi.org/10.1145/1959045.1959062","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1959045.1959062","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.3247","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.3247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/2011/sigact-lpt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.4012","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.4012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/2011/sigact-lpt.pdf","raw_type":"text"},{"id":"mag:2117931951","doi":null,"is_oa":false,"landing_page_url":"http://people.csail.mit.edu/madhu/papers/2011/sigact-lpt.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W203800693","https://openalex.org/W221046452","https://openalex.org/W240046656","https://openalex.org/W278979981","https://openalex.org/W304297541","https://openalex.org/W336776360","https://openalex.org/W621782861","https://openalex.org/W1488030543","https://openalex.org/W1489461653","https://openalex.org/W1513180873","https://openalex.org/W1527094333","https://openalex.org/W1540200135","https://openalex.org/W1587609858","https://openalex.org/W1591780301","https://openalex.org/W1970630090","https://openalex.org/W1991510040","https://openalex.org/W1997855358","https://openalex.org/W2003159902","https://openalex.org/W2018925011","https://openalex.org/W2019578639","https://openalex.org/W2022381972","https://openalex.org/W2029859729","https://openalex.org/W2051880745","https://openalex.org/W2055635427","https://openalex.org/W2056759312","https://openalex.org/W2079638931","https://openalex.org/W2087900794","https://openalex.org/W2097206148","https://openalex.org/W2099296548","https://openalex.org/W2100020751","https://openalex.org/W2101060997","https://openalex.org/W2113121172","https://openalex.org/W2113719649","https://openalex.org/W2128717558","https://openalex.org/W2138475026","https://openalex.org/W2144461322","https://openalex.org/W2146453677","https://openalex.org/W2151095335","https://openalex.org/W2151626804","https://openalex.org/W2161560216","https://openalex.org/W2162229947","https://openalex.org/W2171684223","https://openalex.org/W2177650368","https://openalex.org/W2180664492","https://openalex.org/W2225044966","https://openalex.org/W2242669280","https://openalex.org/W2266044771","https://openalex.org/W2293914995","https://openalex.org/W2487893106","https://openalex.org/W2611428058","https://openalex.org/W2912644552","https://openalex.org/W3004537778","https://openalex.org/W4241342151","https://openalex.org/W4255563008","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2117931951","https://openalex.org/W1515679427","https://openalex.org/W4226521824","https://openalex.org/W1899212464","https://openalex.org/W7095908946","https://openalex.org/W7099380098","https://openalex.org/W2916314902","https://openalex.org/W36273506","https://openalex.org/W2985710443","https://openalex.org/W4234397450"],"abstract_inverted_index":{"The":[0],"last":[1],"two":[2],"decades":[3],"have":[4,52],"seen":[5],"enormous":[6],"progress":[7],"in":[8,22,86],"the":[9,33,55,76,83],"development":[10],"of":[11,20,32,40,58,75],"sublinear-time":[12],"algorithms":[13,16],"--":[14],"i.e.,":[15],"that":[17],"examine/reveal":[18],"properties":[19,42],"\"data\"":[21],"less":[23],"time":[24],"than":[25],"it":[26],"would":[27],"take":[28],"to":[29,45,54],"read":[30],"all":[31],"data.":[34],"A":[35],"large,":[36],"and":[37,63],"important,":[38],"subclass":[39],"such":[41],"turn":[43],"out":[44],"be":[46],"\"linear\".":[47],"In":[48,68],"particular,":[49],"these":[50],"developments":[51],"contributed":[53],"rich":[56],"theory":[57],"probabilistically":[59],"checkable":[60],"proofs":[61],"(PCPs)":[62],"locally":[64],"testable":[65],"codes":[66],"(LTCs).":[67],"this":[69,87],"survey,":[70],"we":[71],"focus":[72],"on":[73],"some":[74],"general":[77],"technical":[78],"themes":[79],"at":[80],"work":[81],"behind":[82],"many":[84],"results":[85],"area.":[88]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}