{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:36:20Z","timestamp":1740461780649,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_36","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"476-489","source":"Crossref","is-referenced-by-count":3,"title":["Better Gap-Hamming Lower Bounds via Better Round Elimination"],"prefix":"10.1007","author":[{"given":"Joshua","family":"Brody","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Vidick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"de Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF02126797","volume":"8","author":"M. Ajtai","year":"1988","unstructured":"Ajtai, M.: A lower bound for finding predecessors in Yao\u2019s cell probe model. Combinatorica\u00a08, 235\u2013247 (1988)","journal-title":"Combinatorica"},{"key":"36_CR2","unstructured":"Ball, K.: An elementary introduction to modern convex geometry. Flavors of Geometry\u00a031 (1997)"},{"key":"36_CR3","unstructured":"Barvinok, A.: Lecture notes on measure concentration (2005), http:\/\/www.math.lsa.umich.edu\/~barvinok\/total710.pdf"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Brieden, A., Gritzmann, P., Kannan, R., Klee, V., Lov\u00e1sz, L., Simonovits, M.: Approximation of diameters: Randomization doesn\u2019t help. In: Proceedings of 39th IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 244\u2013251 (1998)","DOI":"10.1109\/SFCS.1998.743451"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Brody, J., Chakrabarti, A.: A multi-round communication lower bound for Gap Hamming and some consequences. In: Proceedings of 24th IEEE Conference on Computational Complexity (CCC 2009), pp. 358\u2013368 (2009)","DOI":"10.1109\/CCC.2009.31"},{"key":"36_CR6","unstructured":"Chakrabarti, A., Regev, O.: Tight lower bound for the Gap Hamming problem. Personal Communication (2009)"},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","volume":"25","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: The tail of the hypergeometric distribution. Discrete Mathematics\u00a025(3), 285\u2013287 (1979)","journal-title":"Discrete Mathematics"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. Harper","year":"1966","unstructured":"Harper, L.: Optimal numbering and isoperimetric problems on graphs. Journal of Combinatorial Theory\u00a01, 385\u2013393 (1966)","journal-title":"Journal of Combinatorial Theory"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Tight lower bounds for the distinct elements problem. In: Proceedings of 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 283\u2013289 (2003)","DOI":"10.1109\/SFCS.2003.1238202"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4086\/toc.2008.v004a006","volume":"4","author":"T.S. Jayram","year":"2008","unstructured":"Jayram, T.S., Kumar, R., Sivakumar, D.: The one-way communication complexity of Hamming distance. Theory of Computing\u00a04(1), 129\u2013135 (2008)","journal-title":"Theory of Computing"},{"key":"36_CR12","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Lee, T.,, S.: Disjointness is hard in the multi-party number-on-the-forehead model. In: Proceedings of 23rd IEEE Conference on Computational Complexity (CCC 2008), pp. 81\u201391 (2008)","DOI":"10.1109\/CCC.2008.29"},{"key":"36_CR14","unstructured":"L\u00e9vy, P.: Probl\u00e8mes concrets d\u2019analyse fonctionnelle. Gauthier-Villars (1951)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. In: Proceedings of 39th ACM Symposium on the Theory of Computing (STOC 2007), pp. 699\u2013708 (2007)","DOI":"10.1145\/1250790.1250892"},{"key":"36_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)"},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"P. Miltersen","year":"1998","unstructured":"Miltersen, P., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci.\u00a057(1), 37\u201349 (1998); preliminary version in Proceedings of 27th ACM Symposium on the Theory of Computing (STOC 1995), pp. 103\u2013111 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"36_CR18","first-page":"204025","volume":"67","author":"A. Razborov","year":"2002","unstructured":"Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics\u00a067, 0204025 (2002)","journal-title":"Izvestiya of the Russian Academy of Science, Mathematics"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Sherstov, A.: The pattern matrix method for lower bounds on quantum communication. In: Proceedings of 40th ACM Symposium on the Theory of Computing (STOC 2008), pp. 85\u201394 (2008)","DOI":"10.1145\/1374376.1374392"},{"key":"36_CR20","unstructured":"Woodruff, D.: Optimal space lower bounds for all frequency moments. In: Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 167\u2013175 (2004)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T03:48:02Z","timestamp":1740455282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}