{"id":"https://openalex.org/W2028201463","doi":"https://doi.org/10.1137/s0097539791218275","title":"Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima","display_name":"Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W2028201463","doi":"https://doi.org/10.1137/s0097539791218275","mag":"2028201463"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791218275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791218275","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/A5103285481","display_name":"Omer Berkman","orcid":"https://orcid.org/0000-0003-0503-7366"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Omer Berkman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","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":false,"raw_author_name":"Joseph J\u00e1J\u00e1","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023434102","display_name":"Sridhar Krishnamurthy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sridhar Krishnamurthy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039862374","display_name":"Ramakrishna Thurimella","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramakrishna Thurimella","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5103285481"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.1468039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"3","first_page":"449","last_page":"465"},"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.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"}},"topics":[{"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/T11269","display_name":"Algorithms and Data Compression","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/rectangle","display_name":"Rectangle","score":0.762317419052124},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.676210343837738},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6626832485198975},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6074309945106506},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5955715775489807},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5599488019943237},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4905373454093933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.479027658700943},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4762142598628998},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44906583428382874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4333106577396393},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4331924021244049},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40040427446365356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39388513565063477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33764469623565674}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.762317419052124},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.676210343837738},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6626832485198975},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6074309945106506},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5955715775489807},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5599488019943237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4905373454093933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.479027658700943},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4762142598628998},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44906583428382874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4333106577396393},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4331924021244049},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40040427446365356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39388513565063477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33764469623565674},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539791218275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791218275","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","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1608852523","https://openalex.org/W2051584339","https://openalex.org/W2059245171","https://openalex.org/W2074558211","https://openalex.org/W2078971298","https://openalex.org/W2089062581"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2743938404","https://openalex.org/W2099271296","https://openalex.org/W1838063489","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2025220494","https://openalex.org/W1577155814","https://openalex.org/W1545170796","https://openalex.org/W2038796709"],"abstract_inverted_index":{"A":[0,40,77],"new":[1],"parallel":[2,71,117,156,188,208],"algorithm":[3,42,189,209],"for":[4,11,45,66,155,159,190],"the":[5,15,46,67,87,90,94,104,162,171,191,199],"prefix":[6,95,172],"minima":[7,96,173],"problem":[8,97,163,174],"is":[9,38,43,84,92,135,148,152,167,196],"presented":[10,44],"inputs":[12],"drawn":[13],"from":[14],"range":[16,88],"of":[17,23,81,89,116,139,164,198],"integers":[18],"$[1..s]$.":[19],"For":[20],"an":[21,136,181,206],"input":[22,91],"size":[24],"n,":[25],"it":[26,52],"runs":[27,53,211],"in":[28,54,112,145,212],"$O(\\log":[29,55,182],"\\log":[30,31,107],"s)$":[32],"time":[33,59,109,186],"and":[34],"$O(n)$":[35],"work":[36,83],"(which":[37],"optimal).":[39],"faster":[41,102],"special":[47],"case":[48],"$s":[49,176],"=":[50,177],"n$;":[51],"^":[56,183],"*":[57,184],"n)$":[58,108,185],"with":[60,175],"optimal":[61,187,207],"work.":[62],"Both":[63],"algorithms":[64],"are":[65],"Priority":[68],"concurrent-read":[69],"concurrent-write":[70],"random":[72],"access":[73],"machine":[74],"(CROW":[75],"PRAM).":[76],"possibly":[78],"surprising":[79],"outcome":[80],"this":[82],"that,":[85,154],"whenever":[86],"restricted,":[93],"can":[98],"be":[99,204],"solved":[100],"significantly":[101],"than":[103,170],"$\\Omega":[105],"(\\log":[106],"lower":[110],"bound":[111],"a":[113,143],"decision":[114],"model":[115],"computation,":[118,161],"as":[119],"described":[120],"by":[121],"Valiant":[122],"[SIAM":[123],"J.":[124],"Comput.,":[125],"4":[126],"(1975),":[127],"pp.":[128],"348\u2013355].":[129],"The":[130],"top-bottom":[131,165,192],"routing":[132,140,166,193],"problem,":[133],"which":[134],"important":[137],"subproblem":[138],"wires":[141],"around":[142],"rectangle":[144],"two":[146],"layers,":[147],"also":[149],"considered.":[150],"It":[151],"established":[153],"(and":[157],"hence":[158],"serial)":[160],"no":[168],"harder":[169],"n$,":[178],"thus":[179],"giving":[180],"problem.":[194],"This":[195],"one":[197],"first":[200],"nontrivial":[201],"problems":[202],"to":[203],"given":[205],"that":[210],"sublogarithmic":[213],"time.":[214]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}