{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:36Z","timestamp":1750307916467,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:00:00Z","timestamp":1181347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,9]]},"DOI":"10.1145\/1248377.1248379","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Universal augmentation schemes for network navigability"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and Univ. Paris 7, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"Univ. of Bordeaux, Bordeaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[{"name":"Gdansk Univ. of Technology, Gdansk, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuelle","family":"Lebhar","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris 7, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571862"},{"key":"e_1_3_2_1_3_1","first-page":"270","volume-title":"Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180","author":"Barri\u00e8re L.","year":"2001","unstructured":"L. Barri\u00e8re , P. Fraigniaud , E. Kranakis , and D. Krizanc . Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180 , pages 270 -- 284 , Springer , 2001 . L. Barri\u00e8re, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180, pages 270--284, Springer, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/302970"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148145"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_26"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_30"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_70"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011793"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_35"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_14_1","volume-title":"International Congress of Mathematicians (ICM)","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg . Complex networks and decentralized search algorithm . In International Congress of Mathematicians (ICM) , 2006 . J. Kleinberg. Complex networks and decentralized search algorithm. In International Congress of Mathematicians (ICM), 2006."},{"key":"e_1_3_2_1_15_1","first-page":"894","volume-title":"31st International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142","author":"Lebhar E.","year":"2004","unstructured":"E. Lebhar , and N. Schabanel . Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142 , pages 894 -- 905 , 2004 . E. Lebhar, and N. Schabanel. Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142, pages 894--905, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"e_1_3_2_1_18_1","first-page":"60","volume-title":"The Small-World Problem. Psychology Today","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The Small-World Problem. Psychology Today , pages 60 -- 67 , 1967 . S. Milgram. The Small-World Problem. Psychology Today, pages 60--67, 1967."},{"key":"e_1_3_2_1_19_1","volume-title":"Workshop of COST Action 295 \"DYNAMO\"","author":"Peleg D.","year":"2005","unstructured":"D. Peleg . Private communication. Workshop of COST Action 295 \"DYNAMO\" , Les M\u00e9nuires , Jan. 2005 . D. Peleg. Private communication. Workshop of COST Action 295 \"DYNAMO\", Les M\u00e9nuires, Jan. 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"event":{"name":"SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"San Diego California USA","acronym":"SPAA07"},"container-title":["Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1248377.1248379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:25Z","timestamp":1750258285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248379"}},"subtitle":["overcoming the \u221a\n            <i>n<\/i>\n            -barrier"],"short-title":[],"issued":{"date-parts":[[2007,6,9]]},"references-count":22,"alternative-id":["10.1145\/1248377.1248379","10.1145\/1248377"],"URL":"https:\/\/doi.org\/10.1145\/1248377.1248379","relation":{},"subject":[],"published":{"date-parts":[[2007,6,9]]},"assertion":[{"value":"2007-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}