{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:36Z","timestamp":1725558396905},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_4","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"26-37","source":"Crossref","is-referenced-by-count":5,"title":["Strictly-Regular Number System and Data Structures"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Claus","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Clancy, M., Knuth, D.: A programming and problem-solving seminar. Technical Report STAN-CS-77-606, Dept. of Computer Science, Stanford University (1977)"},{"key":"4_CR2","first-page":"49","volume-title":"Proceedings of the 9th Annual ACM Symposium on Theory of Computing","author":"L.J. Guibas","year":"1977","unstructured":"Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation for linear lists. In: Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pp. 49\u201360. ACM Press, New York (1977)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Vuillemin, J.: A data structure for manipulating priority queues. Communications of the ACM\u00a021(4), 309\u2013315 (1978)","journal-title":"Communications of the ACM"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511530104","volume-title":"Purely Functional Data Structures","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)"},{"key":"4_CR5","volume-title":"Compilers: Principles, Techniques, & Tools","author":"A.V. Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, & Tools, 2nd edn. Pearson Education, Inc., London (2007)","edition":"2"},{"key":"4_CR6","first-page":"573","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"H. Kaplan","year":"2002","unstructured":"Kaplan, H., Shafrir, N., Tarjan, R.E.: Meldable heaps and Boolean union-find. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 573\u2013582. ACM Press, New York (2002)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-60220-8_70","volume-title":"Algorithms and Data Structures","author":"G.S. Brodal","year":"1995","unstructured":"Brodal, G.S.: Fast meldable priority queues. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 282\u2013290. Springer, Heidelberg (1995)"},{"key":"4_CR8","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52\u201358. ACM\/SIAM (1996)"},{"key":"4_CR9","first-page":"202","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"H. Kaplan","year":"1996","unstructured":"Kaplan, H., Tarjan, R.E.: Purely functional representations of catenable sorted lists. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 202\u2013211. ACM, New York (1996)"},{"issue":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1142\/S0129054106004510","volume":"17","author":"A. Elmasry","year":"2006","unstructured":"Elmasry, A.: A priority queue with the working-set property. International Journal of Foundations of Computer Science\u00a017(6), 1455\u20131465 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00236-008-0070-7","volume":"45","author":"A. Elmasry","year":"2008","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Two-tier relaxed heaps. Acta Informatica\u00a045(3), 193\u2013210 (2008)","journal-title":"Acta Informatica"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Multipartite priority queues. ACM Transactions on Algorithms, Article 14\u00a05(1) (2008)","DOI":"10.1145\/1435375.1435389"},{"key":"4_CR13","unstructured":"Jensen, C.: A note on meldable heaps relying on data-structural bootstrapping. CPH STL Report 2009-2, Department of Computer Science, University of Copenhagen (2009), http:\/\/cphstl.dk"},{"key":"4_CR14","first-page":"93","volume-title":"Proceedings of the 27th Annual ACM Symposium on Theory of Computing","author":"H. Kaplan","year":"1995","unstructured":"Kaplan, H., Tarjan, R.E.: Persistent lists with catenation via recursive slow-down. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 93\u2013102. ACM, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:26Z","timestamp":1606185746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}