Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence

DOI10.1007/978-3-662-48350-3_69zbMath1467.68213arXiv1502.05729OpenAlexW1802575925MaRDI QIDQ3452844

Morten Stöckel, Mathias Bæk Tejs Knudsen

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.05729

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Min-wise independent permutations
• From Independence to Expansion and Back Again
• Randomized algorithms and pseudorandom numbers
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• On Universal Classes of Extremely Random Constant-Time Hash Functions
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• The Power of Simple Tabulation Hashing

This page was built for publication: Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence