|
3
|
Simple Fast Parallel Hashing by Oblivious Execution
– Joseph Gil, Yossi Matias
- 1994
|
|
1
|
Incremental hashing in state space search
– Stefan Edelkamp, Tilman Mehler, Baroper Str
- 2004
|
|
6
|
Efficient Submatch Addressing for Regular Expressions
– Ville Laurikari
- 2001
|
|
9
|
Faster Suffix Tree Construction with Missing Suffix Links
– Richard Cole, Ramesh Hariharan
- 2000
|
|
8
|
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
– Peter Bro Miltersen
- 1996
|
|
|
A Construction Method for Optimally Universal Hash Families and its Consequences for the Existence of RBIBDs (Extended Abstract)
– Philipp Woelfel
|
|
12
|
Rigorous Time/Space Tradeoffs for Inverting Functions
– Amos Fiat, Moni Naor
- 2000
|
|
|
DynamicExternalHashing:TheLimitofBuffering ∗
– Zheweiwei Keyi Qinzhang
|
|
6
|
A Trade-Off For Worst-Case Efficient Dictionaries
– Rasmus Pagh
|
|
3
|
TWO-WAY CHAINING WITH REASSIGNMENT
– Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
|
|
17
|
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
– Peter Bro Miltersen
- 1997
|
|
17
|
Membership in Constant Time and Minimum Space
– Andrej Brodnik, J. Ian Munro
- 1994
|
|
10
|
Randomized Data Structures for the Dynamic Closest-Pair Problem
– Mordecai Golin, Rajeev Raman, Christian Schwarz, Michiel Smid
- 1993
|
|
7
|
Strongly history-independent hashing with applications
– Guy E. Blelloch
- 2007
|
|
2
|
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
– Yuriy Arbitman, Moni Naor, Gil Segev
- 2010
|
|
13
|
Cuckoo hashing: Further analysis
– Luc Devroye, Pat Morin, Communicated F. Dehne
- 2003
|
|
60
|
Closest-Point Problems in Computational Geometry
– Michiel Smid
- 1997
|
|
5
|
Dynamic Point Location in Fat Hyperrectangles With Integer Coordinates
– John Iacono Iacono, Stefan Langerman
|
|
34
|
Space Efficient Hash Tables With Worst Case Constant Access Time
– Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
- 2003
|
