{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:55Z","timestamp":1725664255017},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:11:09Z","timestamp":1330269069000},"page":"59-71","source":"Crossref","is-referenced-by-count":1,"title":["Concurrency in an O (log log N) priority queue"],"prefix":"10.1007","author":[{"given":"Brandon","family":"Dixon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA 1974."},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02126797","volume":"8","author":"M. Ajtai","year":"1988","unstructured":"M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica, 8(3) (1988) pp. 235\u2013247.","journal-title":"Combinatorica"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","volume":"63","author":"M. Ajtai","year":"1984","unstructured":"M. Ajtai, M. Fredman, and J. Koml\u00f3s, Hash functions for priority queues, Information and Control, 63 (1984) pp. 217\u2013225.","journal-title":"Information and Control"},{"issue":"No.11","key":"6_CR4","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TC.1984.1676379","volume":"c-33","author":"M. Carey","year":"1984","unstructured":"M. Carey and C. Thompson, An efficient implementation of search trees on [log N+1] processors, IEEE Trans. on Computers, Vol. c-33, No. 11, Nov. 1984, pp. 1038\u20131041.","journal-title":"IEEE Trans. on Computers"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289064","volume":"14","author":"C. Ellis","year":"1980","unstructured":"C. Ellis, Concurrent search and insertion into 2\u20133 trees, Acta Informatica, 14 (1980) pp.63\u201386.","journal-title":"Acta Informatica"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory, 10 (1977) pp.99\u2013127.","journal-title":"Math. Systems Theory"},{"issue":"No.3","key":"6_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, Vol. 6, No. 3 (1977) pp.80\u201382.","journal-title":"Information Processing Letters"},{"issue":"No.3","key":"6_CR8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/1270.318576","volume":"9","author":"U. Manber","year":"1984","unstructured":"U. Manber and R. Ladner, Concurrency control in a dynamic search structure, ACM Trans. on Database Sys., Vol. 9, No.3 (1984) pp. 439\u2013455.","journal-title":"ACM Trans. on Database Sys."},{"key":"6_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, 1984."},{"issue":"No.12","key":"6_CR10","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/12.9744","volume":"37","author":"V. Rao","year":"1988","unstructured":"V. Rao and V. Kumar, Concurrent access of priority queues, IEEE Trans. on Computers, Vol. 37, No. 12, Nov. 1988, pp. 1657\u20131665.","journal-title":"IEEE Trans. on Computers"},{"key":"6_CR11","unstructured":"R. Sedgewick, Algorithms, Addison-Wesley, 1988."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:10:47Z","timestamp":1619572247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}