{"id":"https://openalex.org/W1981314573","doi":"https://doi.org/10.1137/0218076","title":"The Two-Processor Scheduling Problem is in Random NC","display_name":"The Two-Processor Scheduling Problem is in Random NC","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W1981314573","doi":"https://doi.org/10.1137/0218076","mag":"1981314573"},"language":"en","primary_location":{"id":"doi:10.1137/0218076","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218076","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/A5071039750","display_name":"Umesh Vazirani","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Umesh V. Vazirani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007368382","display_name":"Vijay V. Vazirani","orcid":"https://orcid.org/0000-0002-4106-9077"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijay V. Vazirani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071039750"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5098,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.6773993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"6","first_page":"1140","last_page":"1148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.6342079639434814},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6104990243911743},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49744394421577454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42307645082473755},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4166721701622009},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36948060989379883},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3206496834754944},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32041335105895996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3195086121559143},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20321866869926453}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6342079639434814},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6104990243911743},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49744394421577454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42307645082473755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4166721701622009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36948060989379883},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3206496834754944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32041335105895996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3195086121559143},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20321866869926453}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218076","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218076","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:ecommons.cornell.edu:1813/6800","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/6800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1510646708","https://openalex.org/W1556711032","https://openalex.org/W1973538756","https://openalex.org/W1985061810","https://openalex.org/W1996256520","https://openalex.org/W2011594074","https://openalex.org/W2028503265","https://openalex.org/W2080132708","https://openalex.org/W2089939118","https://openalex.org/W2150446509","https://openalex.org/W2343730655","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W4210445513","https://openalex.org/W4240416043"],"related_works":["https://openalex.org/W1985455246","https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W2476923378","https://openalex.org/W2803221307","https://openalex.org/W2951826204","https://openalex.org/W4211001408","https://openalex.org/W2366147410","https://openalex.org/W2775050868","https://openalex.org/W2897343264"],"abstract_inverted_index":{"An":[0,13],"efficient":[1],"parallel":[2],"algorithm":[3,18,46],"$({\\text{RNC}}^2":[4],")$":[5],"for":[6],"the":[7,45,61,64,71,80],"two-processor":[8],"scheduling":[9],"problem":[10,36],"is":[11,19,47],"presented.":[12],"interesting":[14],"feature":[15],"of":[16,44,50,53,63,67,73],"this":[17,35],"that":[20],"it":[21],"finds":[22],"a":[23,27,30,38,48,51,57,68],"highest-level-first":[24],"schedule;":[25],"such":[26],"schedule":[28],"defines":[29],"lexicographically":[31],"first":[32],"solution":[33],"to":[34],"in":[37,76,79],"natural":[39],"way.":[40],"A":[41],"key":[42],"ingredient":[43],"generalization":[49],"theorem":[52],"Tutte":[54,65],"which":[55],"establishes":[56],"one-to-one":[58],"correspondence":[59],"between":[60],"bases":[62],"matrix":[66],"graph":[69],"and":[70],"sets":[72],"matched":[74],"nodes":[75],"maximum":[77],"matchings":[78],"graph.":[81]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}