{"id":"https://openalex.org/W2025220494","doi":"https://doi.org/10.1137/s009753979325247x","title":"Fast Connected Components Algorithms for the EREW PRAM","display_name":"Fast Connected Components Algorithms for the EREW PRAM","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2025220494","doi":"https://doi.org/10.1137/s009753979325247x","mag":"2025220494"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979325247x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979325247x","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/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081416898","display_name":"Noam Nisan","orcid":"https://orcid.org/0000-0003-3106-6304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Noam Nisan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067484850","display_name":"Michal Parnas","orcid":"https://orcid.org/0000-0003-0189-6999"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michal Parnas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5084,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.6493868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"28","issue":"3","first_page":"1021","last_page":"1034"},"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.9937999844551086,"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.9937999844551086,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7594935894012451},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6081907749176025},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6069014668464661},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5833125114440918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5604830980300903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5445286631584167},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4902799427509308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4887356758117676},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45564043521881104},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4379720985889435},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4127194583415985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3706026077270508},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3296426832675934}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7594935894012451},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6081907749176025},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6069014668464661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5833125114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5604830980300903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5445286631584167},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4902799427509308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4887356758117676},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45564043521881104},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4379720985889435},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4127194583415985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3706026077270508},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3296426832675934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s009753979325247x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979325247x","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1821591339","https://openalex.org/W1978583881","https://openalex.org/W1981030589","https://openalex.org/W2004350101","https://openalex.org/W2039757598","https://openalex.org/W2041210515","https://openalex.org/W2069446854","https://openalex.org/W2070570981","https://openalex.org/W2086825382","https://openalex.org/W2095009392","https://openalex.org/W2125182537","https://openalex.org/W2138304862","https://openalex.org/W2611754984","https://openalex.org/W4249333804"],"related_works":["https://openalex.org/W1604162242","https://openalex.org/W2007715402","https://openalex.org/W4297688303","https://openalex.org/W2743938404","https://openalex.org/W1870020915","https://openalex.org/W3196638783","https://openalex.org/W1838063489","https://openalex.org/W4384919997","https://openalex.org/W2036758175","https://openalex.org/W1972433940"],"abstract_inverted_index":{"We":[0],"present":[1],"fast":[2],"and":[3,31,59],"efficient":[4],"parallel":[5],"algorithms":[6,17],"for":[7],"finding":[8],"the":[9,20,72],"connected":[10],"components":[11],"of":[12,71],"an":[13],"undirected":[14],"graph.":[15],"These":[16],"run":[18],"on":[19],"exclusive-read,":[21],"exclusive-write":[22],"(EREW)":[23],"PRAM.":[24],"On":[25],"a":[26],"graph":[27],"with":[28],"n":[29,57,63],"vertices":[30],"m":[32],"edges,":[33],"our":[34],"randomized":[35],"algorithm":[36,73],"runs":[37,60,74],"in":[38,61,75],"O(log":[39,62],"n)":[40,66],"time":[41,77],"using":[42,78],"$(m+n^{1+\\epsilon})/\\log":[43],"n$":[44],"EREW":[45,80],"processors":[46,58],"(for":[47],"any":[48],"fixed":[49],"$\\epsilon":[50],">":[51],"0$).":[52],"A":[53,68],"variant":[54],"uses":[55],"(m+n)/log":[56],"log":[64,65],"time.":[67],"deterministic":[69],"version":[70],"$O(\\log^{1.5}n)$":[76],"m+n":[79],"processors.":[81]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":18},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}