{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:53:11Z","timestamp":1775667191148,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,17]]},"DOI":"10.1145\/1073814.1073823","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Distance estimation and object location via rings of neighbors"],"prefix":"10.1145","author":[{"given":"Aleksandrs","family":"Slivkins","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"I. Abraham D. Malkhi and O. Dobzinski \"LAND: Stretch (1 + \u03b5) locality-aware networks for DHTs \" SODA 2004.]] I. Abraham D. Malkhi and O. Dobzinski \"LAND: Stretch (1 + \u03b5) locality-aware networks for DHTs \" SODA 2004.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011789"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007916"},{"key":"e_1_3_2_1_4_1","volume-title":"DISC 2004]]","author":"Abraham I."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073978"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1997"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"e_1_3_2_1_8_1","unstructured":"B. Awerbuch and D. Peleg \"Sparse partitions \" FOCS 1990.]] B. Awerbuch and D. Peleg \"Sparse partitions \" FOCS 1990.]]"},{"key":"e_1_3_2_1_9_1","unstructured":"H.T-H. Chan A. Gupta B.M. Maggs and S. Zhou \"On hierarchical routing in bounded-growth metrics \" SODA 2005. Full and updated version available as a Carnegie Mellon University ETR CMU-PDL-04-106 2004.]] H.T-H. Chan A. Gupta B.M. Maggs and S. Zhou \"On hierarchical routing in bounded-growth metrics \" SODA 2005. Full and updated version available as a Carnegie Mellon University ETR CMU-PDL-04-106 2004.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1081058"},{"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.1109\/90.958323"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1705"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"C. Gavoille M. Katz N.A. Katz C. Paul and D. Peleg \"Approximate Distance Labeling Schemes \" ESA 2001]] C. Gavoille M. Katz N.A. Katz C. Paul and D. Peleg \"Approximate Distance Labeling Schemes \" ESA 2001]]","DOI":"10.1007\/3-540-44676-1_40"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0073-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J. Heinonen Lectures on analysis on metric spaces Springer Verlag Universitext 2001.]] J. Heinonen Lectures on analysis on metric spaces Springer Verlag Universitext 2001.]]","DOI":"10.1007\/978-1-4613-0131-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007918"},{"key":"e_1_3_2_1_19_1","volume-title":"Univ. of Southern California","author":"Hotz S.","year":"1994"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/217382.217463"},{"key":"e_1_3_2_1_21_1","unstructured":"A.Gupta R. Krauthgamer and J.R. Lee \"Bounded geometries fractals and low-distortion embeddings \" FOCS 2003.]] A.Gupta R. Krauthgamer and J.R. Lee \"Bounded geometries fractals and low-distortion embeddings \" FOCS 2003.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"J. Kleinberg \"Small-world phenomena and the dynamics of information \" NIPS 2001.]] J. Kleinberg \"Small-world phenomena and the dynamics of information \" NIPS 2001.]]","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_25_1","unstructured":"C. Kommareddy N. Shankar B. Bhattacharjee \"Finding close friends on the Internet \" ICNP 2001.]] C. Kommareddy N. Shankar B. Bhattacharjee \"Finding close friends on the Internet \" ICNP 2001.]]"},{"key":"e_1_3_2_1_26_1","unstructured":"R. Krauthgamer J.R. Lee \"Navigating nets: Simple algorithms for proximity search \" SODA 2004.]] R. Krauthgamer J.R. Lee \"Navigating nets: Simple algorithms for proximity search \" SODA 2004.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.41"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"J.R. Lee M. Mendel and A. Naor \"Metric structures in L1: Dimension snowflakes and average distortion \" LATIN 2004.]] J.R. Lee M. Mendel and A. Naor \"Metric structures in L1: Dimension snowflakes and average distortion \" LATIN 2004.]]","DOI":"10.1007\/978-3-540-24698-5_44"},{"key":"e_1_3_2_1_29_1","unstructured":"D. Malkhi personal communication 2005.]] D. Malkhi personal communication 2005.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"e_1_3_2_1_32_1","unstructured":"Ch. Martel and V. Nguyen \"Analyzing and characterizing small-world graphs \" SODA 2005.]] Ch. Martel and V. Nguyen \"Analyzing and characterizing small-world graphs \" SODA 2005.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064117"},{"key":"e_1_3_2_1_34_1","first-page":"61","article-title":"The small world problem","volume":"1","author":"Milgram S.","year":"1967","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_35_1","volume-title":"The 25th Int. Workshop on Graph-Theoretical Concepts in Computer Science","author":"Peleg D.","year":"1999"},{"key":"e_1_3_2_1_36_1","volume-title":"SIAM","author":"Peleg D.","year":"2000"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65953"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000118"},{"key":"e_1_3_2_1_39_1","unstructured":"A. Slivkins \"Distributed approaches to triangulation and embedding \" SODA 2005.]] A. Slivkins \"Distributed approaches to triangulation and embedding \" SODA 2005.]]"},{"key":"e_1_3_2_1_40_1","unstructured":"A. Slivkins \"Distance Estimation and Object Location via Rings of Neighbors \" full version: invited to the special issue of Distributed Computing available from the author's webpage at www.cs.cornell.edu\/people\/slivkins\/research.]] A. Slivkins \"Distance Estimation and Object Location via Rings of Neighbors \" full version: invited to the special issue of Distributed Computing available from the author's webpage at www.cs.cornell.edu\/people\/slivkins\/research.]]"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"K. Talwar \"Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics \" STOC 2004.]] K. Talwar \"Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics \" STOC 2004.]]","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080103"}],"event":{"name":"PODC05: ACM Symposium on Principles of Distributed Computing","location":"Las Vegas NV USA","acronym":"PODC05","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073814.1073823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T12:55:56Z","timestamp":1706446556000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073814.1073823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,17]]},"references-count":45,"alternative-id":["10.1145\/1073814.1073823","10.1145\/1073814"],"URL":"https:\/\/doi.org\/10.1145\/1073814.1073823","relation":{},"subject":[],"published":{"date-parts":[[2005,7,17]]},"assertion":[{"value":"2005-07-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}