{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:13Z","timestamp":1750307953508,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"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":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378542","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"62-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Polylogarithmic network navigability using compact metrics with small stretch"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and University Paris Diderot, Paris, France"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"University of Bordeaux, Bordeaux, France"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"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","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89571"},{"key":"e_1_3_2_1_4_1","first-page":"270","volume-title":"Efficient Routing in Networks with Long Range Contacts. In 15th International Symp. 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 Symp. on Distributed Computing (DISC),LNCS 2180 , pp. 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 Symp. on Distributed Computing (DISC),LNCS 2180, pp. 270--284, Springer, 2001.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781574.1781638"},{"key":"e_1_3_2_1_7_1","unstructured":"A. Clauset and C. Moore How Do Networks Become Navigable? http:\/\/arxiv.org\/abs\/cond-mat\/0309415v2.]]  A. Clauset and C. Moore How Do Networks Become Navigable? http:\/\/arxiv.org\/abs\/cond-mat\/0309415v2.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1081058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.008"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148145"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281117"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740493"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_30"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_70"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778583"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011793"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248379"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_35"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.163"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_22_1","volume-title":"Madrid","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg . Complex networks and decentralized search algorithm. Nevanlinna prize presentation at the International Congress of Mathematicians (ICM) , Madrid , 2006 .]] J. Kleinberg. Complex networks and decentralized search algorithm. Nevanlinna prize presentation at the International Congress of Mathematicians (ICM), Madrid, 2006.]]"},{"key":"e_1_3_2_1_23_1","first-page":"894","article-title":"Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages andProgramming (ICALP)","volume":"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 andProgramming (ICALP) , LNCS 3142 , pp. 894 -- 905 , 2004 .]] E. Lebhar, and N. Schabanel. Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages andProgramming (ICALP), LNCS 3142, pp. 894--905, 2004.]]","journal-title":"LNCS"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"e_1_3_2_1_26_1","first-page":"311","volume-title":"16th ACM-SIAM Symp. on Discrete Algo. (SODA)","author":"Martel C.","year":"2005","unstructured":"C. Martel , and V. Nguyen . Analyzing and characterizing small-world graphs . In 16th ACM-SIAM Symp. on Discrete Algo. (SODA) , pp. 311 -- 320 , 2005 .]] C. Martel, and V. Nguyen. Analyzing and characterizing small-world graphs. In 16th ACM-SIAM Symp. on Discrete Algo. (SODA), pp. 311--320, 2005.]]"},{"key":"e_1_3_2_1_27_1","first-page":"60","volume-title":"Psychology Today","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The Small-World Problem . Psychology Today , pp. 60 -- 67 , 1967 .]] S. Milgram. The Small-World Problem. Psychology Today, pp. 60--67, 1967.]]"},{"key":"e_1_3_2_1_28_1","volume-title":"Workshop of COST Action 295 \"DYNAMO\"","author":"Peleg D.","year":"2006","unstructured":"D. Peleg . Private communication . Workshop of COST Action 295 \"DYNAMO\" , Les M\u00e9nuires , Jan. 2006 .]] D. Peleg. Private communication. Workshop of COST Action 295 \"DYNAMO\", Les M\u00e9nuires, Jan. 2006.]]"},{"key":"e_1_3_2_1_29_1","unstructured":"O. Sandberg. Neighbor Selection and Hitting Probability in Small-World Graphs. Annals of Applied Probability (to appear).]]  O. Sandberg. Neighbor Selection and Hitting Probability in Small-World Graphs. Annals of Applied Probability (to appear).]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"}],"event":{"name":"SPAA08: 20th 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":"Munich Germany","acronym":"SPAA08"},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378542","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:53Z","timestamp":1750258673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":31,"alternative-id":["10.1145\/1378533.1378542","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378542","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}