{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:01:13Z","timestamp":1742932873629,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054362","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"143-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic data structures for priority queues"],"prefix":"10.1007","author":[{"given":"R.","family":"Sridhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Rajasekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"C.R.Aragon and R.G. Seidel. Randomized search trees. Proc. 30th Ann. IEEE Symposium on Foundations of Computing, 540\u2013545 (1989)","DOI":"10.1109\/SFCS.1989.63531"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Gerth St\u00f3lting Brodal. Fast meldable priority queues. Proc. 4th International Workshop, WADS, 282\u2013290 (1995)","DOI":"10.1007\/3-540-60220-8_70"},{"key":"13_CR3","unstructured":"Gerth St\u00f3lting Brodal. Worst-case efficient priority queues. Proc. 7th Ann. ACM Symposium on Discrete Algorithms, 52\u201358 (1996)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90262-Z","volume":"84","author":"G. Gambosi","year":"1991","unstructured":"Giorgio Gambosi, Enrico Nardelli, Maurizio Talamo. A Pointer-Free data structure for merging heaps and min-max heaps. Theoritical Computer Science 84(1), 107\u2013126 (1991)","journal-title":"Theoritical Computer Science"},{"issue":"11","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J. R. Driscoll","year":"1988","unstructured":"James R. Driscoll, Harold N. Gabow, Ruth Shrairman and Robert E. Tarjan. Relaxed Heaps: An alternative approach to Fibonacci Heaps with applications to parallel computing. Comm. ACM 31(11), 1343\u20131354 (1988)","journal-title":"Comm. ACM"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Jean Vuillemin. A data structure for manipulating priority queues. Comm. ACM 21(4), 309\u2013315 (1978)","journal-title":"Comm. ACM"},{"key":"13_CR7","volume-title":"The Art of Computer Programming, Volume 3, Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D. The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Michael L. Fredman and Robert E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms. Proc. 25th Annual Symposium on Foundations of Computer Science, 338\u2013346 (1984)","DOI":"10.1109\/SFCS.1984.715934"},{"key":"13_CR9","unstructured":"Michiel Smid. Lecture Notes: Selected Topics in Data Structures. Max-Plank Institute for Informatics, Germany."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Comm. ACM 33, 668\u2013676 (1990)","journal-title":"Comm. ACM"},{"key":"13_CR11","unstructured":"P. Raghavan, Lecture notes in randomized algorithms, Technical Report RC15340, IBM J.J.Watson Research Center (1989)."},{"key":"13_CR12","unstructured":"Rolf Fagerberg, A Note on Worst Case Efficient Meldable Priority Queues, Technical Report, Odense University Computer Science Department Preprint 1996-12."},{"key":"13_CR13","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1989","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts (1989)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:20:16Z","timestamp":1736407216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054362"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0054362","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}