{"id":"https://openalex.org/W2039757598","doi":"https://doi.org/10.1016/0890-5401(91)90019-x","title":"Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms","display_name":"Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms","publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W2039757598","doi":"https://doi.org/10.1016/0890-5401(91)90019-x","mag":"2039757598"},"language":"en","primary_location":{"id":"doi:10.1016/0890-5401(91)90019-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(91)90019-x","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information and Computation","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/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"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"]},{"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":["Courant Institute, New York University, 251 Mercer St., New York, New York 10012 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute, New York University, 251 Mercer St., New York, New York 10012 USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel","The University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, Maryland 20742 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"The University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, Maryland 20742 USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":7.1577,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.97962303,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"92","issue":"1","first_page":"1","last_page":"47"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/logarithm","display_name":"Logarithm","score":0.7007344365119934},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6514635682106018},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.617752730846405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5217945575714111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5200283527374268},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4354787766933441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43311116099357605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4255712032318115},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4166647791862488},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3508046269416809}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7007344365119934},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6514635682106018},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.617752730846405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5217945575714111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5200283527374268},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4354787766933441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43311116099357605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4255712032318115},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4166647791862488},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3508046269416809},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0890-5401(91)90019-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(91)90019-x","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information and Computation","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":46,"referenced_works":["https://openalex.org/W54257340","https://openalex.org/W103797413","https://openalex.org/W198890980","https://openalex.org/W1510835612","https://openalex.org/W1550098107","https://openalex.org/W1655990431","https://openalex.org/W1766349993","https://openalex.org/W1859417806","https://openalex.org/W1981573606","https://openalex.org/W1995040285","https://openalex.org/W2004090025","https://openalex.org/W2004350101","https://openalex.org/W2005608544","https://openalex.org/W2011591414","https://openalex.org/W2019998590","https://openalex.org/W2020810308","https://openalex.org/W2022143201","https://openalex.org/W2034282023","https://openalex.org/W2035243909","https://openalex.org/W2046946959","https://openalex.org/W2057354699","https://openalex.org/W2058557216","https://openalex.org/W2061303458","https://openalex.org/W2067661972","https://openalex.org/W2069446854","https://openalex.org/W2074276908","https://openalex.org/W2076461794","https://openalex.org/W2078629151","https://openalex.org/W2081385108","https://openalex.org/W2086825382","https://openalex.org/W2098265073","https://openalex.org/W2125182537","https://openalex.org/W2130566259","https://openalex.org/W2156372444","https://openalex.org/W2340365916","https://openalex.org/W4210697874","https://openalex.org/W4213327355","https://openalex.org/W6608022175","https://openalex.org/W6630407249","https://openalex.org/W6633059782","https://openalex.org/W6639052918","https://openalex.org/W6653178880","https://openalex.org/W6655622440","https://openalex.org/W6674873640","https://openalex.org/W6678325626","https://openalex.org/W6683044779"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W1994598067","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2099271296","https://openalex.org/W2055625272","https://openalex.org/W1838063489","https://openalex.org/W2036758175"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":18},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}