✦ LIBER ✦

Uniform Hashing in Constant Time and Optimal Space

✍ Scribed by Pagh, Anna; Pagh, Rasmus

Book ID: 118180751
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 182 KB
Volume: 38
Category: Article
ISSN: 0097-5397
DOI: 10.1137/060658400

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space Efficient Hash Tables with Worst C

Space Efficient Hash Tables with Worst Case Constant Access Time

✍ Dimitris Fotakis; Rasmus Pagh; Peter Sanders; Paul Spirakis 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 254 KB

Space and time-efficient hashing of garb

Space and time-efficient hashing of garbage-collected objects

✍ Agesen, Ole 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

The hashCode() method found in the Java TM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for w

Space/time trade-offs in hash coding wit

Space/time trade-offs in hash coding with allowable errors

✍ Bloom, Burton H. 📂 Article 📅 1970 🏛 Association for Computing Machinery 🌐 English ⚖ 516 KB

Stable unmerging in linear time and cons

Stable unmerging in linear time and constant space

✍ Jeffrey S. Salowe; W.L. Steiger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Membership in Constant Time and Almost-M

Membership in Constant Time and Almost-Minimum Space

✍ Brodnik, Andrej; Munro, J. Ian 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 372 KB

Range majority in constant time and line

Range majority in constant time and linear space

✍ Stephane Durocher; Meng He; J. Ian Munro; Patrick K. Nicholson; Matthew Skala 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 253 KB