{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:34Z","timestamp":1763468074202,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214063","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"941-960","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Tight bounds for distributed functional monitoring"],"prefix":"10.1145","author":[{"given":"David P.","family":"Woodruff","sequence":"first","affiliation":[{"name":"IBM Almaden, San Jose, CA, USA"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"MADALGO, Aarhus University, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Normal_distribution.  http:\/\/en.wikipedia.org\/wiki\/Normal_distribution."},{"key":"e_1_3_2_2_2_1","volume-title":"http:\/\/www.cse.iitk.ac.in\/users\/sganguly\/data-stream-probs.pdf","author":"Open","year":"2006","unstructured":"Open problems in data streams and related topics. http:\/\/www.cse.iitk.ac.in\/users\/sganguly\/data-stream-probs.pdf , 2006 . Open problems in data streams and related topics. http:\/\/www.cse.iitk.ac.in\/users\/sganguly\/data-stream-probs.pdf, 2006."},{"key":"e_1_3_2_2_3_1","unstructured":"Open problems in data streams property testing and related topics. http:\/\/people.csail.mit.edu\/konak\/download\/publications\/bertinoro_and_k%anpur_open_problems.pdf 2011.  Open problems in data streams property testing and related topics. http:\/\/people.csail.mit.edu\/konak\/download\/publications\/bertinoro_and_k%anpur_open_problems.pdf 2011."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_10"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872764"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.31"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886559"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.44"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374470"},{"key":"e_1_3_2_2_14_1","first-page":"720","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Chakrabarti A.","year":"2008","unstructured":"A. Chakrabarti , T. S. Jayram , and M. Patrascu . Tight lower bounds for selection in randomly ordered streams . In Proc. ACM-SIAM Symposium on Discrete Algorithms , pages 720 -- 729 , 2008 . A. Chakrabarti, T. S. Jayram, and M. Patrascu. Tight lower bounds for selection in randomly ordered streams. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 720--729, 2008."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993644"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875561"},{"key":"e_1_3_2_2_18_1","volume-title":"Proc. International Conference on Very Large Data Bases","author":"Cormode G.","year":"2005","unstructured":"G. Cormode and M. Garofalakis . Sketching streams through the net: Distributed approximate query tracking . In Proc. International Conference on Very Large Data Bases , 2005 . G. Cormode and M. Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In Proc. International Conference on Very Large Data Bases, 2005."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066161"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921667"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807099"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"Cover T.","year":"1991","unstructured":"T. Cover and J. Thomas . Elements of Information Theory . John Wiley and Sons, Inc. , 1991 . T. Cover and J. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1547"},{"key":"e_1_3_2_2_24_1","first-page":"730","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Erg\u00fcn F.","year":"2008","unstructured":"F. Erg\u00fcn and H. Jowhari . On distance to monotonicity and longest increasing subsequence of a data stream . In Proc. ACM-SIAM Symposium on Discrete Algorithms , pages 730 -- 736 , 2008 . F. Erg\u00fcn and H. Jowhari. On distance to monotonicity and longest increasing subsequence of a data stream. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 730--736, 2008."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313556"},{"issue":"3","key":"e_1_3_2_2_26_1","first-page":"361","article-title":"Generalization of a probability limit theorem of cramer","volume":"54","author":"Feller W.","year":"1943","unstructured":"W. Feller . Generalization of a probability limit theorem of cramer . Trans. Amer. Math. Soc , 54 ( 3 ): 361 -- 372 , 1943 . W. Feller. Generalization of a probability limit theorem of cramer. Trans. Amer. Math. Soc, 54(3):361--372, 1943.","journal-title":"Trans. Amer. Math. Soc"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.39"},{"key":"e_1_3_2_2_28_1","volume-title":"abs\/1104.4552","author":"Ganguly S.","year":"2011","unstructured":"S. Ganguly . Polynomial estimators for high frequency moments. CoRR , abs\/1104.4552 , 2011 . S. Ganguly. Polynomial estimators for high frequency moments. CoRR, abs\/1104.4552, 2011."},{"key":"e_1_3_2_2_29_1","volume-title":"abs\/1201.0253","author":"Ganguly S.","year":"2012","unstructured":"S. Ganguly . A lower bound for estimating high moments of a data stream. CoRR , abs\/1201.0253 , 2012 . S. Ganguly. A lower bound for estimating high moments of a data stream. CoRR, abs\/1201.0253, 2012."},{"key":"e_1_3_2_2_30_1","first-page":"505","volume-title":"Symposium on Theoretical Aspects of Computer Science","author":"Gronemeier A.","year":"2009","unstructured":"A. Gronemeier . Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness . In Symposium on Theoretical Aspects of Computer Science , pages 505 -- 516 , 2009 . A. Gronemeier. Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness. In Symposium on Theoretical Aspects of Computer Science, pages 505--516, 2009."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_43"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.76"},{"key":"e_1_3_2_2_33_1","volume-title":"Randomized algorithms for tracking distributed count, frequencies, and ranks. CoRR, abs\/1108.3413","author":"Huang Z.","year":"2011","unstructured":"Z. Huang , K. Yi , and Q. Zhang . Randomized algorithms for tracking distributed count, frequencies, and ranks. CoRR, abs\/1108.3413 , 2011 . Z. Huang, K. Yi, and Q. Zhang. Randomized algorithms for tracking distributed count, frequencies, and ranks. CoRR, abs\/1108.3413, 2011."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060621"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946312"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_42"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993735"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142507"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806727"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1053724.1054115"},{"key":"e_1_3_2_2_44_1","volume-title":"Lecture Notes","author":"Matousek J.","year":"2008","unstructured":"J. Matousek and J. Vondr\u00e1k . The probabilistic method . Lecture Notes , 2008 . J. Matousek and J. Vondr\u00e1k. The probabilistic method. Lecture Notes, 2008."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095158"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/646244.681621"},{"key":"e_1_3_2_2_47_1","volume-title":"The communication complexity of gap hamming distance. Electronic Colloquium on Computational Complexity (ECCC), 18:63","author":"Sherstov A. A.","year":"2011","unstructured":"A. A. Sherstov . The communication complexity of gap hamming distance. Electronic Colloquium on Computational Complexity (ECCC), 18:63 , 2011 . A. A. Sherstov. The communication complexity of gap hamming distance. Electronic Colloquium on Computational Complexity (ECCC), 18:63, 2011."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075065"},{"key":"e_1_3_2_2_49_1","unstructured":"T. Vidick. A concentration inequality for the overlap of a vector on a large set with application to the communication complexity of the gap-hamming-distance problem. Electronic Colloquium on Computational Complexity (ECCC) 18:51 2011.  T. Vidick. A concentration inequality for the overlap of a vector on a large set with application to the communication complexity of the gap-hamming-distance problem. Electronic Colloquium on Computational Complexity (ECCC) 18:51 2011."},{"key":"e_1_3_2_2_50_1","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Woodruff D.","year":"2004","unstructured":"D. Woodruff . Optimal space lower bounds for all frequency moments . In Proc. ACM-SIAM Symposium on Discrete Algorithms , 2004 . D. Woodruff. Optimal space lower bounds for all frequency moments. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2004."},{"key":"e_1_3_2_2_51_1","volume-title":"Tight Bounds for Distributed Functional Monitoring. In http:\/\/arxiv.org\/abs\/1112.5153","author":"Woodruff D.","year":"2011","unstructured":"D. Woodruff and Q. Zhang . Tight Bounds for Distributed Functional Monitoring. In http:\/\/arxiv.org\/abs\/1112.5153 , 2011 . D. Woodruff and Q. Zhang. Tight Bounds for Distributed Functional Monitoring. In http:\/\/arxiv.org\/abs\/1112.5153, 2011."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559820"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214063","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:56Z","timestamp":1750238456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":52,"alternative-id":["10.1145\/2213977.2214063","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214063","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}