Searching for authors named "Rasmus Pagh" – sorted by Relevance.
-
Faster Deterministic Dictionaries
- Faster Deterministic Dictionaries Rasmus Pagh BRICS Report Series RS-99-48 ISSN 0909-0878 December 1999
- Cited by 9 (5 self) – Add To MetaCart
-
On the Probe Complexities of Membership and Perfect Hashing
- On the probe complexities of membership and perfect hashing Rasmus Pagh 1 September 9, 2000 1
- Cited by 8 (5 self) – Add To MetaCart
-
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
- / Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time Rasmus Pagh ? BRICS
- Cited by 19 (5 self) – Add To MetaCart
-
Dispersing Hash Functions
- changed. Available on-line at http://www.brics.dk/~pagh/papers/ Dispersing Hash Functions Rasmus Pagh
- Cited by 1 (1 self) – Add To MetaCart
-
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
- Functions Rasmus Pagh BRICS Report Series RS-99-13 ISSN 0909-0878 May 1999 Copyright c 1999, Rasmus Pagh
- Cited by 3 (1 self) – Add To MetaCart
-
A Trade-Off For Worst-Case Efficient Dictionaries
- Nordic Journal of Computing A TRADE-OFF FOR WORST-CASE EFFICIENT DICTIONARIES RASMUS PAGH BRICS
- Cited by 5 (2 self) – Add To MetaCart
-
Low Redundancy In Static Dictionaries With Constant Query Time
- WITH CONSTANT QUERY TIME Rasmus Pagh 1 Abstract. A static dictionary is a data structure storing subsets of a
- Cited by 32 (5 self) – Add To MetaCart
-
Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
- Lookup Time Rasmus Pagh BRICS Report Series RS-98-28 ISSN 0909-0878 November 1998 Copyright c 1998
- Cited by 17 (0 self) – Add To MetaCart
-
Linear probing with constant independence
- ABSTRACT Linear Probing with Constant Independence Anna Pagh ∗ Rasmus Pagh ∗ Milan Ru
- Cited by 3 (0 self) – Add To MetaCart
-
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time Rasmus Pagh ? BRICS
- Add To MetaCart

