{"id":"https://openalex.org/W2992892031","doi":"https://doi.org/10.1007/978-3-030-36412-0_29","title":"A True $$O(n\\log {n})$$ Algorithm for the All-k-Nearest-Neighbors Problem","display_name":"A True $$O(n\\log {n})$$ Algorithm for the All-k-Nearest-Neighbors Problem","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2992892031","doi":"https://doi.org/10.1007/978-3-030-36412-0_29","mag":"2992892031"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-36412-0_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-36412-0_29","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":"conference-paper","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/A5002039681","display_name":"Hengzhao Ma","orcid":"https://orcid.org/0000-0002-2769-6138"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengzhao Ma","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100387065","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-4119-0571"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China","institution_ids":["https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100387065"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.30189335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"362","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9799000024795532,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8048689365386963},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6480737924575806},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.590022087097168},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5481796264648438},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5445927977561951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5360214114189148},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5334529876708984},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.525272011756897},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.48740914463996887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47921591997146606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.375362753868103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.371580570936203},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06621909141540527}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8048689365386963},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6480737924575806},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.590022087097168},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5481796264648438},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5445927977561951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5360214114189148},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5334529876708984},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.525272011756897},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.48740914463996887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47921591997146606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.375362753868103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.371580570936203},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06621909141540527},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-36412-0_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-36412-0_29","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":36,"referenced_works":["https://openalex.org/W206566442","https://openalex.org/W983728296","https://openalex.org/W1589213590","https://openalex.org/W1978112828","https://openalex.org/W1978938934","https://openalex.org/W1993216012","https://openalex.org/W2022266599","https://openalex.org/W2024668293","https://openalex.org/W2027752345","https://openalex.org/W2054283387","https://openalex.org/W2055051624","https://openalex.org/W2072605585","https://openalex.org/W2080928154","https://openalex.org/W2081489756","https://openalex.org/W2101649702","https://openalex.org/W2110026675","https://openalex.org/W2114303587","https://openalex.org/W2122837498","https://openalex.org/W2128629010","https://openalex.org/W2128703518","https://openalex.org/W2132377940","https://openalex.org/W2157234796","https://openalex.org/W2161008043","https://openalex.org/W2161854574","https://openalex.org/W2165274952","https://openalex.org/W2171964228","https://openalex.org/W2494376800","https://openalex.org/W2566953954","https://openalex.org/W2744519308","https://openalex.org/W2763329850","https://openalex.org/W2901438414","https://openalex.org/W2949144621","https://openalex.org/W2965303396","https://openalex.org/W3199995296","https://openalex.org/W4300640952","https://openalex.org/W6600601450"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2113270940","https://openalex.org/W1992470151","https://openalex.org/W2127042070","https://openalex.org/W1992104669","https://openalex.org/W2521054645","https://openalex.org/W2113623403","https://openalex.org/W2018076478","https://openalex.org/W1870020915"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}