Two-way chaining for non-uniform distributions

DOI10.1080/00207160802132871zbMath1185.68365OpenAlexW2016356949MaRDI QIDQ5852152

Ebrahim Malalla

Publication date: 26 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802132871

zbMATH Keywords

non-uniform distributionsworst-case search timetwo-way chainingmultiple choice allocation processwitness tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• An algorithmic and complexity analysis of interpolation search
• Efficient PRAM simulation on a distributed memory machine
• Balanced allocation and dictionaries with tightly packed constant size bins
• Randomized allocation processes
• Neighborhood Preserving Hashing and Approximate Queries
• How asymmetry helps load balancing
• Using the Power of Two Choices to Improve Bloom Filters
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Balanced Allocations
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Studying Balanced Allocations with Differential Equations
• Two-Way Chaining with Reassignment
• Balanced Allocations: The Heavily Loaded Case

This page was built for publication: Two-way chaining for non-uniform distributions