{"id":"https://openalex.org/W2081385108","doi":"https://doi.org/10.1137/0217009","title":"Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time","display_name":"Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time","publication_year":1988,"publication_date":"1988-02-01","ids":{"openalex":"https://openalex.org/W2081385108","doi":"https://doi.org/10.1137/0217009","mag":"2081385108"},"language":"en","primary_location":{"id":"doi:10.1137/0217009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217009","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/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":true,"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/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"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/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["New York Univ., New York, NY and Tel Aviv Univ., Tel Aviv, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"New York Univ., New York, NY and Tel Aviv Univ., Tel Aviv, Israel#TAB#","institution_ids":["https://openalex.org/I16391192","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042866153"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":25.2355,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.99874214,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"1","first_page":"128","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9986000061035156,"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.7475675344467163},{"id":"https://openalex.org/keywords/numbering","display_name":"Numbering","score":0.6961655020713806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6774712800979614},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5326599478721619},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4983024597167969},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42591604590415955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35675540566444397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3140532374382019},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26293110847473145}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7475675344467163},{"id":"https://openalex.org/C191916993","wikidata":"https://www.wikidata.org/wiki/Q362019","display_name":"Numbering","level":2,"score":0.6961655020713806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774712800979614},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5326599478721619},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4983024597167969},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42591604590415955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35675540566444397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3140532374382019},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26293110847473145},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0217009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217009","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:archive.org:approximateparal00cole","is_oa":false,"landing_page_url":"http://archive.org/details/approximateparal00cole","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":[{"id":"https://metadata.un.org/sdg/8","score":0.4000000059604645,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1550098107","https://openalex.org/W1973732321","https://openalex.org/W1995040285","https://openalex.org/W2039757598","https://openalex.org/W2048958388","https://openalex.org/W2058557216","https://openalex.org/W2067661972","https://openalex.org/W2130566259","https://openalex.org/W2143462372"],"related_works":["https://openalex.org/W2380905223","https://openalex.org/W2316187651","https://openalex.org/W2005053760","https://openalex.org/W2070865675","https://openalex.org/W4212854884","https://openalex.org/W1970073092","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2054653010","https://openalex.org/W2070426974"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,44,60],"novel":[3],"scheduling":[4],"problem;":[5],"it":[6],"is":[7],"solved":[8],"in":[9],"parallel":[10],"by":[11],"repeated,":[12],"rapid,":[13],"approximate":[14],"reschedulings.":[15],"This":[16],"leads":[17],"to":[18,33,37],"the":[19,51],"first":[20],"optimal":[21],"logarithmic":[22],"time":[23],"PRAM":[24,40],"algorithm":[25],"for":[26,43],"list":[27],"ranking.":[28],"Companion":[29],"papers":[30],"show":[31],"how":[32],"apply":[34],"these":[35],"results":[36],"obtain":[38],"improved":[39],"upper":[41],"bounds":[42],"variety":[45],"of":[46,62],"problems":[47,63],"on":[48,64],"graphs,":[49],"including":[50],"following:":[52],"connectivity,":[53],"biconnectivity,":[54],"Euler":[55],"tour":[56],"and":[57,59],"$st$-numbering,":[58],"number":[61],"trees.":[65]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}