{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:38Z","timestamp":1760202638291},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108436"},{"type":"electronic","value":"9783540387459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10843-2_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:28:17Z","timestamp":1330190897000},"page":"417-431","source":"Crossref","is-referenced-by-count":52,"title":["A sparse table implementation of priority queues"],"prefix":"10.1007","author":[{"given":"Alon","family":"Itai","sequence":"first","affiliation":[]},{"given":"Alan G.","family":"Konheim","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"34_CR1","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, \"The Design And Analysis Of Computer Algorithms\", Addison-Wesley, 1974."},{"key":"34_CR2","unstructured":"J. L. Bentley, D. Detig, L. Guibas and J. Saxe, \"An Optimal Data Structure For Minimal-Storage Dynamic Searching\", Computer Science Department, Carnegie-Mellon University, 1978."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"M. R. Brown and R. E. Tarjan, \"A Representation For Linear Lists With Moveable Fingers\", Tenth Annual Symposium on the Theory of Computing, San Diego, California, 1978.","DOI":"10.1145\/800133.804328"},{"issue":"3","key":"34_CR4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J. L. Bently","year":"1976","unstructured":"J. L. Bently and A. C. Yao, \"An Almost Optimal Algorithm For Searching\", Information Processing Letters, 5, 3, 1976, pp. 82\u201387.","journal-title":"Information Processing Letters"},{"key":"34_CR5","unstructured":"W. Feller, \"An Introduction To Probability Theory And Its Applications\", Volume 1, John Wiley, 1950."},{"issue":"4","key":"34_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(79)90060-7","volume":"9","author":"W. R. Franklin","year":"1979","unstructured":"W. R. Franklin, \"Padded Lists: Set Operations In Expected O(log log N) Time\", Information Processing Letters, 9, 4, November 1979, pp. 161\u2013166.","journal-title":"Information Processing Letters"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, E. M. McCreight, M. F. Plass and J. R. Roberts, \"A New Representation For Linear Lists\", 9th Annual Symposium Theory Of Complexity, pp. 49\u201360, 1977.","DOI":"10.1145\/800105.803395"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"A.Itai, A. G. Konheim and M. Rodeh, \"A Sparse Table Implementation Of Priority Queues\", RC-8550, IBM Thomas J. Watson Research Center, November 1980.","DOI":"10.1007\/3-540-10843-2_34"},{"key":"34_CR9","unstructured":"D. E. Knuth, \"The Art Of Computer Programming: Fundmanetal Algorithms\", Addison-Wesley, 1969."},{"key":"34_CR10","unstructured":"__________, \"The Art Of Computer Programming: Searching And Sorting\", Addison-Wesley, 1973."},{"issue":"6","key":"34_CR11","doi-asserted-by":"crossref","first-page":"1266","DOI":"10.1137\/0114101","volume":"14","author":"A. G. Konheim","year":"1966","unstructured":"A. G. Konheim and B. Weiss, \"An Occupancy Discipline and Applications\", SIAM Journal Of Applied Mathematics, 14, 6, November 1966, pp. 1266\u20131274.","journal-title":"SIAM Journal Of Applied Mathematics"},{"key":"34_CR12","volume-title":"\"Sorting And Searching Using Controlled Density Arrays\", TR 78-362","author":"R. Melville","year":"1978","unstructured":"R. Melville and D. Gries, \"Sorting And Searching Using Controlled Density Arrays\", TR 78-362, Cornell University, Ithaca, New York, 1978. (See also IPL, July 1980, pp. 169\u2013172.)"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","volume":"21","author":"Y. Perl","year":"1978","unstructured":"Y. Perl, A. Itai and H. Avni, \"Interpolation Search a LogLog N Search\", CACM, 21, 1978, pp. 550\u2013553.","journal-title":"CACM"},{"key":"34_CR14","unstructured":"E. M. Reingold, J. Nievergelt and N. Deo, \"Combinatorial Algorithms: Theory And Practice\", Prentice Hall, 1977."},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"V. Vuillemin","year":"1978","unstructured":"V. Vuillemin, \"A Data Structure For Manipulating Priority Queues\", CACM, 21, pp. 309\u2013315, 1978.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10843-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:39Z","timestamp":1605643419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10843-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108436","9783540387459"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-10843-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}