{"id":"https://openalex.org/W2150861432","doi":"https://doi.org/10.1142/s0218195992000081","title":"RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS","display_name":"RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2150861432","doi":"https://doi.org/10.1142/s0218195992000081","mag":"2150861432"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195992000081","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195992000081","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047290568","display_name":"Kenneth L. Clarkson","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"KENNETH L. CLARKSON","raw_affiliation_strings":["AT&T Bell Laboratories, Room 2C-455, 600 Mountain Avenue, Murray Hill, New Jersey 07974, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Room 2C-455, 600 Mountain Avenue, Murray Hill, New Jersey 07974, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"RICHARD COLE","raw_affiliation_strings":["Courant Institute, New York University, New York, New York, USA"],"affiliations":[{"raw_affiliation_string":"Courant Institute, New York University, New York, New York, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ROBERT E. TARJAN","raw_affiliation_strings":["Princeton University and NEC Research Institute, Princeton, New Jersey, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University and NEC Research Institute, Princeton, New Jersey, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047290568"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":0.9971,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.76145455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"02","issue":"02","first_page":"117","last_page":"133"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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":0.9988999962806702,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"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/binary-logarithm","display_name":"Binary logarithm","score":0.8107922077178955},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.7944304943084717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6377674341201782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.609323263168335},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5726739764213562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5273205637931824},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.520375669002533},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4794299006462097},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44568973779678345},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43452176451683044},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4254567325115204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33195608854293823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20718103647232056}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.8107922077178955},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.7944304943084717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6377674341201782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.609323263168335},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5726739764213562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5273205637931824},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.520375669002533},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4794299006462097},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44568973779678345},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43452176451683044},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4254567325115204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33195608854293823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20718103647232056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195992000081","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195992000081","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"}],"best_oa_location":null,"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/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2899261484","https://openalex.org/W2036758175","https://openalex.org/W1989191494","https://openalex.org/W1525123833","https://openalex.org/W2962985337","https://openalex.org/W1552026372","https://openalex.org/W3184929353","https://openalex.org/W1972433940"],"abstract_inverted_index":{"We":[0],"describe":[1],"randomized":[2],"parallel":[3,147],"algorithms":[4,16,105],"for":[5,19],"building":[6],"trapezoidal":[7],"diagrams":[8],"of":[9,48,51,116],"line":[10],"segments":[11,55,117],"in":[12],"the":[13,46,54,98,102,151],"plane.":[14],"The":[15,93,146],"are":[17,156],"designed":[18],"a":[20,57,83,114],"CRCW":[21],"PRAM.":[22],"For":[23,113],"general":[24],"segments,":[25],"we":[26,60,121],"give":[27,61,122],"an":[28,62,123],"algorithm":[29,63,85,95,124],"requiring":[30,64,86,106,125],"optimal":[31,38,65],"O(A+n":[32,126],"log":[33,40,71,73,74,76,88,108,127,130,136,138,139,141,162],"n)":[34,41,78,90,110,131,143],"expected":[35,67,79,91,111,132,144],"work":[36,68,133],"and":[37,69,82,134],"O(":[39,70,135],"time,":[42],"where":[43],"A":[44],"is":[45,100],"number":[47],"intersecting":[49],"pairs":[50],"segments.":[52],"If":[53],"form":[56],"simple":[58],"chain,":[59],"O(n)":[66],"n":[72,75,137,140,163],"*":[77,89,109,128,142],"time":[80,148],",":[81],"simpler":[84],"O(n":[87,107],"work.":[92],"serial":[94],"corresponding":[96],"to":[97],"latter":[99],"among":[101],"simplest":[103],"known":[104],"operations.":[112],"set":[115],"forming":[118],"K":[119],"chains,":[120],"n+K":[129],"time.":[145],"bounds":[149],"require":[150],"assumption":[152],"that":[153],"enough":[154],"processors":[155],"available,":[157],"with":[158],"processor":[159],"allocations":[160],"every":[161],"steps.":[164]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}