{"id":"https://openalex.org/W1930039120","doi":"https://doi.org/10.1007/3-540-10003-2_92","title":"A worst-case analysis of nearest neighbor searching by projection","display_name":"A worst-case analysis of nearest neighbor searching by projection","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W1930039120","doi":"https://doi.org/10.1007/3-540-10003-2_92","mag":"1930039120"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-10003-2_92","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-10003-2_92","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":["Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, Massachusetts","Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, Massachusetts","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109990155","display_name":"Jon Bentley","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jon Louis Bentley","raw_affiliation_strings":["Departments of Computer Science and Mathematics, Carnegie-Mellon University, 15213, Pittsburgh, Pennsylvania","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departments of Computer Science and Mathematics, Carnegie-Mellon University, 15213, Pittsburgh, Pennsylvania","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104056982"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.28205128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"470","last_page":"482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.8148015737533569},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8071688413619995},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6268351674079895},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.6205645799636841},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5985285043716431},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5921123027801514},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5864515900611877},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5740769505500793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5489197969436646},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5487103462219238},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5479226112365723},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5462696552276611},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5301699638366699},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5233216285705566},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5193601846694946},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5025126934051514},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4974835216999054},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.4645960330963135},{"id":"https://openalex.org/keywords/nearest-neighbour","display_name":"Nearest neighbour","score":0.45993685722351074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4315020740032196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3984133005142212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34634631872177124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2763948142528534},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20220094919204712},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.13013994693756104},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09287875890731812}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.8148015737533569},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8071688413619995},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6268351674079895},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.6205645799636841},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5985285043716431},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5921123027801514},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5864515900611877},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5740769505500793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5489197969436646},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5487103462219238},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5479226112365723},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5462696552276611},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5301699638366699},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5233216285705566},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5193601846694946},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5025126934051514},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4974835216999054},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.4645960330963135},{"id":"https://openalex.org/C2983946233","wikidata":"https://www.wikidata.org/wiki/Q4088109","display_name":"Nearest neighbour","level":2,"score":0.45993685722351074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4315020740032196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3984133005142212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34634631872177124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2763948142528534},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20220094919204712},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.13013994693756104},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09287875890731812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-10003-2_92","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-10003-2_92","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1584172119","https://openalex.org/W1600195236","https://openalex.org/W1983645263","https://openalex.org/W1984627834","https://openalex.org/W2024668293","https://openalex.org/W2024766881","https://openalex.org/W2047283250","https://openalex.org/W2057555275","https://openalex.org/W2128703518","https://openalex.org/W2326587081","https://openalex.org/W2341171179","https://openalex.org/W3198160809","https://openalex.org/W6664552179","https://openalex.org/W6679091573"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W1595303882","https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W2795392346","https://openalex.org/W2969538544","https://openalex.org/W2011582495","https://openalex.org/W325985789"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}