{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:43Z","timestamp":1725456763109},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029597","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"76-87","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic hashing strategies"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data structures and algorithms, Vol. 1, Springer Verlag, 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s, E. Szemer\u00e9di, Storing a sparse table with O(1) worst case access time, J. ACM 31(3), pp. 538\u2013544, 1984.","journal-title":"J. ACM"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan, Dynamic perfect hashing: upper and lower bounds, Proc. of 29th IEEE FOCS, pp. 524\u2013531, 1988.","DOI":"10.1109\/SFCS.1988.21968"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide: A new universal class of hash functions, and dynamic hashing in real time, Proc. of 17th ICALP, 1990.","DOI":"10.1007\/BFb0032018"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide: How to distribute a dictionary in a complete network, Proc. of 22nd ACM STOC, 1990.","DOI":"10.1145\/100216.100229"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide: An optimal parallel dictionary, Proc. of ACM SPAA, pp. 360\u2013368, 1989.","DOI":"10.1145\/72935.72974"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"J. L. Carter, M. N. Wegman, Universal classes of hash functions, Proc. of 9th ACM STOC, pp. 106\u2013112, 1977.","DOI":"10.1145\/800105.803400"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"M. N. Wegman, J. L. Carter, New classes and applications of hash functions, 20th IEEE FOCS, pp. 175\u2013182, 1979.","DOI":"10.1109\/SFCS.1979.26"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"A. Siegel, On universal classes of fast high performance hash functions, their time-space trade-off, and their applications, Proc. of 30th IEEE FOCS, pp. 20\u201325, 1989.","DOI":"10.1109\/SFCS.1989.63450"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"C. P. Kruskal, M. Snir, L. Rudolph, A complexity theory of efficient parallel algorithms, Proc. of 15th ICALP pp. 333\u2013346, 1988; also: revised preprint.","DOI":"10.1007\/3-540-19488-6_126"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn, U. Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memory, Acta Informatica 21, pp. 339\u2013374, 1984.","journal-title":"Acta Informatica"},{"issue":"3","key":"6_CR12","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"E. Upfal, Efficient schemes for parallel communication, J. ACM 31(3), pp. 507\u2013517, 1984.","journal-title":"J. ACM"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"A. G. Ranade, How to emulate shared memory, Proc. of 28 IEEE FOCS, pp. 185\u2013194, 1987.","DOI":"10.1109\/SFCS.1987.32"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"A. Karlin, E. Upfal, Parallel hashing, an efficient implementation of shared memory, Proc. of 18th ACM STOC, pp. 160\u2013168, 1986.","DOI":"10.1145\/12130.12146"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"W. Paul, U. Vishkin, H. Wagener, Parallel dictionaries on 2\u20133 trees, Proc. of 10th ICALP, pp. 597\u2013609, 1983.","DOI":"10.1007\/BFb0036940"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:35Z","timestamp":1586592935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0029597","relation":{},"subject":[]}}