Rasmus Pagh  Home/Search
Context
Related
| brics.dk/DS/Ref/BR...RICSDS025.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/DS/Ref/BR...BRICSDSRef (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis is centered around one of the most basic information retrieval problems, namely that of storing and accessing the elements of a set. Each element in the set has some associated information that is returned along with it. The problem is referred to as the dictionary problem, due to the similarity to a bookshelf dictionary, which contains a set of words and has an explanation associated with each word. In the static version of the problem the set is fixed, whereas in the dynamic... (Update)
Similar documents (at the sentence level):
9.9%: Cuckoo Hashing - Pagh, Rodler (2001) (Correct)
6.7%: Compression with Fast Random Access - Rodler (Correct)
Active bibliography (related documents): More All
1.8: Hashing, Randomness and Dictionaries - Pagh (1999) (Correct)
0.9: Integer Sorting in O(n √(log log n)) Expected Time and.. - Han, Thorup (2005) (Correct)
0.6: Optimal Space-Time Dictionaries over an Unbounded Universe .. - Franceschini, Grossi (2003) (Correct)
Similar documents based on text: More All
0.5: Faster Deterministic Dictionaries - Pagh (1999) (Correct)
0.4: A Trade-Off For Worst-Case Efficient Dictionaries - Pagh (Correct)
0.3: A New Trade-off for Deterministic Dictionaries - Pagh (2000) (Correct)
BibTeX entry: (Update)
@misc{ pagh-hashing,
author = "Rasmus Pagh",
title = "Hashing, Randomness and Dictionaries",
url = "citeseer.ist.psu.edu/pagh02hashing.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1975
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
198 Organization and maintenance of large ordered indices (context) - Bayer, McCreight - 1972
148 Storing a sparse table with O (context) - Fredman, Komlos et al. - 1984
143 the complexity of timetable and multicommodity flow problems (context) - Even, Itai et al. - 1976
128 Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1992
126 Eigenvalues and expanders (context) - Alon - 1986
109 InputOutput Complexity Sorting and Related Problem (context) - Aggarwal, Vitter et al. - 1988
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
97 Trans-dichotomous algorithms for minimum spanning trees and .. (context) - Fredman, Willard - 1994
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984
91 Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986
74 The cell probe complexity of dynamic data structures (context) - Fredman, Saks - 1989
71 Explicit constructions of linearsized superconcentrators (context) - Gabber, Galil - 1981
69 Surpassing the information theoretic bound with fusion trees (context) - Fredman, Willard - 1993
68 Min-wise independent permutations - Broder, Charikar et al. - 2000
64 Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
56 Sorting in linear time - Andersson, Hagerup et al. - 1998
36 Recognizing primes in random polynomial time (context) - Adleman, Huang - 1987
35 Membership in constant time and almost-minimum space (context) - Brodnik, Munro - 1999
35 Optimal bounds for the predecessor problem - Beame, Fich - 1999
31 Trie memory (context) - Fredkin - 1960
30 the size of separating systems and families of perfect hash .. (context) - Fredman, Komlos - 1984
27 Randomized allocation processes (context) - Czumaj, Stemann - 1997
26 witnesses for Boolean matrix multiplication and construction.. (context) - Alon, Naor - 1996
25 Faster deterministic sorting and searching in linear space - Andersson - 1996
24 Multilevel adaptive hashing (context) - Broder, Karlin - 2000
23 Theoretical Computer Science (context) - Czech, Havas et al. - 1997
21 worst-case bounds on dynamic searching and priority queues (context) - Andersson, Thorup et al. - 2000
21 Balanced allocations: the heavily loaded case - Berenbrink, Czumaj et al. - 2000
19 Friedhelm Meyer auf der Heide (context) - Dietzfelbinger, Karlin et al. - 1994
19 Are bitvectors optimal - Buhrman, Miltersen et al. - 2000
18 and Eli Upfal (context) - Azar, Broder et al. - 1999
17 An optimal algorithm for generating minimal perfect hash fun.. - Czech, Havas et al. - 1992
15 Using multiple hash functions to improve IP lookups - Broder, Mitzenmacher - 2001
15 Fast and reliable parallel hashing (context) - Bast, Hagerup - 1991
15 Membership in constant time and minimum space - Brodnik, Munro - 1994
14 Marked ancestor problems - Alstrup, Husfeldt et al. - 1998
14 Practical minimal perfect hash functions for large databases (context) - Fox, Heath et al. - 1992
13 Tables should be sorted (context) - Fich, Miltersen - 1995
10 A new universal class of hash functions and dynamic hashing .. (context) - Dietzfelbinger, auf - 1990
10 A faster algorithm for constructing minimal perfect hash fun.. (context) - Fox, Chen et al. - 1992
9 Reducing the retrieval time of scatter storage techniques (context) - Brent - 1973
8 Polynomial hash functions are reliable (context) - Dietzfelbinger, Gil et al. - 1992
8 Exact and approximate membership testers (context) - Carter, Floyd et al. - 1978
8 Universal hashing and k-wise independent random variables vi.. (context) - Dietzfelbinger - 1996
8 Storing a dynamic sparse table (context) - Aho, Lee - 1986
7 Fusion trees can be implemented with AC instructions only - Andersson, Miltersen et al. - 1999
6 probe search (context) - Fiat, Naor - 1993
6 A reliable randomized algorithm for the closest-pair problem (context) - Dietzfelbinger, Hagerup et al. - 1997
5 Indexing for rapid random access memory systems (context) - Dumey - 1956
5 The bit extraction problem of t-resilient functions (context) - Chor, Goldreich et al. - 1985
4 Is linear hashing good (context) - Alon, Dietzfelbinger et al. - 1997
3 Optimal static range reporting in one dimension - Alstrup, Brodal et al. - 2001
3 Dynamic representations of sparse graphs - Brodal, Fagerberg - 1999
2 and Alan Siegel (context) - Fiat, Naor et al. - 1992
2 Transdichotomous algorithms without multiplication --- some .. (context) - Brodnik, Miltersen et al. - 1997
2 An algorithm for organization of information (context) - Adel'son-Vel'skii, Landis - 1962
1 with applications to shared memory simulations (context) - Dietzfelbinger, auf et al. - 1992
1 cient ordering of hash (context) - Gonnet, Munro
1 Simple minimal perfect hashing in less space (context) - Dietzfelbinger, Hagerup - 2001
1 Locality-preserving hash functions for general purpose paral.. (context) - Chin - 1994
1 Static dictionaries on AC RAMs: Query time log n/ log log n).. (context) - Andersson, Miltersen et al. - 1996
1 When can we sort in o (context) - Ben-Amram, Galil - 1997
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000) (Correct)
Dynamic Computation - Husfeldt (1997) (Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC