{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T08:09:37Z","timestamp":1763366977108},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:11Z","timestamp":1330204031000},"page":"437-449","source":"Crossref","is-referenced-by-count":57,"title":["Skip lists: A probabilistic alternative to balanced trees"],"prefix":"10.1007","author":[{"given":"William","family":"Pugh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"36_CR1","unstructured":"Aho, A., Hopcroft, J., and Ullman, J. Data Structures and Algorithms, Addison-Wesley Publishing Company, 1983."},{"key":"36_CR2","unstructured":"Bentley, J., Leighton, F. T., Lepley, M., F. Stanat, D., and Steele, J. M. A Randomized Data Structure For Ordered Sets, MIT\/LCS Technical Memo 297, May 1986."},{"key":"36_CR3","unstructured":"Knuth, D. \"Sorting and Searching,\" The Art of Computer Programming, Vol. 3, Addison-Wesley Publishing Company, 1973."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Pugh, W., and Teitelbaum, T. \"Incremental Computation via Function Caching,\" Proc. of the Sixteenth conference on the Principles of Programming Languages, 1989.","DOI":"10.1145\/75277.75305"},{"key":"36_CR5","series-title":"Tech Report","volume-title":"Skip Lists: A Probabilistic Alternative to Balanced Trees","author":"W. Pugh","year":"1989","unstructured":"Pugh, W., Skip Lists: A Probabilistic Alternative to Balanced Trees, Tech Report TR-CS-2190, University of Maryland, College Park, 1989."},{"key":"36_CR6","series-title":"Tech Report","volume-title":"Concurrent Maintainence of Skip Lists","author":"W. Pugh","year":"1989","unstructured":"Pugh, W., Concurrent Maintainence of Skip Lists, Tech Report TR-CS-2222, University of Maryland, College Park, 1989."},{"key":"36_CR7","unstructured":"Pugh, W., A Skip List Cookbook, in preparation."},{"issue":"3","key":"36_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., and Tarjan, R. \"Self-Adjusting Binary Search Trees,\" Journal of the ACM, Vol. 32, No. 3, July 1985, pp. 652\u2013666.","journal-title":"Journal of the ACM"},{"key":"36_CR9","unstructured":"Wirth, N. Algorithms+Data Structures=Programs, Prentice-Hall, 1976."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:37Z","timestamp":1619571877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}