{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:51:49Z","timestamp":1743043909651,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_27","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"321-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ning","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yekun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Rubinstein, A., Williams, R.: Distributed PCP theorems for hardness of approximation in P. In: Proceedings of 58th Annual IEEE Symposium on Foundations of Computer Science, pp. 25\u201336 (2017)","DOI":"10.1109\/FOCS.2017.12"},{"key":"27_CR2","first-page":"218","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Amir Abboud","year":"2014","unstructured":"Abboud, A., Williams, R., Yu, H.: More applications of the polynomial method to algorithm design. In: Proceedings of 26th ACM-SIAM Symposium on Discrete Algorithms, pp. 218\u2013230 (2015)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Alman, J., Chan, T.M., Williams, R.: Polynomial representations of threshold functions and algorithmic applications. In: Proceedings of 57th Annual IEEE Symposium on Foundations of Computer Science, pp. 467\u2013476 (2016)","DOI":"10.1109\/FOCS.2016.57"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, R.: Probabilistic polynomials and Hamming nearest neighbors. In: Proceedings of 56th Annual IEEE Symposium on Foundations of Computer Science, pp. 136\u2013150 (2015)","DOI":"10.1109\/FOCS.2015.18"},{"key":"27_CR5","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 51, 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"27_CR6","unstructured":"Andoni, A., Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Goodman, J., O\u2019Rourke, J., Toth, C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd (edn). Chapman and Hall\/CRC (2017)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Andoni, A., Laarhoven, T., Razenshteyn, I., Waingarten, E.: Optimal hashing-based time-space trade-offs for approximate near neighbors. In: Proceedings of 28th ACM-SIAM Symposium on Discrete Algorithms, pp. 47\u201366 (2017)","DOI":"10.1137\/1.9781611974782.4"},{"key":"27_CR8","first-page":"63-1-63-22","volume-title":"Handbook of Data Structures and Applications","author":"Sunil Arya","year":"2004","unstructured":"Arya, S., Mount, D.: Computational geometry: proximity and location. In: Mehta, D.P., Sahni, S. (eds) Handbook of Data Structures and Applications. Chapman and Hall\/CRC (2005)"},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/s00439-004-1206-7","volume":"116","author":"C Aston","year":"2005","unstructured":"Aston, C., Ralph, D., Lalo, D., Manjeshwar, S., Gramling, B., DeFreese, D., West, A., Branam, D., Thompson, L., Craft, M., et al.: Oligogenic combinations associated with breast cancer risk in women under 53 years of age. Hum. Genet. 116(3), 208\u2013221 (2005)","journal-title":"Hum. Genet."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: how $$1+1=0$$ improves information set decoding. In: EUROCRYPT, pp. 520\u2013536 (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"8","key":"27_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/2858788.2688513","volume":"50","author":"Austin R. Benson","year":"2015","unstructured":"Benson, A., Ballard, G.: A framework for practical parallel fast matrix multiplication. In: ACM SIGPLAN Notices, pp. 42\u201353 (2015)","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J Bentley","year":"1980","unstructured":"Bentley, J.: Multidimensional divide-and-conquer. Commun. ACM 23(4), 214\u2013229 (1980)","journal-title":"Commun. ACM"},{"issue":"13","key":"27_CR13","doi-asserted-by":"publisher","first-page":"7502","DOI":"10.1073\/pnas.95.13.7502","volume":"95","author":"J Cho","year":"1998","unstructured":"Cho, J., Nicolae, D., Gold, L., Fields, C., LaBuda, M., Rohal, P., Pickles, M., Qin, L., Fu, Y., Mann, J., et al.: Identification of novel susceptibility loci for inflammatory bowel disease on chromosomes 1p, 3q, and 4q: evidence for epistasis between 1p and IBD1. Proc. Natl. Acad. Sci. 95(13), 7502\u20137507 (1998)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1137\/0217052","volume":"17","author":"K Clarkson","year":"1988","unstructured":"Clarkson, K.: A randomized algorithm for closest-point queries. SIAM J. Comput. 17(4), 830\u2013847 (1988)","journal-title":"SIAM J. Comput."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of 19th Annual ACM Symposium on the Theory of Computing, pp. 1\u20136 (1987)","DOI":"10.1145\/28395.28396"},{"issue":"6","key":"27_CR16","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nrg2579","volume":"10","author":"H Cordell","year":"2009","unstructured":"Cordell, H.: Detecting gene $$\\times $$ gene interactions that underlie human diseases. Nat. Rev. Genet. 10(6), 392\u2013404 (2009)","journal-title":"Nat. Rev. Genet."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality-sensitive hashing scheme based on $$p$$-stable distributions. In: Proceedings of 20th Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"8","key":"27_CR18","doi-asserted-by":"publisher","first-page":"4166","DOI":"10.1109\/TIT.2010.2050814","volume":"56","author":"M Dubiner","year":"2008","unstructured":"Dubiner, M.: Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem. IEEE Trans. Inf. Theory 56(8), 4166\u20134179 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7164","key":"27_CR19","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1038\/nature06258","volume":"449","author":"K Frazer","year":"2007","unstructured":"Frazer, K., Ballinger, D., Cox, D., Hinds, D., Stuve, L., Gibbs, R., Belmont, J., Boudreau, A., Hardenbol, P., Leal, S., et al.: A second generation human haplotype map of over 3.1 million SNPs. Nature 449(7164), 851\u2013861 (2007)","journal-title":"Nature"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Faster algorithms for rectangular matrix multiplication. In: Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 514\u2013523 (2012)","DOI":"10.1109\/FOCS.2012.80"},{"issue":"1","key":"27_CR21","first-page":"3","volume":"2","author":"MJ Golin","year":"1995","unstructured":"Golin, M.J., Raman, R., Schwarz, C., Smid, M.: Simple randomized algorithms for closest pair problems. Nord. J. Comput. 2(1), 3\u201327 (1995)","journal-title":"Nord. J. Comput."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Huang, J., Rice, L., Matthews, D., van de Geijn, R.: Generating families of practical fast matrix multiplication algorithms. In: 2017 IEEE International on Parallel and Distributed Processing Symposium (IPDPS), pp. 656\u2013667 (2017)","DOI":"10.1109\/IPDPS.2017.56"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of 30th Annual ACM Symposium on the Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Karppa, M., Kaski, P., Kohonen, J.: A faster subquadratic algorithm for finding outlier correlations. In: Proceedings of 27th ACM-SIAM Symposium on Discrete Algorithms, pp. 1288\u20131305 (2016)","DOI":"10.1137\/1.9781611974331.ch90"},{"issue":"1","key":"27_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1995.1049","volume":"118","author":"S Khuller","year":"1995","unstructured":"Khuller, S., Matias, Y.: A simple randomized sieve algorithm for the closest-pair problem. Inf. Comput. 118(1), 34\u201337 (1995)","journal-title":"Inf. Comput."},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. In: Proceedings of 30th Annual ACM Symposium on the Theory of Computing, pp. 614\u2013623 (1998)","DOI":"10.1145\/276698.276877"},{"key":"27_CR27","first-page":"203","volume-title":"Advances in Cryptology -- EUROCRYPT 2015","author":"Alexander May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: EUROCRYPT, pp. 203\u2013228 (2015)"},{"issue":"2","key":"27_CR28","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S Meiser","year":"1993","unstructured":"Meiser, S.: Point location in arrangements of hyperplanes. Inf. Comput. 106(2), 286\u2013303 (1993)","journal-title":"Inf. Comput."},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Motwani, R., Naor, A., Panigrahi, R.: Lower bounds on locality sensitive hashing. In: Proceedings of 22nd Symposium on Computational Geometry, pp. 154\u2013157 (2006)","DOI":"10.1145\/1137856.1137881"},{"issue":"2","key":"27_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1159\/000099179","volume":"63","author":"S Musani","year":"2007","unstructured":"Musani, S., Shriner, D., Liu, N., Feng, R., Coffey, C., Yi, N., Tiwari, H., Allison, D.: Detection of gene $$\\times $$ gene interactions in genome-wide association studies of human population data. Hum. Hered. 63(2), 67\u201384 (2007)","journal-title":"Hum. Hered."},{"issue":"1","key":"27_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2578221","volume":"6","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R., Wu, Y., Zhou, Y.: Optimal lower bounds for locality-sensitive hashing (except when $$q$$ is tiny). ACM Trans. Comput. Theory 6(1), 5 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"27_CR32","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/inco.1995.1038","volume":"117","author":"R Paturi","year":"1995","unstructured":"Paturi, R., Rajasekaran, S., Reif, J.: The light bulb problem. Inf. Comput. 117, 187\u2013192 (1995)","journal-title":"Inf. Comput."},{"key":"27_CR33","unstructured":"Rabin, M.: Probabilistic algorithms. In: Algorithms and Complexity, pp. 21\u201330 (1976)"},{"key":"27_CR34","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Computational Geometry","author":"Michiel Smid","year":"2000","unstructured":"Smid, M.: Closest-point problems in computational geometry. In: Sack, J., Urrutia, J. (eds.) Handbook of computational geometry, pp. 877\u2013935. Elsevier Science Publishing (1997)"},{"key":"27_CR35","unstructured":"Stothers, A.: On the complexity of matrix multiplication. Ph.D. thesis, The University of Edinburgh (2010)"},{"issue":"4","key":"27_CR36","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"27_CR37","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2728167","volume":"62","author":"G Valiant","year":"2015","unstructured":"Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and juntas. J. ACM 62, 13 (2015). Earlier version in FOCS 2012","journal-title":"J. ACM"},{"key":"27_CR38","unstructured":"Valiant, L.G.: Functionality in neural nets. In: AAAI, pp. 629\u2013634 (1988)"},{"key":"27_CR39","doi-asserted-by":"crossref","unstructured":"Williams, R.: Faster all-pairs shortest paths via circuit complexity. In: Proceedings of 46th Annual ACM Symposium on the Theory of Computing, pp. 664\u2013673 (2014)","DOI":"10.1145\/2591796.2591811"},{"key":"27_CR40","unstructured":"Williams, R.: The polynomial method in circuit complexity applied to algorithm design (invited talk). In: Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS), pp. 47\u201360 (2014)"},{"key":"27_CR41","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/1.9781611975031.78","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ryan Williams","year":"2018","unstructured":"Williams, R.: On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity. In: Proceedings of 29th ACM-SIAM Symposium on Discrete Algorithms, pp. 1207\u20131215 (2018)"},{"key":"27_CR42","doi-asserted-by":"crossref","unstructured":"Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of 44th Annual ACM Symposium on the Theory of Computing, pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:31:24Z","timestamp":1710243084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}