Hashing via finite field
From MaRDI portal
Publication:2509207
DOI10.1016/j.ins.2005.12.001zbMath1102.68456OpenAlexW2001455409MaRDI QIDQ2509207
Publication date: 19 October 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2005.12.001
Related Items
Cites Work
- The analysis of hashing with lazy deletions
- Abstract algebra and famous impossibilities
- The analysis of double hashing
- Uncertainty-based information. Elements of generalized information theory.
- More analysis of double hashing
- Uniform hashing is optimal
- Algorithmic aspects in speech recognition
- A Note on the Efficiency of Hashing Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item