{"id":"https://openalex.org/W1996924353","doi":"https://doi.org/10.1137/s0097539796308710","title":"Tight Bounds for On-Line Tree Embeddings","display_name":"Tight Bounds for On-Line Tree Embeddings","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1996924353","doi":"https://doi.org/10.1137/s0097539796308710","mag":"1996924353"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796308710","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308710","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/A5100878559","display_name":"Sandeep Bhatt","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sandeep Bhatt","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053720915","display_name":"David S. Greenberg","orcid":"https://orcid.org/0000-0002-8515-0459"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Greenberg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom Leighton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057805207","display_name":"Pangfeng Liu","orcid":"https://orcid.org/0000-0002-5466-9960"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pangfeng Liu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100878559"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3539,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87674398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"29","issue":"2","first_page":"474","last_page":"491"},"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.9994999766349792,"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.9994999766349792,"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.9955999851226807,"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.9944999814033508,"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.7921004295349121},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.7490943670272827},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6476386785507202},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5987929701805115},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5564249753952026},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48328760266304016},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.45222219824790955},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4502125680446625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4272998571395874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42026960849761963},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33270496129989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16051054000854492}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7921004295349121},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.7490943670272827},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6476386785507202},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5987929701805115},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5564249753952026},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48328760266304016},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.45222219824790955},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4502125680446625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4272998571395874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42026960849761963},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33270496129989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16051054000854492},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796308710","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308710","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2042112191","https://openalex.org/W2044643854","https://openalex.org/W2056986113","https://openalex.org/W4252591780"],"related_works":["https://openalex.org/W2978729728","https://openalex.org/W4288966080","https://openalex.org/W1530347314","https://openalex.org/W2510374584","https://openalex.org/W2134852660","https://openalex.org/W2901069556","https://openalex.org/W1556686321","https://openalex.org/W4254638342","https://openalex.org/W2098482419","https://openalex.org/W2054468904"],"abstract_inverted_index":{"Tree-structured":[0],"computations":[1],"are":[2,12,142],"relatively":[3],"easy":[4],"to":[5,19,27,102,118],"process":[6,55],"in":[7,22,52,116],"parallel.":[8],"As":[9],"leaf":[10],"processes":[11,41],"recursively":[13],"spawned":[14],"they":[15],"can":[16],"be":[17,50,58],"assigned":[18],"independent":[20],"processors":[21],"a":[23,99],"multicomputer":[24],"network.":[25],"However,":[26],"achieve":[28],"good":[29],"performance":[30,72],"the":[31,46,71,107,134],"on-line":[32,79,111],"mapping":[33],"algorithm":[34,47,113],"must":[35,49,57,114],"maintain":[36],"load":[37,120],"balance,":[38],"i.e.,":[39],"distribute":[40],"equitably":[42],"among":[43],"processors.":[44],"Additionally,":[45],"itself":[48],"distributed":[51],"nature,":[53],"and":[54,75,92,128,150],"allocation":[56,112],"completed":[59],"via":[60],"message-passing":[61],"with":[62],"minimal":[63],"communication":[64,93],"overhead.":[65],"This":[66,122],"paper":[67],"investigates":[68],"bounds":[69,105,141],"on":[70,106],"of":[73,136],"deterministic":[74,129],"randomized":[76,127],"algorithms":[77],"for":[78,125,144],"tree":[80],"embeddings.":[81],"In":[82],"particular,":[83],"we":[84],"study":[85],"trade-offs":[86],"between":[87],"computation":[88],"overhead":[89,94],"(load":[90],"imbalance)":[91],"(message":[95],"congestion).":[96],"We":[97,131],"give":[98],"simple":[100],"technique":[101,123],"derive":[103],"lower":[104],"congestion":[108],"that":[109,133],"any":[110],"incur":[115],"order":[117],"guarantee":[119],"balance.":[121],"works":[124],"both":[126],"algorithms.":[130],"prove":[132],"advantage":[135],"randomization":[137],"is":[138],"limited.":[139],"Optimal":[140],"achieved":[143],"several":[145],"networks,":[146],"including":[147],"multidimensional":[148],"grids":[149],"butterflies.":[151]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}