|
40
|
LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME
– Rasmus Pagh
- 2001
|
|
27
|
Cell Probe Complexity - a Survey
– Peter Bro Miltersen
- 1999
|
|
4
|
Lossy Dictionaries
– Rasmus Pagh, Flemming Friche Rodler
- 2001
|
|
27
|
The Cell Probe Complexity of Succinct Data Structures
– Anna Gal, Anna Gál, Peter Bro Miltersen
- 2003
|
|
|
Information Processing Letters 83 (2002) 267--274
– Www Elsevier Com, Amnon Ta-shma
|
|
21
|
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
– Rasmus Pagh
- 1999
|
|
149
|
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
– Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
|
|
18
|
Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
– Rasmus Pagh
- 1998
|
|
2
|
Dispersing Hash Functions
– Rasmus Pagh
- 2000
|
|
3
|
Dynamic rank/select dictionaries with applications to XML indexing
– Jeffrey S. Vitter, Ankur Gupta, Ankur Gupta, Wing-kai Hon, Wing-kai Hon, Rahul Shah, Rahul Shah, Jeffrey Scott Vitter
- 2006
|
|
19
|
Compressed data structures: dictionaries and data-aware measures
– Ankur Gupta, Wing-kai Hon, Rahul Shah, Jeffrey Scott Vitter
- 2006
|
|
49
|
Are bitvectors optimal?
– H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh
|
|
1
|
MORE HASTE, LESS WASTE: LOWERING THE REDUNDANCY IN FULLY INDEXABLE DICTIONARIES
– Roberto Grossi, et al.
- 2009
|
|
1
|
Explicit Deterministic Constructions for Membership in the Bitprobe Model
– Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
|
|
47
|
The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
– Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal, Oh Boy
- 2004
|
|
76
|
Loss-less condensers, unbalanced expanders, and extractors
– Amnon Ta-shma, Christopher Umans, David Zuckerman
- 2001
|
|
6
|
Improved Bounds for Dictionary Look-up with One Error
– Gerth Stølting Brodal, S. Venkatesh
- 2000
|
|
3
|
Hashing, Randomness and Dictionaries
– Rasmus Pagh
- 2002
|
|
11
|
Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses
– Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
|
