{"id":"https://openalex.org/W3025963516","doi":"https://doi.org/10.1145/3350755.3400268","title":"Efficient Distributed Algorithms for the K-Nearest Neighbors Problem","display_name":"Efficient Distributed Algorithms for the K-Nearest Neighbors Problem","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3025963516","doi":"https://doi.org/10.1145/3350755.3400268","mag":"3025963516"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2005.07373","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005406921","display_name":"Reza Fathi","orcid":"https://orcid.org/0000-0002-6097-8962"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Reza Fathi","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018807670","display_name":"Anisur Rahaman Molla","orcid":"https://orcid.org/0000-0002-1537-3462"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anisur Rahaman Molla","raw_affiliation_strings":["Indian Statistical Institute Kolkata, Kolkatta, UNK, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute Kolkata, Kolkatta, UNK, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005406921"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.1359,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53943956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"527","last_page":"529"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/algorithm","display_name":"Algorithm","score":0.6281062364578247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5617438554763794},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5504874587059021},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5277857184410095},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5266634821891785},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49823904037475586},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4930529296398163},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4853328764438629},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4717201590538025},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4251422882080078},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.42245787382125854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39819228649139404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32810232043266296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3242928683757782}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6281062364578247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5617438554763794},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5504874587059021},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5277857184410095},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5266634821891785},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49823904037475586},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4930529296398163},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4853328764438629},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4717201590538025},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4251422882080078},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.42245787382125854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39819228649139404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32810232043266296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3242928683757782},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3350755.3400268","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2005.07373","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.07373","pdf_url":"https://arxiv.org/pdf/2005.07373","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3025963516","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2005.07373.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2005.07373","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2005.07373","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2005.07373","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.07373","pdf_url":"https://arxiv.org/pdf/2005.07373","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1077125406","display_name":null,"funder_award_id":"DST/INSPIRE/04/2015/002801","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G2257253181","display_name":null,"funder_award_id":"DST/INSPIRE","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G24500667","display_name":null,"funder_award_id":"CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3389892740","display_name":"CCF-BSF: AF:Small: Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3829831297","display_name":"BIGDATA: Collaborative Research: F: Efficient Distributed Computation of Large-Scale Graph Problems in Epidemiology and Contagion Dynamics","funder_award_id":"1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G481021596","display_name":null,"funder_award_id":"INSPIRE","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5987201493","display_name":null,"funder_award_id":"DST/INSPIRE/04/2015","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G6111813407","display_name":null,"funder_award_id":"IIS-1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7030850774","display_name":null,"funder_award_id":"IIS-1633720, CCF-1540512, and CCF-1717075","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"},{"id":"https://openalex.org/G844817646","display_name":null,"funder_award_id":"CCF-1540512","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8925879480","display_name":"BSF:2014424:Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1540512","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null},{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3025963516.pdf","grobid_xml":"https://content.openalex.org/works/W3025963516.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W607505555","https://openalex.org/W1945584931","https://openalex.org/W2028562297","https://openalex.org/W2069689700","https://openalex.org/W2117379916","https://openalex.org/W2152139142","https://openalex.org/W2165558283","https://openalex.org/W2167853719","https://openalex.org/W2255377757","https://openalex.org/W2460118749","https://openalex.org/W2506103507","https://openalex.org/W2734480475","https://openalex.org/W2807720788","https://openalex.org/W2962708242","https://openalex.org/W2963974406","https://openalex.org/W3025963516","https://openalex.org/W3145128584","https://openalex.org/W4236362309","https://openalex.org/W6746013146","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3032267619","https://openalex.org/W3006483492","https://openalex.org/W2964185995","https://openalex.org/W2243241072","https://openalex.org/W3203778961","https://openalex.org/W2011999472","https://openalex.org/W2969946509","https://openalex.org/W2338043901","https://openalex.org/W2962696710","https://openalex.org/W2044665238","https://openalex.org/W2036291540","https://openalex.org/W1572124373","https://openalex.org/W2167551021","https://openalex.org/W2038722889","https://openalex.org/W2949644106","https://openalex.org/W2951951149","https://openalex.org/W2605167826","https://openalex.org/W2973092201","https://openalex.org/W2951038604","https://openalex.org/W2023902609"],"abstract_inverted_index":{"The":[0],"K-nearest":[1,45],"neighbors":[2],"is":[3,86],"a":[4,17,27,35,58,76,92,96,99],"basic":[5],"problem":[6,53],"in":[7,54],"machine":[8,97],"learning":[9],"with":[10,24],"numerous":[11],"applications.":[12],"In":[13,64],"this":[14,52,65],"problem,":[15],"given":[16,91],"(training)":[18],"set":[19],"of":[20,43,102],"n":[21,71],"data":[22],"points":[23,46,72],"labels":[25,42],"and":[26,83],"query":[28,93],"point":[29,94],"q,":[30],"we":[31,67],"want":[32],"to":[33,37,47,87,95],"assign":[34],"label":[36],"q":[38],"based":[39],"on":[40],"the":[41,44,48,55,70,80,84],"query.":[49],"We":[50],"study":[51],"k-machine":[56],"model,":[57,66],"model":[59],"for":[60],"distributed":[61,74],"large-scale":[62],"data.":[63],"assume":[68],"that":[69],"are":[73],"(in":[75],"balanced":[77],"fashion)":[78],"among":[79],"k":[81],"machines":[82],"goal":[85],"compute":[88],"an":[89],"answer":[90],"using":[98],"small":[100],"number":[101],"communication":[103],"rounds.":[104]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}