Hardness of peeling with stashes

DOI10.1016/j.ipl.2016.05.006zbMath1362.68233arXiv1410.5169OpenAlexW1877467357MaRDI QIDQ2630336

Vikram Nathan, Michael Mitzenmacher

Publication date: 27 July 2016

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenessgraph algorithmshashingpeeling processstash

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preventing Unraveling in Social Networks: The Anchored k-Core Problem
• Tight Thresholds for Cuckoo Hashing via XORSAT
• Efficient erasure correcting codes
• Cuckoo hashing

This page was built for publication: Hardness of peeling with stashes