Searching for "Dynamic Perfect Hashing Upper and Lower Bounds" – sorted by Relevance.
-
Dynamic Perfect Hashing: Upper and Lower Bounds
- Dynamic Perfect Hashing: Upper and Lower Bounds Martin Dietzfelbinger Universitat
- Cited by 113 (13 self) – Add To MetaCart
-
Cuckoo hashing
- perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J
- Cited by 34 (1 self) – Add To MetaCart
-
Image Databases and Near-perfect hash table
- . Rohnert, and R. E. Tar- jan. Dynamic perfect hashing: Upper and lower bounds. SIAM doural o Computig, 23
- Cited by 3 (1 self) – Add To MetaCart
-
[XOK90] T. Hagerup and C. Rub. Optimal Merging and Sorting on the EREW PRAM. Technical Report, Universit/it des Saarlandes, 1989.
- . Ronnert and R.E. Tarjan. Dynamic perfect hashing: upper and lower bounds. In Prac. 29th IEEE Syrup
- Add To MetaCart
-
Applications of Universal Hashing
- .E. Tarjan. Dynamic Perfect Hashing: Upper and Lower Bounds. 29th FOCS, pages 524--531, 1988. [6] M
- Add To MetaCart

