{"id":"https://openalex.org/W1556711032","doi":"https://doi.org/10.1137/0216050","title":"Two Processor Scheduling is in $\\mathcal{NC}$","display_name":"Two Processor Scheduling is in $\\mathcal{NC}$","publication_year":1987,"publication_date":"1987-08-01","ids":{"openalex":"https://openalex.org/W1556711032","doi":"https://doi.org/10.1137/0216050","mag":"1556711032"},"language":"en","primary_location":{"id":"doi:10.1137/0216050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216050","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/A5014740431","display_name":"David P. Helmbold","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Helmbold","raw_affiliation_strings":["Stanford University Stanford CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109876781","display_name":"Ernst Mayr","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ernst Mayr","raw_affiliation_strings":["Stanford University Stanford CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":3.5633,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.91913638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"4","first_page":"747","last_page":"759"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.6175844669342041},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5578500032424927},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5278767347335815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49800968170166016},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4346689283847809},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4325682520866394},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4103039503097534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38643890619277954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3722074329853058},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3240225315093994},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2833479940891266}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6175844669342041},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5578500032424927},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5278767347335815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49800968170166016},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4346689283847809},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4325682520866394},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4103039503097534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38643890619277954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3722074329853058},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3240225315093994},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2833479940891266},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0216050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216050","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1973538756","https://openalex.org/W1975146994","https://openalex.org/W1980364701","https://openalex.org/W1982800484","https://openalex.org/W1996256520","https://openalex.org/W2027077493","https://openalex.org/W2030776771","https://openalex.org/W2033520777","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2092333800","https://openalex.org/W2288474359","https://openalex.org/W2343730655"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2381415338","https://openalex.org/W2365404242","https://openalex.org/W2115140794","https://openalex.org/W2370319203","https://openalex.org/W2041120224","https://openalex.org/W4241844845","https://openalex.org/W1966261337","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,28],"parallel":[3,46,97],"algorithm":[4,12,57],"for":[5,17,48,73,81,104],"the":[6,39,42,49,82,93,105],"two":[7,74],"processor":[8],"scheduling":[9],"problem.":[10],"This":[11],"constructs":[13],"an":[14,64,102],"optimal":[15],"schedule":[16],"unit":[18],"execution":[19],"time":[20,36],"task":[21],"systems":[22],"with":[23],"arbitrary":[24],"precedence":[25],"constraints":[26],"using":[27],"polynomial":[29],"number":[30],"of":[31,41,54,70,95],"processors":[32],"and":[33,61,89,99],"running":[34],"in":[35,38,85,92,108],"polylog":[37],"size":[40],"input.":[43],"Whereas":[44],"previous":[45],"solutions":[47],"problem":[50,107],"made":[51],"extensive":[52],"use":[53],"randomization,":[55],"our":[56],"is":[58,69],"completely":[59],"deterministic":[60],"based":[62],"on":[63],"interesting":[65],"iteration":[66],"technique.":[67],"It":[68,77],"independent":[71],"relevance":[72],"more":[75],"reasons.":[76],"provides":[78],"another":[79],"example":[80],"apparent":[83],"difference":[84],"complexity":[86],"between":[87],"decision":[88],"search":[90],"problems":[91],"context":[94],"fast":[96],"computation,":[98],"it":[100],"gives":[101],"$\\mathcal{NC}$-algorithm":[103],"matching":[106],"certain":[109],"restricted":[110],"cases.":[111]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}