{"id":"https://openalex.org/W1969031421","doi":"https://doi.org/10.1137/0220014","title":"Parallel Algorithms for Channel Routing in the Knock-Knee Model","display_name":"Parallel Algorithms for Channel Routing in the Knock-Knee Model","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W1969031421","doi":"https://doi.org/10.1137/0220014","mag":"1969031421"},"language":"en","primary_location":{"id":"doi:10.1137/0220014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220014","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":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/021ca970-435f-42f9-9809-b299a3a90b73/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085648933","display_name":"Joseph F. J\u00e1J\u00e1","orcid":"https://orcid.org/0000-0002-8620-5650"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joseph J\u00e1J\u00e1","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043996885","display_name":"Shing-Chong Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shing-Chong Chang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085648933"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4833,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88524374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"2","first_page":"228","last_page":"245"},"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.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"}},"topics":[{"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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.9966999888420105,"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/routing","display_name":"Routing (electronic design automation)","score":0.7280725240707397},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6458902359008789},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5814400315284729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5754382014274597},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5555383563041687},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.521319568157196},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.47982215881347656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45496517419815063},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1710028052330017},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17081394791603088},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13170066475868225}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7280725240707397},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6458902359008789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5814400315284729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5754382014274597},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5555383563041687},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.521319568157196},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.47982215881347656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45496517419815063},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1710028052330017},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17081394791603088},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13170066475868225},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0220014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220014","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:drum.lib.umd.edu:1903/4756","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/4756","pdf_url":"https://drum.lib.umd.edu/bitstreams/021ca970-435f-42f9-9809-b299a3a90b73/download","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":{"id":"pmh:oai:drum.lib.umd.edu:1903/4756","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/4756","pdf_url":"https://drum.lib.umd.edu/bitstreams/021ca970-435f-42f9-9809-b299a3a90b73/download","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1969031421.pdf"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1940955666","https://openalex.org/W1978583881","https://openalex.org/W2025094485","https://openalex.org/W2025731635","https://openalex.org/W2054806836","https://openalex.org/W2171912994"],"related_works":["https://openalex.org/W1534342405","https://openalex.org/W2149224531","https://openalex.org/W2160885658","https://openalex.org/W4247716783","https://openalex.org/W2098791961","https://openalex.org/W2483530712","https://openalex.org/W2144164383","https://openalex.org/W4230539218","https://openalex.org/W2137646787","https://openalex.org/W2154215043"],"abstract_inverted_index":{"The":[0,45],"channel":[1],"routing":[2,46],"problem":[3],"of":[4,7],"a":[5],"set":[6],"two-terminal":[8],"nets":[9,23],"in":[10,53,76],"the":[11,22,30,34,48,64,69,77],"knock-knee":[12],"model":[13,67],"is":[14,29,43],"considered.":[15],"A":[16],"new":[17],"approach":[18],"to":[19],"route":[20],"all":[21,73],"within":[24],"d":[25,28],"tracks,":[26],"where":[27,80],"density,":[31],"such":[32],"that":[33,72],"corresponding":[35],"layout":[36],"can":[37],"be":[38],"realized":[39],"with":[40,57],"three":[41],"layers":[42],"developed.":[44],"and":[47],"layer":[49],"assignment":[50],"algorithms":[51],"run":[52],"$O(\\log":[54],"n)$":[55],"time":[56],"$n":[58],"/":[59],"\\log":[60],"n$":[61],"processors":[62],"on":[63],"CREW":[65],"PRAM":[66],"under":[68],"reasonable":[70],"assumption":[71],"terminals":[74],"lie":[75],"range":[78],"$[1,N]$,":[79],"$N":[81],"=":[82],"O(n)$.":[83]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}