{"id":"https://openalex.org/W2162487598","doi":"https://doi.org/10.1142/s0218195995000167","title":"SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM","display_name":"SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2162487598","doi":"https://doi.org/10.1142/s0218195995000167","mag":"2162487598"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195995000167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195995000167","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11858/00-001M-0000-0014-B708-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085594740","display_name":"Hans\u2010Peter Lenhof","orcid":"https://orcid.org/0000-0002-5820-9961"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HANS-PETER LENHOF","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik D-66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik D-66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MICHIEL SMID","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik D-66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik D-66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":3.1765,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9386931,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"05","issue":"03","first_page":"273","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9886000156402588,"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.9886000156402588,"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.988099992275238,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.986299991607666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7439030408859253},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6872574687004089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6503783464431763},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.57965487241745},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5784616470336914},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5671952962875366},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.505228579044342},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5031935572624207},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47428804636001587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4580676853656769},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45397117733955383},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.43580514192581177},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4273570477962494},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41756415367126465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3759986460208893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13498815894126892}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7439030408859253},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6872574687004089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6503783464431763},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.57965487241745},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5784616470336914},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5671952962875366},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.505228579044342},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5031935572624207},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47428804636001587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4580676853656769},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45397117733955383},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.43580514192581177},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4273570477962494},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41756415367126465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3759986460208893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13498815894126892},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0218195995000167","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195995000167","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:517882","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517882","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry & Applications, v.5, 273-288 (1995)","raw_type":"Article"},{"id":"pmh:oai:escidoc.org:escidoc:1834886","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-B708-9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:pure.mpg.de:item_1331869","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-ACC3-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:escidoc.org:escidoc:1834886","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-B708-9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2113270940","https://openalex.org/W1992470151","https://openalex.org/W2743938404","https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W2018076478","https://openalex.org/W2887154986","https://openalex.org/W1838063489"],"abstract_inverted_index":{"Let":[0],"S":[1,53],"be":[2,19],"a":[3,14,39],"set":[4,52],"of":[5,35,84,123,126],"n":[6,111],"points":[7],"in":[8,50,54,65,96],"D-dimensional":[9],"space,":[10],"where":[11],"D":[12],"is":[13,33,42,87],"constant,":[15],"and":[16,24,30,71,106],"let":[17],"k":[18,47],"an":[20,108,124],"integer":[21],"between":[22],"1":[23],"[Formula:":[25],"see":[26],"text].":[27],"A":[28,81],"new":[29],"simpler":[31],"proof":[32],"given":[34,43,88,122],"Salowe\u2019s":[36,75],"theorem,":[37],"i.e.,":[38],"sequential":[40,128],"algorithm":[41,63,76,86],"that":[44],"computes":[45],"the":[46,51,66,90],"closest":[48],"pairs":[49],"O(n":[55,109],"log":[56,100,101,110,112,113],"n+k)":[57,114],"time,":[58],"using":[59],"O(n+k)":[60],"space.":[61],"The":[62],"fits":[64],"algebraic":[67],"decision":[68],"tree":[69],"model":[70],"is,":[72],"therefore,":[73],"optimal.":[74],"seems":[77],"difficult":[78],"to":[79],"parallelize.":[80],"parallel":[82,104],"version":[83,94],"our":[85,127],"for":[89],"CRCW-PRAM":[91],"model.":[92],"This":[93],"runs":[95],"O((log":[97],"n)":[98,102],"2":[99],"expected":[103],"time":[105],"has":[107],"time-processor":[115],"product.":[116],"Finally,":[117],"actual":[118],"running":[119],"times":[120],"are":[121],"implementation":[125],"algorithm.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}