{"id":"https://openalex.org/W2003533142","doi":"https://doi.org/10.1137/0223030","title":"Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems","display_name":"Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2003533142","doi":"https://doi.org/10.1137/0223030","mag":"2003533142"},"language":"en","primary_location":{"id":"doi:10.1137/0223030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0223030","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"erratum","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":["Duke University Durham NC"],"affiliations":[{"raw_affiliation_string":"Duke University Durham NC","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":["Duke Univ., Durham, NC and Indian Univ. of Technology, New Delhi, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Duke Univ., Durham, NC and Indian Univ. of Technology, New Delhi, India#TAB#","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":null,"apc_paid":null,"fwci":6.06416727,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.96910928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"2","first_page":"447","last_page":"448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9962000250816345,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6727485656738281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6417701244354248},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.6161782741546631},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.612938404083252},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5863706469535828},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.575982391834259},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5631177425384521},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4792751967906952},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4461982250213623},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43549612164497375},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.42686140537261963},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42424216866493225},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4146113395690918},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4118036925792694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3857402205467224},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.27485308051109314},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.18676549196243286}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6727485656738281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6417701244354248},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.6161782741546631},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.612938404083252},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5863706469535828},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.575982391834259},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5631177425384521},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4792751967906952},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4461982250213623},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43549612164497375},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.42686140537261963},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42424216866493225},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4146113395690918},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4118036925792694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3857402205467224},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.27485308051109314},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.18676549196243286},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0223030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0223030","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2174440985","https://openalex.org/W2112526268","https://openalex.org/W1964089073","https://openalex.org/W2036758175","https://openalex.org/W1989191494","https://openalex.org/W1972433940","https://openalex.org/W2074631028","https://openalex.org/W16541537","https://openalex.org/W2102902634","https://openalex.org/W1605979146"],"abstract_inverted_index":{"Further":[0],"applications":[1],"of":[2,43,50,72,123,127],"random":[3,128],"sampling":[4],"techniques":[5],"which":[6],"have":[7],"been":[8],"used":[9],"for":[10,40,60,92,146,165],"deriving":[11],"efficient":[12,58],"parallel":[13,37],"algorithms":[14,59,84],"are":[15,113,153],"presented":[16],"by":[17],"J.":[18],"H.":[19],"Reif":[20],"and":[21,78,95,130],"S.":[22],"Sen":[23],"[Proc.":[24],"16th":[25],"International":[26],"Conference":[27],"on":[28,75],"Parallel":[29],"Processing,":[30],"1987].":[31],"This":[32],"paper":[33],"presents":[34],"an":[35],"optimal":[36,155],"randomized":[38,114],"algorithm":[39],"computing":[41],"intersection":[42],"half":[44],"spaces":[45],"in":[46,67,86,101,115,132,156],"three":[47,68],"dimensions.":[48],"Because":[49],"well-known":[51],"reductions,":[52],"these":[53],"methods":[54],"also":[55,154],"yield":[56],"equally":[57],"fundamental":[61],"problems":[62],"like":[63],"the":[64,109,116,133,161],"convex":[65],"hull":[66],"dimensions,":[69],"Voronoi":[70],"diagram":[71],"point":[73],"sites":[74],"a":[76,102,121],"plane,":[77],"Euclidean":[79],"minimal":[80],"spanning":[81],"tree.":[82],"The":[83],"run":[85],"time":[87,135,163],"$T":[88],"=":[89,98],"O(\\log":[90],"n)$":[91],"worst-case":[93],"inputs":[94],"use":[96,120],"$P":[97],"O(n)$":[99],"processors":[100],"CREW":[103],"PRAM":[104],"model":[105],"where":[106],"n":[107],"is":[108],"input":[110],"size.":[111],"They":[112,152],"sense":[117],"that":[118],"they":[119],"total":[122],"only":[124],"polylogarithmic":[125],"number":[126],"bits":[129],"terminate":[131],"claimed":[134],"bound":[136,164],"with":[137],"probability":[138],"$1":[139],"-":[140,142],"n^{":[141],"\\alpha":[143],"}":[144],"$":[145],"any":[147],"fixed":[148],"$\\alpha":[149],">":[150],"0$.":[151],"$P\\cdot":[157],"T$":[158],"product":[159],"since":[160],"sequential":[162],"all":[166],"thes...":[167]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}