{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:42:51Z","timestamp":1730313771807,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1073989","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"126-134","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["The expansion and mixing time of skip graphs with applications"],"prefix":"10.1145","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[{"name":"The Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28410"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011785"},{"key":"e_1_3_2_1_6_1","unstructured":"James Aspnes and Gauri Shah. Skip graphs. In fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA) pages 384--393 2003.   James Aspnes and Gauri Shah. Skip graphs. In fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA) pages 384--393 2003."},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Spectral graph theory. Regional Conference Series in Mathematics","volume":"92","author":"Chung Fan R. K.","year":"1997","journal-title":"American Mathematical Society"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780646"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794268765"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354487"},{"volume-title":"Proceedings of USITS, USENIX.","year":"2003","author":"Harvey Nicholas J. A.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007919"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Valerie King Scott Lewis and Jared Saia. On algorithms for choosing a random peer. Unpublished manuscript 2005.  Valerie King Scott Lewis and Jared Saia. On algorithms for choosing a random peer. Unpublished manuscript 2005.","DOI":"10.1145\/1011767.1011786"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011786"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209234"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_14"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872054"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_19_1","unstructured":"G. A. Margulis. Explicit constructions of concentrators. Problemy Peredachi Informatsii 9(4) October - December 1973.  G. A. Margulis. Explicit constructions of concentrators. Problemy Peredachi Informatsii 9(4) October - December 1973."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_24_1","unstructured":"Kevin C. Zatloukal Nicholas J. A. Harvey. Family trees: an ordered dictionary with optimal congestion locality degree and search time. In fifteenth ACM SIAM Symposium on Discrete Algorithms (SODA) pages 308--317 2004.   Kevin C. Zatloukal Nicholas J. A. Harvey. Family trees: an ordered dictionary with optimal congestion locality degree and search time. In fifteenth ACM SIAM Symposium on Discrete Algorithms (SODA) pages 308--317 2004."}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","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":"Las Vegas Nevada USA","acronym":"SPAA05"},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1073989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:23:49Z","timestamp":1673126629000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1073989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":24,"alternative-id":["10.1145\/1073970.1073989","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1073989","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}