Hashing, Load Balancing and Multiple Choice
From MaRDI portal
Publication:5354405
DOI10.1561/0400000070zbMath1454.68005OpenAlexW4295837408MaRDI QIDQ5354405
Publication date: 4 September 2017
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000070
Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (7)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Improved private set intersection for sets with small entries ⋮ Balanced allocation on hypergraphs ⋮ Unnamed Item ⋮ The Power of Filling in Balanced Allocations ⋮ Balanced allocation on dynamic hypergraphs
This page was built for publication: Hashing, Load Balancing and Multiple Choice
