Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Quicksort, largest bucket, and min-wise hashing with limited independence
Mathias Bæk Tejs Knudsen, Morten Stöckel
Department of Computer Science
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Quicksort, largest bucket, and min-wise hashing with limited independence'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Quicksort
100%
Hashing
86%
Independence
59%
Hash Function
51%
Imply
15%
Algorithms and Data Structures
12%
Random number Generator
11%
Random Measure
10%
Pivot
10%
Randomized Algorithms
9%
Randomness
8%
Ball
6%
Random variable
5%
Metric
5%
Lower bound
5%
Subset
4%
Generalise
4%
Family
3%