{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:15Z","timestamp":1750307415254,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806752","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"447-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The limits of buffering"],"prefix":"10.1145","author":[{"given":"Elad","family":"Verbin","sequence":"first","affiliation":[{"name":"ITCS, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"HKUST, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0005-6_9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1021-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509950"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1822"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_7_1","first-page":"546","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Brodal G. S.","year":"2003","unstructured":"G. S. Brodal and R. Fagerberg . Lower bounds for external memory dictionaries . In Proc. ACM-SIAM Symposium on Discrete Algorithms , pages 546 -- 554 , 2003 . G. S. Brodal and R. Fagerberg. Lower bounds for external memory dictionaries. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 546--554, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00006-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320092"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496839"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9155-x"},{"key":"e_1_3_2_1_13_1","unstructured":"D. E.\n      Knuth\n      . \n      Sorting\n       and \n      Searching volume \n  3\n   of \n  The Art of Computer Programming\n  . \n  Addison-Wesley Reading MA second\n   edition 1998\n  .   D. E. Knuth. Sorting and Searching volume 3 of The Art of Computer Programming. Addison-Wesley Reading MA second edition 1998."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/319758.319763"},{"key":"e_1_3_2_1_15_1","first-page":"212","volume-title":"Proc. International Conference on Very Large Databases","author":"Litwin W.","year":"1980","unstructured":"W. Litwin . Linear hashing: a new tool for file and table addressing . In Proc. International Conference on Very Large Databases , pages 212 -- 223 , 1980 . W. Litwin. Linear hashing: a new tool for file and table addressing. In Proc. International Conference on Very Large Databases, pages 212--223, 1980."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63532"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060606"},{"key":"e_1_3_2_1_19_1","unstructured":"R. Pagh. Basic External Memory Data Structures.  R. Pagh. Basic External Memory Data Structures."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380836"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_22_1","unstructured":"M. P\u01cetra\u015fcu. Personal communication.  M. P\u01cetra\u015fcu. Personal communication."},{"key":"e_1_3_2_1_24_1","first-page":"20","volume-title":"Proc. 15th ACM-SIAM Symposium on Discrete Algorithms","author":"P\u01cetra\u015fcu M.","year":"2004","unstructured":"M. P\u01cetra\u015fcu and E. D. Demaine . Tight bounds for the partial-sums problem . In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms , pages 20 -- 29 , 2004 . M. P\u01cetra\u015fcu and E. D. Demaine. Tight bounds for the partial-sums problem. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pages 20--29, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132551"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496839"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214411"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185427"},{"key":"e_1_3_2_1_29_1","volume-title":"Algorithms and Data Structures for External Memory","author":"Vitter J. S.","year":"2008","unstructured":"J. S. Vitter . Algorithms and Data Structures for External Memory . Now Publishers , 2008 . J. S. Vitter. Algorithms and Data Structures for External Memory. Now Publishers, 2008."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584055"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"e_1_3_2_1_32_1","unstructured":"K. Yi. Personal communication.  K. Yi. Personal communication."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873613"},{"key":"e_1_3_2_1_34_1","unstructured":"Z. A. Zhu. Personal communication.  Z. A. Zhu. Personal communication."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806752"}},"subtitle":["a tight lower bound for dynamic membership in the external memory model"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":33,"alternative-id":["10.1145\/1806689.1806752","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806752","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}