{"id":"https://openalex.org/W2403923032","doi":"https://doi.org/10.1137/17m112289x","title":"Verifiable Stream Computation and Arthur--Merlin Communication","display_name":"Verifiable Stream Computation and Arthur--Merlin Communication","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2403923032","doi":"https://doi.org/10.1137/17m112289x","mag":"2403923032"},"language":"en","primary_location":{"id":"doi:10.1137/17m112289x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m112289x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol033-ccc2015/LIPIcs.CCC.2015.217/LIPIcs.CCC.2015.217.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3633-9180","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031896681","display_name":"Graham Cormode","orcid":"https://orcid.org/0000-0002-0698-0922"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Graham Cormode","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew McGregor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080601320","display_name":"Justin Thaler","orcid":"https://orcid.org/0009-0009-2234-6225"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Justin Thaler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061790878","display_name":"Suresh Venkatasubramanian","orcid":"https://orcid.org/0000-0001-7679-7130"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suresh Venkatasubramanian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00186245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"48","issue":"4","first_page":"1265","last_page":"1299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11195","display_name":"Simulation Techniques and Applications","score":0.9193999767303467,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.7888997197151184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7641078233718872},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7403823137283325},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5747982859611511},{"id":"https://openalex.org/keywords/merlin","display_name":"Merlin (protein)","score":0.535968542098999},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5069699287414551},{"id":"https://openalex.org/keywords/data-stream","display_name":"Data stream","score":0.4637843370437622},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45480626821517944},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39781299233436584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2294139862060547},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20564430952072144},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1809805929660797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1460617482662201},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07220691442489624}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.7888997197151184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7641078233718872},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7403823137283325},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5747982859611511},{"id":"https://openalex.org/C178628643","wikidata":"https://www.wikidata.org/wiki/Q410233","display_name":"Merlin (protein)","level":4,"score":0.535968542098999},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5069699287414551},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.4637843370437622},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45480626821517944},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39781299233436584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2294139862060547},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20564430952072144},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1809805929660797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1460617482662201},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07220691442489624},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C121608353","wikidata":"https://www.wikidata.org/wiki/Q12078","display_name":"Cancer","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C179185449","wikidata":"https://www.wikidata.org/wiki/Q219699","display_name":"Suppressor","level":3,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/17m112289x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m112289x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:117512","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:5068","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.217","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol033-ccc2015/LIPIcs.CCC.2015.217/LIPIcs.CCC.2015.217.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.ccc.2015.217","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2015.217","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:2403923032","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc21.html#ChakrabartiCMTV14","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,"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":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5068","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.217","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol033-ccc2015/LIPIcs.CCC.2015.217/LIPIcs.CCC.2015.217.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1031159338","display_name":null,"funder_award_id":"IIS-1251049","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3760249836","display_name":null,"funder_award_id":"ERC-2014-CoG 647557","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G4618865905","display_name":null,"funder_award_id":"CCF-1217375","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4937190934","display_name":null,"funder_award_id":"IIS-1251110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5180860367","display_name":null,"funder_award_id":"CCF-1637536","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7223291013","display_name":"BIGDATA: Small: DA: Collaborative Research: From Data To Users: Providing Interpretable and Verifiable Explanations in Data Mining","funder_award_id":"1251110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7666444357","display_name":"AF: Small: Foundational Research in Communication Complexity and Its Applications","funder_award_id":"1217375","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2403923032.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1971361630","https://openalex.org/W1980223785","https://openalex.org/W1983849809","https://openalex.org/W1984477611","https://openalex.org/W1996146326","https://openalex.org/W2020913456","https://openalex.org/W2027214648","https://openalex.org/W2042518617","https://openalex.org/W2051019379","https://openalex.org/W2080745194","https://openalex.org/W2082647621","https://openalex.org/W2109833455","https://openalex.org/W2128633442","https://openalex.org/W2148957455","https://openalex.org/W2176939845","https://openalex.org/W2293988196"],"related_works":["https://openalex.org/W2003373949","https://openalex.org/W3028832044","https://openalex.org/W199266244","https://openalex.org/W3037805651","https://openalex.org/W2568405635","https://openalex.org/W1480113836","https://openalex.org/W2951083062","https://openalex.org/W2038704326","https://openalex.org/W2912272112","https://openalex.org/W2979421064","https://openalex.org/W2970533224","https://openalex.org/W2154650342","https://openalex.org/W2971390834","https://openalex.org/W2295167940","https://openalex.org/W2187207516","https://openalex.org/W3199796439","https://openalex.org/W3003327282","https://openalex.org/W1589823702","https://openalex.org/W65695529","https://openalex.org/W1985709546"],"abstract_inverted_index":{"In":[0,85],"the":[1,35,39,59,64,70,80,141,150,177,182,204,217,222,228,232,246,257],"setting":[2],"of":[3,21,34,72,101,129,149,152,160,171,203,209,221,237,251,259,271,277],"streaming":[4,178],"interactive":[5,165,252],"proofs":[6,166],"(SIPs),":[7],"a":[8,14,18,31,42,76,146,157,185,268],"client":[9],"(verifier)":[10],"needs":[11],"to":[12,28,41,50,104,133,176,197,231],"compute":[13],"given":[15],"function":[16],"on":[17,137,256],"massive":[19],"stream":[20,81],"data,":[22],"arriving":[23],"online,":[24],"but":[25,47],"is":[26,48,174],"unable":[27],"store":[29],"even":[30],"small":[32],"fraction":[33],"data.":[36],"It":[37],"outsources":[38],"processing":[40],"third":[43],"party":[44],"service":[45,60],"(prover)":[46],"unwilling":[49],"blindly":[51],"trust":[52],"answers":[53],"returned":[54],"by":[55,155],"this":[56,86],"service.":[57],"Thus,":[58],"cannot":[61],"simply":[62],"supply":[63],"desired":[65],"answer;":[66],"it":[67],"must":[68],"convince":[69],"verifier":[71,183],"its":[73],"correctness":[74],"via":[75],"short":[77],"interaction":[78,102,130],"after":[79],"has":[82],"been":[83],"seen.":[84],"work":[87],"we":[88,94,144],"study":[89,148,236],"\u201cbarely":[90],"interactive\u201d":[91],"SIPs.":[92],"Specifically,":[93],"show":[95],"that":[96,193,227],"one":[97],"or":[98],"two":[99],"rounds":[100,128],"suffice":[103],"solve":[105],"several":[106],"query":[107],"problems---including":[108],"index,":[109],"median,":[110],"nearest":[111],"neighbor":[112],"search,":[113],"pattern":[114],"matching,":[115],"and":[116,121,190,224,242,266],"range":[117],"counting---with":[118],"polylogarithmic":[119],"space":[120],"communication":[122,161,212,274],"costs.":[123],"Such":[124],"efficiency":[125],"with":[126,245],"$O(1)$":[127],"was":[131],"thought":[132],"be":[134],"impossible":[135],"based":[136],"previous":[138],"work.":[139],"On":[140],"other":[142,210],"hand,":[143],"initiate":[145],"formal":[147],"limitations":[151],"constant-round":[153,264],"SIPs":[154],"introducing":[156],"new":[158,269],"hierarchy":[159,206,229],"models":[162,173],"called":[163],"online":[164,169,279],"(OIPs).":[167],"The":[168],"nature":[170],"these":[172],"analogous":[175],"restriction":[179],"placed":[180],"upon":[181],"in":[184,207,275],"SIP.":[186],"We":[187],"give":[188],"upper":[189],"lower":[191],"bounds":[192],"(1)":[194],"characterize,":[195],"up":[196],"quadratic":[198],"blowups,":[199],"every":[200],"finite":[201],"level":[202],"OIP":[205],"terms":[208,276],"well-known":[211],"complexity":[213],"classes,":[214],"(2)":[215],"separate":[216],"first":[218],"four":[219],"levels":[220],"hierarchy,":[223],"(3)":[225],"reveal":[226],"collapses":[230],"fourth":[233],"level.":[234],"Our":[235],"OIPs":[238],"reveals":[239],"marked":[240],"contrasts":[241],"some":[243],"parallels":[244],"classic":[247],"Turing":[248],"machine":[249],"theory":[250],"proofs,":[253],"establishes":[254],"limits":[255],"power":[258],"existing":[260],"techniques":[261],"for":[262],"developing":[263],"SIPs,":[265],"provides":[267],"characterization":[270],"(nononline)":[272],"Arthur--Merlin":[273],"an":[278],"model.":[280]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}