{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:25:31Z","timestamp":1765826731974},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":[[2005,7]]},"DOI":"10.1007\/s00446-004-0115-2","type":"journal-article","created":{"date-parts":[[2004,11,24]],"date-time":"2004-11-24T13:53:11Z","timestamp":1101304391000},"page":"21-42","source":"Crossref","is-referenced-by-count":63,"title":["Lock-free dynamic hash tables with open addressing"],"prefix":"10.1007","volume":"18","author":[{"given":"H.","family":"Gao","sequence":"first","affiliation":[]},{"given":"J. F.","family":"Groote","sequence":"additional","affiliation":[]},{"given":"W. H.","family":"Hesselink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"115_CR1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/253145.253159","volume":"15","author":"Anderson","year":"2","unstructured":"Anderson JH, Ramamurthy S, Jeffay K: Real-time computing with lock-free shared objects. ACM Trans Comput Syst 15(2):134-165 (1997)","journal-title":"ACM Trans Comput Syst"},{"key":"115_CR2","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"Attiya","year":"1990","unstructured":"Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R: Renaming in an asynchronous environment. J ACM 37:524-548 (1990)","journal-title":"J ACM"},{"key":"115_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Noy A, Dolev D: Shared-memory vs. message-passing in an asynchronous distributed environment. In: Proc. 8th ACM Symp. on principles of distributed computing, 1989, pp 307-318","DOI":"10.1145\/72981.73003"},{"key":"115_CR4","doi-asserted-by":"crossref","unstructured":"Barnes G: A method for implementing lock-free shared-data structures. In: Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures. ACM Press, 1993, pp 261-270","DOI":"10.1145\/165231.165265"},{"key":"115_CR5","doi-asserted-by":"crossref","unstructured":"Cassez F, Jard C, Rozoy B, Dermot M: Modeling and verification of parallel processes (2000) 4th Summer School, MOVEP 2000, Nantes, France","DOI":"10.1007\/3-540-45510-8"},{"key":"115_CR6","unstructured":"Gao H, Groote JF, Hesselink WH: PVS verification. !http:\/\/www.cs.rug.nl\/~wim\/mechver! !hashtable! (2003)"},{"key":"115_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/PL00008930","volume":"14","author":"Groote","year":"2001","unstructured":"Groote JF, Hesselink WH, Mauw S, Vermeulen R: An algorithm for the asynchronous write-all problem based on process collision. Distr Comput 14:75-81 (2001)","journal-title":"Distr Comput"},{"key":"115_CR8","unstructured":"Harbison SP: Modula-3. Prentice Hall, New Yersey 1992"},{"key":"115_CR9","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"Herlihy","year":"1991","unstructured":"Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 13:124-149 (1991)","journal-title":"ACM Trans Program Lang Syst"},{"key":"115_CR10","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"Herlihy","year":"1993","unstructured":"Herlihy M: A methodology for implementing highly concurrent data objects. ACM Trans Program Lang Syst 15:745-770 (1993)","journal-title":"ACM Trans Program Lang Syst"},{"key":"115_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"Herlihy","year":"1990","unstructured":"Herlihy M, Wing J: Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12:463-492 (1990)","journal-title":"ACM Trans Program Lang Syst"},{"key":"115_CR12","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/71.139204","volume":"3","author":"Herlihy","year":"1992","unstructured":"Herlihy MP, Moss JEB: Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3:304-311 (1992)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"115_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01784240","volume":"9","author":"Hesselink","year":"1995","unstructured":"Hesselink WH: Wait-free linearization with a mechanical proof. Distr Comput 9:21-36 (1995)","journal-title":"Distr Comput"},{"key":"115_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s002360050042","volume":"33","author":"Hesselink","year":"1996","unstructured":"Hesselink WH: Bounded delay for a free address. Acta Inf 33:233-254 (1996)","journal-title":"Acta Inf"},{"key":"115_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/PL00008924","volume":"14","author":"Hesselink","year":"2001","unstructured":"Hesselink WH, Groote JF: Wait-free concurrent memory management by Create, and Read until Deletion (CaRuD). Distr Comput 14:31-39 (2001)","journal-title":"Distr Comput"},{"key":"115_CR16","doi-asserted-by":"crossref","unstructured":"Kanellakis PC, Shvartsman AA: Fault-tolerant parallel computation. Kluwer Academic Publishers, Dordrecht 1997","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"115_CR17","unstructured":"Knuth DE: The Art of Computer Programming. Part 3, Sorting and searching. Addison-Wesley 1973"},{"key":"115_CR18","doi-asserted-by":"crossref","unstructured":"LaMarca A: A performance evaluation of lock-free synchronization protocols. In: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing. ACM Press 1994, pp 130-140","DOI":"10.1145\/197917.197975"},{"key":"115_CR19","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"Lamport","year":"1994","unstructured":"Lamport L: The temporal logic of actions. ACM Trans Program Lang Syst 16:872-923 (1994)","journal-title":"ACM Trans Program Lang Syst"},{"key":"115_CR20","unstructured":"Lynch NA: Distributed Algorithms. Morgan Kaufman, San Francisco 1996"},{"key":"115_CR21","doi-asserted-by":"crossref","unstructured":"Manna Z, Pnueli A: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York 1992","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"115_CR22","doi-asserted-by":"crossref","unstructured":"Michael MM: High performance dynamic lock-free hash tables and list-based sets. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. ACM Press 2002, pp 73-82","DOI":"10.1145\/564870.564881"},{"key":"115_CR23","unstructured":"Owre S, Shankar N, Rushby JM, Stringer-Calvert DWJ: PVS Version 2.4, System Guide, Prover Guide, PVS Language Reference (2001) !http:\/\/pvs.csl.sri.com!"},{"key":"115_CR24","doi-asserted-by":"crossref","unstructured":"Rajwar R, Goodman JR: Transactional lock-free execution of lock-based programs. In: Tenth international conference on architectural support for programming languages and operating systems on Proceedings of the 10th international conference on architectural support for programming languages and operating systems (ASPLOS-X). ACM Press 2002, pp 5-17","DOI":"10.1145\/605397.605399"},{"key":"115_CR25","doi-asserted-by":"crossref","unstructured":"Shalev O, Shavit N: Split-ordered lists: lock-free extensible hash tables. In: Proceedings of the twenty-second annual symposium on Principles of distributed computing. ACM Press 2003, pp 102-111","DOI":"10.1145\/872035.872049"},{"key":"115_CR26","doi-asserted-by":"crossref","unstructured":"Sundell H, Tsigas P: Scalable and lock-free concurrent dictionaries. In: Proceedings of the 2004 ACM symposium on Applied computing. ACM Press 2004, pp 1438-1445","DOI":"10.1145\/967900.968188"},{"key":"115_CR27","unstructured":"Valois JD: Implementing lock-free queues. In: Proceedings of the seventh international conference on Parallel and Distributed Computing Systems, 1994, pp 64-69"},{"key":"115_CR28","first-page":"ERRATA","volume":"JD","author":"Valois","year":"1995","unstructured":"Valois JD: Lock-free linked lists using compare-and-swap. In: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing. ACM Press 1995, pp 214-222. See also Valois JD: ERRATA. Lock-free linked lists using compare-and-swap. Unpublished manuscript (1995)","journal-title":"See also Valois"},{"key":"115_CR29","unstructured":"Wirth N: Algorithms $+$ Data Structures $=$ Programs. Prentice Hall 1976"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0115-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-004-0115-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0115-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T08:23:14Z","timestamp":1585988594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-004-0115-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s00446-004-0115-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}