Two-Way Chaining with Reassignment

DOI10.1137/S0097539704443240zbMath1092.68046OpenAlexW2065469524MaRDI QIDQ5470693

Erin McLeish, Ebrahim Malalla, Ketan Dalal, Luc P. Devroye

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539704443240

zbMATH Keywords

random graphsprobabilistic analysis of algorithmshashingworst-case search timetwo-way chaining

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ On the \(k\)-orientability of random graphs ⋮ Two-way chaining for non-uniform distributions

This page was built for publication: Two-Way Chaining with Reassignment