{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:30:42Z","timestamp":1694633442128},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,10,2]],"date-time":"2008-10-02T00:00:00Z","timestamp":1222905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s00446-008-0071-3","type":"journal-article","created":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T06:20:31Z","timestamp":1222842031000},"page":"385-393","source":"Crossref","is-referenced-by-count":5,"title":["The expansion and mixing time of skip graphs with applications"],"prefix":"10.1007","volume":"21","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,2]]},"reference":[{"key":"71_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Deterministic simulation in LOGSPACE. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC), pp. 132\u2013140 (1987)","DOI":"10.1145\/28395.28410"},{"key":"71_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"Alon N., Milman V.: \u03bb 1, isoperimetric inequalities for graphs and superconcentrators. J. Comb. Theory 38, 73\u201388 (1985)","journal-title":"J. Comb. Theory"},{"key":"71_CR3","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 384\u2013393 (2003)"},{"key":"71_CR4","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral graph theory. In: Regional Conference Series in Mathematics, vol. 92, pp. 1\u2013212. American Mathematical Society (1997)","DOI":"10.1090\/cbms\/092"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of Alon\u2019s second eigenvalue conjecture. In: Proceedings of the Thirty-fifth ACM Symposium on Theory of Computing (STOC), pp. 720\u2013724 (2003)","DOI":"10.1145\/780542.780646"},{"key":"71_CR6","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"71_CR7","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: Proceedings of USITS, USENIX (2003)"},{"key":"71_CR8","doi-asserted-by":"crossref","unstructured":"King, V., Lewis, S., Saia, J.: On algorithms for choosing a random peer (2005) (unpublished manuscript)","DOI":"10.1145\/1011767.1011786"},{"key":"71_CR9","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 125\u2013130 (2004)","DOI":"10.1145\/1011767.1011786"},{"key":"71_CR10","unstructured":"Law, C., Siu, K.-Y.: Distributed construction of random expander graphs. In: Proceedings of IEEE INFOCOM (2003)"},{"key":"71_CR11","doi-asserted-by":"crossref","unstructured":"Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The case for a hybrid P2P search infrastructure. In: 3rd International Workshop on Peer-to-Peer Systems (IPTPS), pp. 141\u2013150 (2004)","DOI":"10.1007\/978-3-540-30183-7_14"},{"key":"71_CR12","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Combinatorics, Paul Erd\u00f6s is Eighty, vol. 2. Keszthely, Hungary, pp. 1\u201346 (1993)"},{"key":"71_CR13","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Routing networks for distributed hash tables. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 133\u2013142 (2003)","DOI":"10.1145\/872035.872054"},{"key":"71_CR14","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 54\u201363 (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"71_CR15","unstructured":"Margulis, G.A.: Explicit constructions of concentrators. Problemy Peredachi Informatsii, 9(4), October\u2013December 1973"},{"key":"71_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 50\u201359 (2003)","DOI":"10.1145\/777412.777421"},{"key":"71_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Second International Workshop on Peer-to-Peer Systems, pp. 88\u201397 (2003)","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"71_CR18","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"71_CR19","unstructured":"Zatloukal, K.C., Harvey, N.J.A.: Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. In: Fifteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 308\u2013317 (2004)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0071-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0071-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0071-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T16:39:57Z","timestamp":1631896797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0071-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,2]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["71"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0071-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,2]]}}}