{"id":"https://openalex.org/W2169192748","doi":"https://doi.org/10.1145/1148109.1148143","title":"On space-stretch trade-offs","display_name":"On space-stretch trade-offs","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2169192748","doi":"https://doi.org/10.1145/1148109.1148143","mag":"2169192748"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5078682514","display_name":"Ittai Abraham","orcid":"https://orcid.org/0000-0001-9568-7674"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]},{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]}],"countries":["CZ","IL"],"is_corresponding":false,"raw_author_name":"Ittai Abraham","raw_affiliation_strings":["Hebrew University of Jerusalem, Jerusalem, Israel","Institute of Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Institute of Computer Science","institution_ids":["https://openalex.org/I4210155092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013587418","display_name":"Cyril Gavoille","orcid":"https://orcid.org/0000-0003-3671-8607"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["University of Bordeaux, Bordeaux, France","Laboratoire Bordelais de Recherche en Informatique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bordeaux, Bordeaux, France","institution_ids":["https://openalex.org/I15057530"]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038903572","display_name":"Dahlia Malkhi","orcid":"https://orcid.org/0000-0002-7038-7250"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]},{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]},{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]}],"countries":["CZ","IL","IN"],"is_corresponding":false,"raw_author_name":"Dahlia Malkhi","raw_affiliation_strings":["Hebrew University of Jerusalem and Microsoft Research, Silicon Valley Center","Institute of Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem and Microsoft Research, Silicon Valley Center","institution_ids":["https://openalex.org/I197251160","https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Institute of Computer Science","institution_ids":["https://openalex.org/I4210155092"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"216"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6260516047477722},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6076590418815613},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.6016438603401184},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5893296003341675},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5703495740890503},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5115826725959778},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4920908808708191},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4885326623916626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4879576563835144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.428850919008255},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3653186857700348},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36021119356155396},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2159266173839569},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17946889996528625}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6260516047477722},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6076590418815613},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6016438603401184},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5893296003341675},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5703495740890503},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5115826725959778},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4920908808708191},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4885326623916626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4879576563835144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.428850919008255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3653186857700348},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36021119356155396},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2159266173839569},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17946889996528625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1148109.1148143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00371404v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00371404","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, Massachusetts, Etats-Unis, juillet 2006, Jul 2006, Cambridge, United States. pp.217-224, ⟨10.1145/1148109.1148143⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1491309030","https://openalex.org/W1492516078","https://openalex.org/W1568961751","https://openalex.org/W1575592201","https://openalex.org/W1582742149","https://openalex.org/W1587867115","https://openalex.org/W1602024640","https://openalex.org/W1638203394","https://openalex.org/W1967359086","https://openalex.org/W1981870397","https://openalex.org/W1982100216","https://openalex.org/W2004000882","https://openalex.org/W2005580106","https://openalex.org/W2006383304","https://openalex.org/W2006517766","https://openalex.org/W2007575140","https://openalex.org/W2020965855","https://openalex.org/W2033112846","https://openalex.org/W2045446569","https://openalex.org/W2046793205","https://openalex.org/W2052207834","https://openalex.org/W2053578961","https://openalex.org/W2057994027","https://openalex.org/W2058374373","https://openalex.org/W2075738659","https://openalex.org/W2077824753","https://openalex.org/W2087806988","https://openalex.org/W2091221928","https://openalex.org/W2091569826","https://openalex.org/W2096304547","https://openalex.org/W2102465486","https://openalex.org/W2129202060","https://openalex.org/W2132452995","https://openalex.org/W2150410057","https://openalex.org/W2156060048","https://openalex.org/W2293001982","https://openalex.org/W2295428206","https://openalex.org/W2579637306","https://openalex.org/W4285719527","https://openalex.org/W6672423942"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W2347665962","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2351097701","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"One":[0],"of":[1,26,36,46,151,169],"the":[2,11,16,23,27,31,34,37,41,44,52,67,131,167],"fundamental":[3],"trade-offs":[4],"in":[5,160],"compact":[6],"routing":[7,17,28,93,107,122,143,147,171],"schemes":[8,75],"is":[9,159],"between":[10,33,51],"space":[12],"used":[13],"to":[14,73,128,163],"store":[15],"table":[18],"on":[19,166],"each":[20],"node":[21,102],"and":[22,43,76,100],"stretch":[24,111],"factor":[25],"scheme":[29,42,94,144],"--":[30],"ratio":[32],"cost":[35,45,49],"route":[38],"induced":[39],"by":[40],"a":[47,56,63,80,105],"minimum":[48],"path":[50],"same":[53],"pair.":[54],"Using":[55],"distributed":[57],"Kolmogorov":[58],"Complexity":[59],"argument,":[60],"we":[61,89],"give":[62],"lower":[64,129],"bound":[65,130],"for":[66,95,135],"name-independent":[68,142],"model":[69],"that":[70,91,134],"applies":[71],"even":[72],"single-source":[74,106],"does":[77],"not":[78],"require":[79],"girth":[81],"conjecture.":[82],"For":[83],"any":[84,92,136,141],"integer":[85,137],"k":[86,138],"\u2265":[87,139],"1":[88,117,140],"prove":[90],"networks":[96],"with":[97,109,145],"arbitrary":[98,101],"weights":[99],"names":[103],"(even":[104],"scheme)":[108],"maximum":[110],"strictly":[112],"less":[113],"than":[114],"2k":[115],"+":[116,155],"requires":[118],"\u03a9((n":[119],"log":[120],"n)1/k)-bit":[121],"tables.":[123],"We":[124],"extend":[125],"our":[126],"results":[127,165],"average-stretch,":[132],"showing":[133],"(n/(9k))1/k-bit":[146],"tables":[148],"has":[149],"average-stretch":[150,168],"at":[152],"least":[153],"k/4":[154],"7/8.":[156],"This":[157],"result":[158],"sharp":[161],"contrast":[162],"recent":[164],"labeled":[170],"schemes.":[172]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}