{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:38Z","timestamp":1725663578625},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558088"},{"type":"electronic","value":"9783540472919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55808-x_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:44:55Z","timestamp":1330231495000},"page":"133-141","source":"Crossref","is-referenced-by-count":4,"title":["A perfect parallel dictionary"],"prefix":"10.1007","author":[{"given":"Holger","family":"Bast","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Dietzfelbinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"11_CR1","unstructured":"H. Bast and T. Hagerup, Fast and Reliable Parallel Hashing, manuscript. A preliminary version appeared in Proc. 3rd SPAA (1991), pp. 50\u201361."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"O. Berkman and U. Vishkin, Recursive *-Tree Parallel Data-Structure, in Proc. 30th FOCS (1989), pp. 196\u2013202.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, in Proc. 18th STOC (1986), pp. 206\u2013219.","DOI":"10.1145\/12130.12151"},{"key":"11_CR4","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide, Dynamic Hashing in Real Time, in Informatik: Festschrift zum 60. Geburtstag von G\u00fcnter Hotz (1992), Teubner-Texte zur Informatik, Band 1, Teubner, Stuttgart (a preliminary version appeared in Proc. 17th ICALP (1990), Springer LNCS, Vol. 443, pp. 6\u201319)."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s, and E. Szemer\u00e9di, Storing a Sparse Table with O(1) Worst Case Access Time, J. ACM\n                31 (1984), pp. 538\u2013544.","journal-title":"J. ACM"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"J. Gil, Y. Matias, and U. Vishkin, Towards a Theory of Nearly Constant Time Parallel Algorithms, in Proc. 32nd FOCS (1991), pp. 698\u2013710.","DOI":"10.1109\/SFCS.1991.185438"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich, Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation, in Proc. 32nd FOCS (1991), pp. 711\u2013722.","DOI":"10.1109\/SFCS.1991.185439"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"V. Grolmusz and P. Ragde, Incomparability in Parallel Computation, in Proc. 28th FOCS (1987), pp. 89\u201398.","DOI":"10.1109\/SFCS.1987.34"},{"key":"11_CR9","volume-title":"Tech. Rep. No. MPI-I-91-106","author":"T. Hagerup","year":"1991","unstructured":"T. Hagerup, Fast Parallel Space Allocation, Estimation and Integer Sorting, Tech. Rep. No. MPI-I-91-106 (1991), Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken."},{"key":"11_CR10","first-page":"259","volume":"577","author":"T. Hagerup","year":"1992","unstructured":"T. Hagerup, The Log-Star Revolution, in Proc. 9th STACS (1992), Springer LNCS, Vol. 577, pp. 259\u2013278.","journal-title":"Springer LNCS"},{"key":"11_CR11","unstructured":"P. D. MacKenzie, Load Balancing Requires \u03a9(log*\n                n) Expected Time, in Proc. 3rd SODA (1992), pp. 94\u201399."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0196-6774(91)90034-V","volume":"12","author":"Y. Matias","year":"1991","unstructured":"Y. Matias and U. Vishkin, On Parallel Hashing and Integer Sorting, J. Alg.\n                12 (1991), pp. 573\u2013606.","journal-title":"J. Alg."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin, An O(log n) Parallel Connectivity Algorithm, J. Alg.\n                3 (1982), pp. 57\u201367.","journal-title":"J. Alg."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1992"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55808-X_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:35:59Z","timestamp":1619559359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55808-X_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558088","9783540472919"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-55808-x_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}