{"id":"https://openalex.org/W1963700323","doi":"https://doi.org/10.1007/bf01758753","title":"Optimal randomized parallel algorithms for computational geometry","display_name":"Optimal randomized parallel algorithms for computational geometry","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W1963700323","doi":"https://doi.org/10.1007/bf01758753","mag":"1963700323"},"language":"en","primary_location":{"id":"doi:10.1007/bf01758753","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758753","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John H. Reif","raw_affiliation_strings":["Computer Science Department, Duke University, 27706, Durham, NC, USA","Computer Science Dept., Duke University, Durham, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Duke University, 27706, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Computer Science Dept., Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110042808","display_name":"Sandeep Sen","orcid":"https://orcid.org/0009-0004-1562-8746"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sandeep Sen","raw_affiliation_strings":["Computer Science Department, Duke University, 27706, Durham, NC, USA","Computer Science Dept., Duke University, Durham, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Duke University, 27706, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Computer Science Dept., Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007364145"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.6833,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.93971631,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"1-6","first_page":"91","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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.9987000226974487,"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/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.698233962059021},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6825152635574341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5939198136329651},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5677339434623718},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5396192073822021},{"id":"https://openalex.org/keywords/point-location","display_name":"Point location","score":0.45200297236442566},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.44856733083724976},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4386025071144104},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.421889066696167},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.41882434487342834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3330637216567993},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.2818129062652588},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.26592981815338135},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12622135877609253}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.698233962059021},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6825152635574341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5939198136329651},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5677339434623718},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5396192073822021},{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.45200297236442566},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.44856733083724976},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4386025071144104},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.421889066696167},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.41882434487342834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3330637216567993},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2818129062652588},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26592981815338135},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12622135877609253},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01758753","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01758753","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W36714108","https://openalex.org/W1587590810","https://openalex.org/W1977908721","https://openalex.org/W2003583528","https://openalex.org/W2013444956","https://openalex.org/W2028637266","https://openalex.org/W2038599141","https://openalex.org/W2038722889","https://openalex.org/W2042587503","https://openalex.org/W2042607215","https://openalex.org/W2054459484","https://openalex.org/W2054691539","https://openalex.org/W2058432138","https://openalex.org/W2067631433","https://openalex.org/W2067994867","https://openalex.org/W2069489095","https://openalex.org/W2089062581","https://openalex.org/W2091027876","https://openalex.org/W2107997203","https://openalex.org/W2120104755","https://openalex.org/W2123350362","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2134008688","https://openalex.org/W2149410722","https://openalex.org/W2156372444","https://openalex.org/W2911302472","https://openalex.org/W2913031993","https://openalex.org/W3041834803","https://openalex.org/W6822105080"],"related_works":["https://openalex.org/W1586380695","https://openalex.org/W1578329712","https://openalex.org/W1981558729","https://openalex.org/W2357113990","https://openalex.org/W2266782682","https://openalex.org/W2120490947","https://openalex.org/W2618995073","https://openalex.org/W206295951","https://openalex.org/W3082558912","https://openalex.org/W1963700323"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}