scientific article; zbMATH DE number 7375932

DOI10.4230/LIPIcs.ICALP.2018.5zbMath1499.68038arXiv1804.09684MaRDI QIDQ5002669

Anders Aamand, Mikkel Thorup, Mathias Bæk Tejs Knudsen

Publication date: 28 July 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

load balancinghashingballs and binssimple tabulation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Balanced allocation on hypergraphs ⋮ Balanced allocation on dynamic hypergraphs

Cites Work

• Unnamed Item
• Universal classes of hash functions
• Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
• How asymmetry helps load balancing
• Almost random graphs with simple hash functions
• Asymmetric balanced allocation with simple hash functions
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Balanced Allocations
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• The Power of Two Choices with Simple Tabulation
• On Universal Classes of Extremely Random Constant-Time Hash Functions
• Cuckoo hashing
• Pseudorandom Graphs in Data Structures
• Hashing, Load Balancing and Multiple Choice
• The Power of Simple Tabulation Hashing
• Probability and Computing
• Balls and Bins: Smaller Hash Families and Faster Evaluation

This page was built for publication: