Construct a perfect word hash function in time independent of the size of integers

DOI10.1016/j.ipl.2017.07.004zbMath1420.68249OpenAlexW2735188071MaRDI QIDQ2404612

Yijie Han

Publication date: 19 September 2017

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.07.004

zbMATH Keywords

analysis of algorithmsdesign of algorithmshashingintegersperfect word hash functions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in linear time?
• Surpassing the information theoretic bound with fusion trees
• Improved fast integer sorting in linear space
• Deterministic Dictionaries
• Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
• A Linear Time Algorithm for Ordered Partition
• Constructing Efficient Dictionaries in Close to Sorting Time
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Priority queues: Small, monotone and trans-dichotomous
• Deterministic sorting in O(nloglogn) time and linear space
• Uniform deterministic dictionaries

This page was built for publication: Construct a perfect word hash function in time independent of the size of integers