{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:50:31Z","timestamp":1725565831369},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_72","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"858-869","source":"Crossref","is-referenced-by-count":8,"title":["The Black-Box Complexity of Nearest Neighbor Search"],"prefix":"10.1007","author":[{"given":"Robert","family":"Krauthgamer","sequence":"first","affiliation":[]},{"given":"James R.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"72_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.24033\/bsmf.1997","volume":"111","author":"P. Assouad","year":"1983","unstructured":"Assouad, P.: Plongements lipschitziens dans Rn. Bull. Soc. Math. France\u00a0111(4), 429\u2013448 (1983)","journal-title":"Bull. Soc. Math. France"},{"issue":"1","key":"72_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K.L. Clarkson","year":"1999","unstructured":"Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete Comput. Geom.\u00a022(1), 63\u201393 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of the 44th annual Symposium on the Foundations of Computer Science (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"72_CR4","volume-title":"Metric structures for Riemannian and non-Riemannian spaces","author":"M. Gromov","year":"1999","unstructured":"Gromov, M.: Metric structures for Riemannian and non-Riemannian spaces. Birkh\u00e4user, Boston (1999)"},{"key":"72_CR5","unstructured":"Hildrum, K., Kubiatowicz, J., Ma, S., Rao, S.: A note on finding nearest neighbors in growth-restricted metrics. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"key":"72_CR6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/SFCS.2001.959884","volume-title":"42nd IEEE Symposium on Foundations of Computer Science","author":"S. Har-Peled","year":"2001","unstructured":"Har-Peled, S.: A replacement for Voronoi diagrams of near linear size. In: 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, pp. 94\u2013103. IEEE Computer Soc., Los Alamitos (2001)"},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: 30th Annual ACM Symposium on Theory of Computing, May 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"72_CR8","unstructured":"Kakade, S., Kearns, M., Langford, J.: Exploration in metric state spaces. In: Proc. of the 20th International Conference on Machine Learning (2003)"},{"key":"72_CR9","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: Simple algorithms for proximity search. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. In: 30th Annual ACM Symposium on the Theory of Computing, pp. 614\u2013623 (1998)","DOI":"10.1145\/276698.276877"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: 34th Annual ACM Symposium on the Theory of Computing, pp. 63\u201366 (2002)","DOI":"10.1145\/509907.510013"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: Approximation schemes and distance labeling schemes for growth restricted metrics. To appear in the procedings of the 36th annual Symposium on the Theory of Computing (2004)","DOI":"10.1145\/1007352.1007399"}],"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-540-27836-8_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:05Z","timestamp":1605741845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}