{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:53:25Z","timestamp":1742990005481,"version":"3.40.3"},"publisher-location":"Wiesbaden","reference-count":20,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_7","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:17:04Z","timestamp":1366175824000},"page":"95-119","source":"Crossref","is-referenced-by-count":13,"title":["Dynamic Hashing in Real Time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Storing a dynamic sparse table","author":"HV Aho","year":"1986","unstructured":"H. V. Aho and D. Lee. Storing a dynamic sparse table. In Proc. of the 27th IEEE Ann. Symp. on Foundations of Computer Science, pages 55\u201360. IEEE, 1986."},{"key":"7_CR2","first-page":"50","volume-title":"Fast and reliable parallel hashing","author":"H Bast","year":"1991","unstructured":"H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 50\u201361, 1991."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(88)90210-4","volume":"28","author":"G Brassard","year":"1988","unstructured":"G. Brassard and S. Kannan. The generation of random permutations on the fly. Inform. Proc. Letters, 28:207\u2013212, 1988.","journal-title":"Inform. Proc. Letters"},{"key":"7_CR4","first-page":"524","volume-title":"Upper and lower bounds. Technical Report 77, Universit\u00e4t-GH-Paderborn, Fachbereich Mathematik\/Informatik","author":"M Dietzfelbinger","year":"1988","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report 77, Universit\u00e4t-GH-Paderborn, Fachbereich Mathematik\/Informatik, Jan. 1991. Revised Version of the paper of the same title that appeared in Proc. of the 29th IEEE Ann. Symp. on Foundations of Computer Science, pages 524\u2013531, 1988."},{"key":"7_CR5","first-page":"360","volume-title":"An optimal parallel dictionary","author":"M Dietzfelbinger","year":"1989","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. An optimal parallel dictionary. In Proc. of the 1989 ACM Symp. on Parallel Algorithms and Architectures, pages 360\u2013368, 1989. (Revised version to appear in Information and Computation)."},{"key":"7_CR6","first-page":"117","volume-title":"How to distribute a dictionary in a complete network","author":"M Dietzfelbinger","year":"1990","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. How to distribute a dictionary in a complete network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 117\u2013127, 1990."},{"key":"7_CR7","volume-title":"A new universal class of hash functions and dynamic hashing in real time","author":"M Dietzfelbinger","year":"1990","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In M. S. Paterson, editor, Proceedings of 17th ICALP, pages 6\u201319. Springer, 1990. Lecture Notes in Computer Science 443."},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s, and E. Szemer\u00e9di. Storing a sparse table with 0(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538\u2013544, July 1984.","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR9","volume-title":"Towards a theory of nearly constant time parallel algorithms","author":"J Gil","year":"1991","unstructured":"J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd IEEE Ann. Symp. on Foundations of Computer Science, 1991."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"GH Gonnet","year":"1981","unstructured":"G. H. Gonnet. Expected length of the longest probe sequence in hash code searching. J. Assoc. Comput. Mach., 28(2):289\u2013304, Apr. 1981.","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T Hagerup","year":"1989","unstructured":"T. Hagerup and C. R\u00fcb. A guided tour of Chernoff bounds. Inform. Proc. Letters, 33:305\u2013308, 1989\/90.","journal-title":"Inform. Proc. Letters"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W HoefTding","year":"1963","unstructured":"W. HoefTding. Probability inequalites for sums of bounded random variables. J. Am. Stat. Ass., 58:13\u201330, 1963.","journal-title":"J. Am. Stat. Ass."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"CP Kruskal","year":"1990","unstructured":"C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci, 71:95\u2013132, 1990.","journal-title":"Theoret. Comput. Sci"},{"key":"7_CR14","volume-title":"Clocked adversaries for hashing","author":"RJ Lipton","year":"1989","unstructured":"R. J. Lipton and J. G. Naughton. Clocked adversaries for hashing. Technical Report CS-TR-203\u201389, Princeton, 1989."},{"key":"7_CR15","first-page":"307","volume-title":"Converting high probability into nearly-const ant time \u2014 with applications to parallel hashing","author":"Y Matias","year":"1991","unstructured":"Y. Matias and U. Vishkin. Converting high probability into nearly-const ant time \u2014 with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 307\u2013316, 1991."},{"key":"7_CR16","first-page":"148","volume-title":"Surveys in Combinatorics","author":"C McDiarmid","year":"1989","unstructured":"C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, 1989, pages 148\u2013188. Cambridge University Press, 1989. London Math. Soc. Lecture Note Series 141."},{"key":"7_CR17","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."},{"key":"7_CR18","first-page":"385","volume-title":"Random matroids","author":"JH Reif","year":"1980","unstructured":"J. H. Reif and P. G. Spirakis. Random matroids. In Proc. of the 12th Ann. ACM Symp. on Theory of Computing, pages 385\u2013397, 1980."},{"key":"7_CR19","first-page":"20","volume-title":"On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications","author":"A Siegel","year":"1989","unstructured":"A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pages 20\u201325, 1989. Revised Version."},{"key":"7_CR20","first-page":"943","volume-title":"Handbook of Theoretical Computer Science","author":"LG Valiant","year":"1990","unstructured":"L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, chapter 18, pages 943\u2013971. Elsevier, Amsterdam, 1990."}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"language":"de","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T15:08:22Z","timestamp":1675782502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_7","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}