Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

DOI10.1007/978-3-319-07959-2_14zbMath1316.94069arXiv1404.0286OpenAlexW1582154559MaRDI QIDQ3191209

Paweł Pszona, David Eppstein, Michael Mitzenmacher, Michael T. Goodrich

Publication date: 30 September 2014

Published in: Experimental Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

A competitive analysis for the start-gap algorithm for online memory wear leveling ⋮ Algorithmic Building Blocks for Asymmetric Memories ⋮ Wear Leveling Revisited ⋮ The Online House Numbering Problem: Min-Max Online List Labeling

This page was built for publication: Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket