{"id":"https://openalex.org/W2739371021","doi":"https://doi.org/10.1145/3087801.3087871","title":"Some Sequential Algorithms are Almost Always Parallel","display_name":"Some Sequential Algorithms are Almost Always Parallel","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2739371021","doi":"https://doi.org/10.1145/3087801.3087871","mag":"2739371021"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087871","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033930662"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.2193,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58095028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.974399983882904,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.974399983882904,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9722999930381775,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9524999856948853,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.7972952127456665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7863970398902893},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.685303807258606},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6636900305747986},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6511306762695312},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6335335969924927},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.5445537567138672},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.5006654262542725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46500998735427856},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.41045209765434265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39369890093803406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1896744966506958},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0941120982170105}],"concepts":[{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.7972952127456665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7863970398902893},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.685303807258606},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6636900305747986},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6511306762695312},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6335335969924927},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5445537567138672},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.5006654262542725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46500998735427856},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.41045209765434265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39369890093803406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1896744966506958},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0941120982170105}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087801.3087871","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8215190201","display_name":null,"funder_award_id":"1314590","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1586380695","https://openalex.org/W1578329712","https://openalex.org/W2357113990","https://openalex.org/W2069977975","https://openalex.org/W2366284310","https://openalex.org/W4249486448","https://openalex.org/W59885310","https://openalex.org/W2045296115","https://openalex.org/W2032991918","https://openalex.org/W1501027479"],"abstract_inverted_index":{"Over":[0],"the":[1,28,35],"years":[2],"many":[3],"interesting":[4],"and":[5,41],"efficient":[6,50],"parallel":[7,51],"algorithms":[8],"have":[9],"been":[10,24],"developed":[11],"to":[12,26,48],"solve":[13],"a":[14],"wide":[15],"variety":[16],"of":[17,37],"problems,":[18],"but":[19],"not":[20],"much":[21],"attention":[22],"has":[23],"paid":[25],"studying":[27],"inherent":[29],"parallelism":[30],"in":[31],"sequential":[32],"algorithms---i.e.,":[33],"understanding":[34],"depth":[36],"their":[38],"dependence":[39,44],"structure,":[40],"how":[42],"shallow":[43],"structures":[45],"might":[46],"beused":[47],"develop":[49],"implementations.":[52]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}