{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:15:21Z","timestamp":1726071321920},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_24","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"350-364","source":"Crossref","is-referenced-by-count":89,"title":["Hopscotch Hashing"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[]},{"given":"Moran","family":"Tzafrir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"unstructured":"Lea, D.: Personal communication (January 2003)","key":"24_CR2"},{"key":"24_CR3","volume-title":"Fundamental algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming. In: Fundamental algorithms, 3rd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1997)","edition":"3"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. Journal of Algorithms\u00a051(2), 122\u2013144 (2004)","journal-title":"Journal of Algorithms"},{"key":"24_CR5","volume-title":"Handbook of algorithms and data structures: in Pascal and C","author":"G.H. Gonnet","year":"1991","unstructured":"Gonnet, G.H., Baeza-Yates, R.: Handbook of algorithms and data structures: in Pascal and C, 2nd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1991)","edition":"2"},{"unstructured":"Lea, D.: Hash table util.concurrent.concurrenthashmap in java.util.concurrent the Java Concurrency Package, \n http:\/\/gee.cs.oswego.edu\/cgi-bin\/viewcvs.cgi\/-jsr166\/-src\/main\/java\/util\/concurrent\/","key":"24_CR6"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1145\/1147954.1147958","volume":"53","author":"O. Shalev","year":"2006","unstructured":"Shalev, O., Shavit, N.: Split-ordered lists: Lock-free extensible hash tables. Journal of the ACM\u00a053(3), 379\u2013405 (2006)","journal-title":"Journal of the ACM"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11561927_10","volume-title":"Distributed Computing","author":"C. Purcell","year":"2005","unstructured":"Purcell, C., Harris, T.: Non-blocking hashtables with open addressing. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 108\u2013121. Springer, Heidelberg (2005)"},{"key":"24_CR9","volume-title":"The Art of Multiprocessor Programming","author":"M. Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, NY (2008)"},{"key":"24_CR10","first-page":"522","volume-title":"ICDCS 2003: Proceedings of the 23rd International Conference on Distributed Computing Systems","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS 2003: Proceedings of the 23rd International Conference on Distributed Computing Systems, p. 522. IEEE Computer Society, Washington (2003)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:07:18Z","timestamp":1714795638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}