{"id":"https://openalex.org/W2030999197","doi":"https://doi.org/10.1137/0218035","title":"Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms","display_name":"Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms","publication_year":1989,"publication_date":"1989-06-01","ids":{"openalex":"https://openalex.org/W2030999197","doi":"https://doi.org/10.1137/0218035","mag":"2030999197"},"language":"en","primary_location":{"id":"doi:10.1137/0218035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218035","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":"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/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mikhail J. Atallah","raw_affiliation_strings":["Purdue Univ., West LaFayette, IN"],"affiliations":[{"raw_affiliation_string":"Purdue Univ., West LaFayette, IN","institution_ids":["https://openalex.org/I219193219"]}]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Cole","raw_affiliation_strings":["New York Univ, New York, NY,"],"affiliations":[{"raw_affiliation_string":"New York Univ, New York, NY,","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["Johns Hopkins University, baltimore, MD"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, baltimore, MD","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113562454"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":11.5751,"has_fulltext":false,"cited_by_count":175,"citation_normalized_percentile":{"value":0.99272349,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"18","issue":"3","first_page":"499","last_page":"532"},"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.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.8301655054092407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6228657960891724},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6207231283187866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5753913521766663},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5215458869934082},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4781709313392639},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.4469974935054779},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43830054998397827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42267173528671265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.351131796836853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2670188546180725}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.8301655054092407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6228657960891724},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6207231283187866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5753913521766663},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5215458869934082},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4781709313392639},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.4469974935054779},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43830054998397827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42267173528671265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.351131796836853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2670188546180725},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":3,"locations":[{"id":"doi:10.1137/0218035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218035","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"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-1575","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/576","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"},{"id":"pmh:oai:archive.org:cascadingdividea00atal","is_oa":false,"landing_page_url":"http://archive.org/details/cascadingdividea00atal","pdf_url":null,"source":{"id":"https://openalex.org/S4210203682","display_name":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","issn_l":"0366-4457","issn":["0366-4457"],"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":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"},{"id":"https://openalex.org/F4320310145","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95"},{"id":"https://openalex.org/F4320319918","display_name":"York University","ror":"https://ror.org/05fq50484"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1822595813","https://openalex.org/W1975510415","https://openalex.org/W1978583881","https://openalex.org/W2003583528","https://openalex.org/W2016482138","https://openalex.org/W2029814178","https://openalex.org/W2042607215","https://openalex.org/W2049864887","https://openalex.org/W2052770190","https://openalex.org/W2064303129","https://openalex.org/W2069489095","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2092472617","https://openalex.org/W2115636961","https://openalex.org/W2130566259","https://openalex.org/W2143462372"],"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/W206295951","https://openalex.org/W2041057519","https://openalex.org/W3082558912","https://openalex.org/W1551221054"],"abstract_inverted_index":{"Techniques":[0],"for":[1,11,18,40],"parallel":[2,9,35],"divide-and-conquer":[3],"are":[4,22,37],"presented,":[5],"resulting":[6],"in":[7,59,73],"improved":[8,20],"algorithms":[10,21,36,56],"a":[12,51,65,68],"number":[13,70],"of":[14,54,71],"problems.":[15],"The":[16],"problems":[17],"which":[19],"given":[23,39],"include":[24],"segment":[25],"intersection":[26],"detection,":[27],"trapezoidal":[28],"decomposition,":[29],"and":[30,48],"planar":[31],"point":[32],"location.":[33],"Efficient":[34],"algo":[38],"fractional":[41],"cascading,":[42],"three-dimensional":[43],"maxima,":[44],"two-set":[45],"dominance":[46],"counting,":[47],"visibility":[49],"from":[50],"point.":[52],"All":[53],"the":[55,74],"presented":[57],"run":[58],"$O(\\log":[60],"n)$":[61],"time":[62],"with":[63],"either":[64],"linear":[66],"or":[67],"sublinear":[69],"processors":[72],"CREW":[75],"PRAM":[76],"model.":[77]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}