{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T23:33:20Z","timestamp":1721604800672},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,11]],"date-time":"2011-08-11T00:00:00Z","timestamp":1313020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00224-011-9357-0","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T07:42:34Z","timestamp":1312962154000},"page":"185-211","source":"Crossref","is-referenced-by-count":7,"title":["Two Skew-Binary Numeral Systems and One Application"],"prefix":"10.1007","volume":"50","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Claus","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,11]]},"reference":[{"key":"9357_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-642-13122-6_17","volume-title":"Proceedings of the 5th International Conference on Fun with Algorithms","author":"A. Elmasry","year":"2010","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: The magic of a number system. In: Proceedings of the 5th International Conference on Fun with Algorithms. Lecture Notes in Computer Science, vol.\u00a06099, pp.\u00a0156\u2013165. Springer, Berlin (2010)"},{"issue":"4","key":"9357_CR2","doi-asserted-by":"crossref","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. Commun. ACM 21(4), 309\u2013315 (1978)","journal-title":"Commun. ACM"},{"key":"9357_CR3","unstructured":"Clancy, M., Knuth, D.: A programming and problem-solving seminar. Technical report STAN-CS-77-606, Department of Computer Science, Stanford University (1977)"},{"issue":"5","key":"9357_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(83)90106-0","volume":"17","author":"E.W. Myers","year":"1983","unstructured":"Myers, E.W.: An applicative random-access stack. Inf. Process. Lett. 17(5), 241\u2013248 (1983)","journal-title":"Inf. Process. Lett."},{"key":"9357_CR5","doi-asserted-by":"crossref","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)"},{"issue":"6","key":"9357_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Commun. ACM 7(6), 347\u2013348 (1964)","journal-title":"Commun. ACM"},{"issue":"4","key":"9357_CR7","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G.H. Gonnet","year":"1986","unstructured":"Gonnet, G.H., Munro, J.I.: Heaps on heaps. SIAM J. Comput. 15(4), 964\u2013971 (1986)","journal-title":"SIAM J. Comput."},{"key":"9357_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-19487-8_1","volume-title":"Proceedings of the 1st Scandinavian Workshop on Algorithm Theory","author":"S. Carlsson","year":"1988","unstructured":"Carlsson, S., Munro, J.I., Poblete, P.V.: An implicit binomial queue with constant insertion time. In: Proceedings of the 1st Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol.\u00a0318, pp. 1\u201313. Springer, Berlin (1988)"},{"issue":"6","key":"9357_CR9","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1017\/S095679680000201X","volume":"6","author":"G.S. Brodal","year":"1996","unstructured":"Brodal, G.S., Okasaki, C.: Optimal purely functional priority queues. J. Funct. Program. 6(6), 839\u2013857 (1996)","journal-title":"J. Funct. Program."},{"issue":"1","key":"9357_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0890-5401(90)90026-E","volume":"86","author":"J.R. Sack","year":"1990","unstructured":"Sack, J.R., Strothotte, T.: A characterization of heaps and its applications. Inf. Comput. 86(1), 69\u201386 (1990)","journal-title":"Inf. Comput."},{"issue":"3","key":"9357_CR11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1142\/S0129054103001856","volume":"14","author":"S. Bansal","year":"2003","unstructured":"Bansal, S., Sreekanth, S., Gupta, P.: M-heap: A modified heap data structure. Int. J. Found. Comput. Sci. 14(3), 491\u2013502 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9357_CR12","volume-title":"Proceedings of the 3rd International Conference on Fun with Algorithms","author":"N.J.A. Harvey","year":"2004","unstructured":"Harvey, N.J.A., Zatloukal, K.: The post-order heap. In: Proceedings of the 3rd International Conference on Fun with Algorithms (2004)"},{"issue":"1","key":"9357_CR13","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/1435375.1435389","volume":"5","author":"A. Elmasry","year":"2008","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Multipartite priority queues. ACM Trans. Algorithms 5(1), 14:1\u201314:19 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9357_CR14","doi-asserted-by":"crossref","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 Inform. 45(3), 193\u2013210 (2008)","journal-title":"Acta Inform."},{"key":"9357_CR15","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"3","key":"9357_CR16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M.R. Brown","year":"1978","unstructured":"Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7(3), 298\u2013319 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9357_CR17","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9357-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9357-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9357-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T03:25:18Z","timestamp":1638242718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9357-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9357"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9357-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,11]]}}}