Searching for "Deterministic Dictionaries." – sorted by Relevance.
-
Deterministic Dictionaries
- Deterministic Dictionaries * Torben Hagerup Fachbereich Informatik, Johann Wolfgang Goethe
- Cited by 24 (2 self) – Add To MetaCart
-
Faster Deterministic Dictionaries
- BRICS RS-99-48 R. Pagh: Faster Deterministic Dictionaries BRICS Basic Research in Computer Science
- Cited by 9 (5 self) – Add To MetaCart
-
A Trade-Off For Worst-Case Efficient Dictionaries
- size w and a standard instruction set, and present a linear space deterministic dictionary
- Cited by 5 (2 self) – Add To MetaCart
-
Optimal resilient dynamic dictionaries
- Static Dictionary In this section we close the gap between lower and upper bounds for deterministic
- Cited by 1 (0 self) – Add To MetaCart
-
March 1999. 21 pp. Appears in Mendelzon, editor,
- -48] Abstract, PostScript, PDF. Rasmus Pagh. Faster Deterministic Dictionaries. December 1999. 14 pp. Appears
- Add To MetaCart
-
Compact Name-Independent Routing with Minimum Stretch
- ingredients as are used for the deterministic dictionaries of Hagerup et al. [12]. Using the techniques from
- Cited by 30 (9 self) – Add To MetaCart
-
Expander based dictionary data structures
- structures exist for supporting dictionary queries. For dynamic deterministic dictionaries for n keys
- Cited by 1 (1 self) – Add To MetaCart
-
Pattern Matching in Trees and Strings
- ”. For several of our results, we use a deterministic dictionary data structure of Hagerup et al. [HMP01
- Cited by 1 (0 self) – Add To MetaCart
-
Dispersing Hash Functions
- ⏐ � � −−−→ . . . n � split −−−→ � 2 logɛ n · Figure 1: Overview of subproblems for the deterministic dictionary
- Cited by 1 (1 self) – Add To MetaCart
-
Fast and compact regular expression matching
- . The preprocessing time is O(m) w.h.p.. To get a worst-case preprocessing bound we use the deterministic dictionary
- Cited by 4 (3 self) – Add To MetaCart

