{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:52Z","timestamp":1725495112002},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_51","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T16:12:14Z","timestamp":1195143134000},"page":"599-609","source":"Crossref","is-referenced-by-count":0,"title":["Multiprocess Time Queue"],"prefix":"10.1007","author":[{"given":"Andrej","family":"Brodnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Karlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Arne Andersson and Mikkel Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 335\u2013342, Portland, Oregon, US, May 21\u201323 2000. ACM Press.","DOI":"10.1145\/335305.335344"},{"key":"51_CR2","unstructured":"Andrej Brodnik, Svante Carlsson, Johan Karlsson, and J. Ian Munro. Worst case constant time priority queue. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 523\u2013528, Washington, DC, US, 7\u20139 January 2001."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Randy Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM, 31(10):1220\u20131227, October 1988.","DOI":"10.1145\/63039.63045"},{"key":"51_CR4","unstructured":"Boris V. Cherkassky, Andrew V. Goldberg, and Craig Silverstein. Buckets, heaps, lists, and monotone priority queues. In Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, pages 83\u201392, New Orleans, Louisiana, US, 5\u20137 January 1997."},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"E. G. Coman, Jr., M. J. Elphick, and A. Shoshani. System deadlocks. ACM Computing Surveys, 3(2):67\u201378, June 1971.","DOI":"10.1145\/356586.356588"},{"issue":"4","key":"51_CR6","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23(4):738\u2013791, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"51_CR7","unstructured":"K. Bruce Erickson, Richard E. Ladner, and Anthony LaMarca. Optimizing static calendar queues. In 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 732\u2013742. IEEE, 20\u201322 November 1994. Also published as tech. report TR-94-09-02 ftp:\/\/ftp.cs.washington.edu\/tr\/1994\/09\/UW-CSE-94-09-02.PS.Z ."},{"issue":"3","key":"51_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"Michael L. Fredman, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538\u2013544, July 1984.","journal-title":"Journal of the ACM"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 345\u2013354, Seattle, Washington, US, May14\u201317 1989. ACM Press.","DOI":"10.1145\/73007.73040"},{"issue":"4","key":"51_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/5684.5686","volume":"29","author":"D. W. Jones","year":"1986","unstructured":"Douglas W. Jones. An empirical comparison of priority-queue and event-set implementations. Communications of the ACM, 29(4):300\u2013311, April 1986.","journal-title":"Communications of the ACM"},{"issue":"3","key":"51_CR11","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nhage","year":"1980","unstructured":"Arnold Sch\u00f6nhage. Storage modications machines. SIAM Journal on Computing, 9(3):490\u2013508, August 1980.","journal-title":"SIAM Journal on Computing"},{"key":"51_CR12","unstructured":"Mikkel Thorup. On RAM priority queues. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 59\u201367, Atlanta, Georgia, US, 28\u201330 January 1996."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In 16th Symposium on Foundations of Computer Science, pages 75\u201384, 1975.","DOI":"10.1109\/SFCS.1975.26"},{"key":"51_CR14","first-page":"3","volume-title":"Handbook of Theoretical Computer Science","author":"P. Emde Boas van","year":"1990","unstructured":"P. van Emde Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, pages 3\u201366. Elsevier\/MIT Press, Amsterdam, 1990."},{"key":"51_CR15","doi-asserted-by":"publisher","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 ecient priority queue. Mathematical Systems Theory, 10:99\u2013127, 1977. 601","journal-title":"Mathematical Systems Theory"},{"issue":"6","key":"51_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/90.650142","volume":"5","author":"G. Varghese","year":"1997","unstructured":"George Varghese and Anthony Lauck. Hashed and hierarchical timing wheels: Ecient data structure for implementing a timer facility. IEEE\/ACM Transaction on Networking, 5(6):824\u2013834, December 1997.","journal-title":"IEEE\/ACM Transaction on Networking"},{"issue":"2","key":"51_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D. E. Willard","year":"1983","unstructured":"Dan E. Willard. Log-logarithmic worst-case range queries are possible in space \u03b8(N). Information Processing Letters, 17(2):81\u201384, 24 August 1983.","journal-title":"Information Processing Letters"},{"key":"51_CR18","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. Williams","year":"1964","unstructured":"J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347\u2013348, 1964.","journal-title":"Communications of the ACM"},{"issue":"3","key":"51_CR19","first-page":"614","volume":"28","author":"A. Chi-Chih Yao","year":"1981","unstructured":"Andrew Chi-Chih Yao. Should tables be sorted? Journal of the ACM, 28(3):614\u2013628, July 1981.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T21:01:56Z","timestamp":1630098116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}