{"id":"https://openalex.org/W2167099561","doi":"https://doi.org/10.1145/2213977.2214063","title":"Tight bounds for distributed functional monitoring","display_name":"Tight bounds for distributed functional monitoring","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2167099561","doi":"https://doi.org/10.1145/2213977.2214063","mag":"2167099561"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","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/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David P. Woodruff","raw_affiliation_strings":["IBM Almaden, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Almaden, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100418224","display_name":"Qin Zhang","orcid":"https://orcid.org/0000-0002-6851-3115"},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]},{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Qin Zhang","raw_affiliation_strings":["MADALGO, Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"MADALGO, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128","https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102861589"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":19.4557,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.99413659,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"941","last_page":"960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6776196360588074},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6660817861557007},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5675110816955566},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4938672184944153},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45825162529945374},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.443320095539093},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4368482232093811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35059791803359985},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3304714262485504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25524869561195374},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11564341187477112}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6776196360588074},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6660817861557007},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5675110816955566},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4938672184944153},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45825162529945374},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.443320095539093},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4368482232093811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35059791803359985},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3304714262485504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25524869561195374},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11564341187477112},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/2213977.2214063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.866","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.866","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ust.hk/%7Eqinzhang/papers/stoc12_distFp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.6467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.6467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ust.hk/~qinzhang/papers/stoc12_distFp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.353.634","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.634","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ust.hk/~qinzhang/papers/distFp-full.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.757.5030","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.757.5030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1112.5153.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/16f57ae0-bef6-434a-8042-63ffdb824118","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/16f57ae0-bef6-434a-8042-63ffdb824118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"David P., W & Zhang, Q 2012, Tight Bounds for Distributed Functional Monitoring. in Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC\u201912 . Association for Computing Machinery, pp. 941-960, ACM Symposium on Theory of Computing , New york, United States, 20/05/2012. https://doi.org/10.1145/2213977.2214063","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W69989483","https://openalex.org/W82127983","https://openalex.org/W135476618","https://openalex.org/W264700177","https://openalex.org/W1512493349","https://openalex.org/W1521238083","https://openalex.org/W1522285917","https://openalex.org/W1557064786","https://openalex.org/W1599370812","https://openalex.org/W1611546574","https://openalex.org/W1878833411","https://openalex.org/W1979790324","https://openalex.org/W1980223785","https://openalex.org/W1984126159","https://openalex.org/W2001183701","https://openalex.org/W2006007166","https://openalex.org/W2016981839","https://openalex.org/W2021016639","https://openalex.org/W2023146810","https://openalex.org/W2045028348","https://openalex.org/W2045480089","https://openalex.org/W2051641102","https://openalex.org/W2053966137","https://openalex.org/W2064379477","https://openalex.org/W2068462176","https://openalex.org/W2068871408","https://openalex.org/W2069414131","https://openalex.org/W2089297152","https://openalex.org/W2091567345","https://openalex.org/W2098669997","https://openalex.org/W2099111195","https://openalex.org/W2103126020","https://openalex.org/W2107443258","https://openalex.org/W2107917944","https://openalex.org/W2113623631","https://openalex.org/W2114607430","https://openalex.org/W2129719258","https://openalex.org/W2129978406","https://openalex.org/W2131709403","https://openalex.org/W2132822431","https://openalex.org/W2134743705","https://openalex.org/W2143594377","https://openalex.org/W2152489475","https://openalex.org/W2156632255","https://openalex.org/W2157268058","https://openalex.org/W2160681854","https://openalex.org/W2166767032","https://openalex.org/W2167099561","https://openalex.org/W2219996931","https://openalex.org/W2340787257","https://openalex.org/W2724463085","https://openalex.org/W2950318219","https://openalex.org/W2963378100","https://openalex.org/W3037084761","https://openalex.org/W3137191742","https://openalex.org/W4246376669","https://openalex.org/W4285719527","https://openalex.org/W6631211210"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W4301594054","https://openalex.org/W2794488505","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2938514635","https://openalex.org/W2295467472","https://openalex.org/W2097909533","https://openalex.org/W4360764540","https://openalex.org/W3125188128"],"abstract_inverted_index":{"We":[0,93,145,243],"resolve":[1],"several":[2],"fundamental":[3],"questions":[4],"in":[5,166,219],"the":[6,57,60,68,74,88,95,101,118,136,161,173,180,185,189,195,201,204,220,229,236,264],"area":[7],"of":[8,59,70,90,99,103,163,175,188,235,269],"distributed":[9,167,190,224],"functional":[10,168,191,225],"monitoring,":[11],"initiated":[12],"by":[13],"Cormode,":[14,270],"Muthukrishnan,":[15,271],"and":[16,20,36,124,154,177,272,277],"Yi":[17,273],"(SODA,":[18],"2008),":[19],"receiving":[21],"recent":[22],"attention.":[23],"In":[24],"this":[25],"model":[26,193,227],"there":[27],"are":[28,160,183],"k":[29,61,176,208],"sites":[30],"each":[31],"tracking":[32],"their":[33,278,294],"input":[34,209],"streams":[35,210],"communicating":[37],"with":[38],"a":[39,53,111],"central":[40],"coordinator.":[41],"The":[42,63],"coordinator's":[43],"task":[44],"is":[45,65,87,114,217],"to":[46,52,66,110,143,170,199,232],"continuously":[47,238],"maintain":[48],"an":[49],"approximate":[50],"output":[51],"function":[54,202,237],"computed":[55],"over":[56],"union":[58],"streams.":[62],"goal":[64],"minimize":[67],"number":[69,102],"bits":[71],"communicated.":[72],"Let":[73],"p-th":[75],"frequency":[76,89],"moment":[77],"be":[78],"defined":[79],"as":[80],"Fp":[81],"=":[82,285,289],"\u2211i":[83],"fip,":[84],"where":[85,194,228],"fi":[86],"element":[91],"i.":[92],"show":[94,245],"randomized":[96],"communication":[97,141],"complexity":[98],"estimating":[100],"distinct":[104],"elements":[105],"(that":[106],"is,":[107],"F0)":[108],"up":[109],"1+\u03b5":[112],"factor":[113],"\u03a9(k/\u03b52),":[115],"improving":[116],"upon":[117,263],"previous":[119,137,265],"\u03a9(k":[120,138],"+":[121,139,280],"1/\u03b52)":[122,140],"bound":[123,142,268,282,292],"matching":[125],"known":[126],"upper":[127],"bounds.":[128],"For":[129,287],"Fp,":[130,250],"p":[131,253,284,288],">":[132,254],"1,":[133,255],"we":[134,247],"improve":[135],"\u03a9(kp-1/\u03b52).":[144],"obtain":[146],"similar":[147],"improvements":[148],"for":[149,184,251,274,283],"heavy":[150],"hitters,":[151],"empirical":[152],"entropy,":[153],"other":[155],"problems.":[156],"Our":[157],"lower":[158,181],"bounds":[159,182],"first":[162],"any":[164,240,252],"kind":[165],"monitoring":[169,192,226],"depend":[171],"on":[172],"product":[174],"1/\u03b52.":[178],"Moreover,":[179],"static":[186],"version":[187,222],"coordinator":[196,230],"only":[197],"needs":[198,231],"compute":[200],"at":[203,239],"time":[205,241],"when":[206],"all":[207],"end;":[211],"surprisingly":[212],"they":[213],"almost":[214],"match":[215],"what":[216],"achievable":[218],"(dynamic":[221],"of)":[223],"keep":[233],"track":[234],"step.":[242],"also":[244],"that":[246],"can":[248],"estimate":[249],"using":[256],"O(kp-1":[257],"poly(\u03b5-1))":[258,267],"communication.":[259],"This":[260],"drastically":[261],"improves":[262],"O(k2p+1N1-2/p":[266],"general":[275],"p,":[276],"O(k2/\u03b5":[279],"k1.5/\u03b53)":[281],"2.":[286],"2,":[290],"our":[291],"resolves":[293],"main":[295],"open":[296],"question.":[297]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}