{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:02:09Z","timestamp":1743040929851,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_47","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"571-582","source":"Crossref","is-referenced-by-count":28,"title":["A Distributed and Oblivious Heap"],"prefix":"10.1007","author":[{"given":"Christian","family":"Scheideler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Bazzi, R., Choi, Y., Gouda, M.: Hop Chains: Secure Routing and the Establishment of Distinct Identities. In: Proc. 10th Intl. Conf. on Principles of Distributed Systems, pp. 365\u2013379 (2006)","DOI":"10.1007\/11945529_26"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Bazzi, R., Konjevod, G.: On the Establishment of Distinct Identities in Overlay Networks. In: Proc. 24th Symp. on Principles of Distributed Computing (PODC), pp. 312\u2013320 (2005)","DOI":"10.1145\/1073814.1073873"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting. In: Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 170\u2013179 (2004)","DOI":"10.1145\/1007912.1007938"},{"key":"47_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Danezis, G., Lesniewski-Laas, C., Kaashoek, F., Anderson, R.: Sybil-resistant DHT Routing. In: Proc. 10th European Symp. on Research in Computer Security, pp. 305\u2013318 (2005)","DOI":"10.1007\/11555827_18"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Douceur, J.R.: The Sybil Attack. In: Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS), pp. 251\u2013260 (2002)","DOI":"10.1007\/3-540-45748-8_24"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gauron, P.: D2B: A de Bruijn Based Content-Addressable Network. Elsevier Theoretical Computer Science\u00a0355(1) (2006)","DOI":"10.1016\/j.tcs.2005.12.006"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In: Proc. 29th ACM Symposium on Theory of Computing (STOC), pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Margolin, N., Levine, B.: Informant: Detecting Sybils Using Incentives. In: Proc. 11th Intl. Conf. on Financial Cryptography and Data Security, pp. 192\u2013207 (2007)","DOI":"10.1007\/978-3-540-77366-5_18"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel Architectures for P2P Applications: the Continuous-Discrete Approach. In: Proc. 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 50\u201359 (2003)","DOI":"10.1145\/777412.777421"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., L\u00f6ser, A.: Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks. In: Proc. 12th International Conference on World Wide Web (WWW), pp. 536\u2013543 (2003)","DOI":"10.1145\/775228.775229"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: Proc. 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Schmid, S.: A Distributed and Oblivious Heap. In: Technical University Munich, Tech Report TUM-I0906 (2009)","DOI":"10.1007\/978-3-642-02930-1_47"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Shavit, N., Zemach, A.: Scalable Concurrent Priority Queue Algorithms. In: Proc. 18th Annual ACM Symposium on Principals of Distributed Computing (PODC), pp. 113\u2013122 (1999)","DOI":"10.1145\/301308.301339"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Shavit, N., Zemach, A.: Combining Funnels: A Dynamic Approach to Software Combining. Journal of Parallel and Distributed Computing\u00a060 (2000)","DOI":"10.1006\/jpdc.2000.1621"},{"issue":"11","key":"47_CR18","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1109\/TPDS.2006.158","volume":"17","author":"M. Srivatsa","year":"2006","unstructured":"Srivatsa, M., Gedik, B., Liu, L.: Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing. IEEE Trans. Parallel Distrib. Syst.\u00a017(11), 1277\u20131293 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"47_CR19","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: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2001)","DOI":"10.1145\/383059.383071"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P., Flaxman, A.: SybilGuard: Defending Against Sybil Attacks via Social Networks. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2006)","DOI":"10.1145\/1159913.1159945"},{"key":"47_CR21","unstructured":"Zhao, B., Kubiatowicz, J.D., Joseph, A.: Tapestry: An Infrastructure for Fault-Tolerant Widearea Location and Routing. Technical report, UC Berkeley, Computer Science Division Tecnical Report UCB\/CSD-01-1141 (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:30Z","timestamp":1558403370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}