{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:10:32Z","timestamp":1743653432107,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_46","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"545-556","source":"Crossref","is-referenced-by-count":4,"title":["NNS Lower Bounds via Metric Expansion for l \u2009\u221e\u2009 and EMD"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kapralov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Croitoru, D., Patrascu, M.: Hardness of nearest neighbor under l-infinity. In: FOCS 2008 (2008)","DOI":"10.1109\/FOCS.2008.89"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051, 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"46_CR3","unstructured":"Andoni, A., Indyk, P., Krauthgamer, R.: Earth mover distance over high-dimensional spaces. In: SODA 2008, pp. 343\u2013352 (2008)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: FOCS 2006, pp. 449\u2013458 (2006)","DOI":"10.1109\/FOCS.2006.56"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Barkol, O., Rabani, Y.: Tighter bounds for nearest neighbor search and related problems in the cell probe model. In: STOC 2000, pp. 388\u2013396 (2000)","DOI":"10.1145\/335305.335350"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Borodin, A., Ostrovsky, R., Rabani, Y.: Lower bounds for high dimensional nearest neighbor search and related problems. In: STOC 1999, pp. 312\u2013321 (1999)","DOI":"10.1145\/301250.301330"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Chazelle, B., Gum, B., Lvov, A.: A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube. In: STOC 1999, pp. 305\u2013311 (1999)","DOI":"10.1145\/301250.301325"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Regev, O.: An optimal randomised cell probe lower bound for approximate nearest neighbour searching. In: FOCS 2004, pp. 473\u2013482 (2004)","DOI":"10.1109\/FOCS.2004.12"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P.: On approximate nearest neighbors under l \u2009\u221e\u2009 norm. J. Comput. Syst. Sci.\u00a063 (2001)","DOI":"10.1006\/jcss.2001.1781"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: STOC 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"46_CR11","unstructured":"Khot, S., Naor, A.: Nonembeddability theorems via fourier analysis. In: FOCS 2005 (2005)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. In: STOC 1998, pp. 614\u2013623 (1998)","DOI":"10.1145\/276698.276877"},{"issue":"1","key":"46_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2004.06.001","volume":"92","author":"D. Liu","year":"2004","unstructured":"Liu, D.: A strong lower bound for approximate nearest neighbor searching. Inf. Process. Lett.\u00a092(1), 23\u201329 (2004)","journal-title":"Inf. Process. Lett."},{"key":"46_CR14","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, New York (1977)"},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"P.B. Miltersen","year":"1998","unstructured":"Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci.\u00a057(1), 37\u201349 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Panigrahy, R., Talwar, K., Wieder, U.: A geometric approach to lower bounds for approximate near-neighbor search and partial match. In: FOCS 2008, pp. 414\u2013423 (2008)","DOI":"10.1109\/FOCS.2008.68"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Panigrahy, R., Talwar, K., Wieder, U.: Lower bounds on near neighbor search via metric expansion. In: FOCS 2010 (2010)","DOI":"10.1109\/FOCS.2010.82"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Thorup, M.: Higher lower bounds for near-neighbor and further rich problems. In: FOCS 2006, pp. 646\u2013654 (2006)","DOI":"10.1109\/FOCS.2006.35"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:11:48Z","timestamp":1743595908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}