On perfect hashing of numbers with sparse digit representation via multiplication by a constant

DOI10.1016/j.dam.2011.03.007zbMath1222.68080arXiv1003.3196OpenAlexW2026652069MaRDI QIDQ2275918

Maurizio Monge

Publication date: 10 August 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Schur functionhash functionbitboardmagic multiplier

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of multiplication with vectors for structured matrices
• Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
• Priority queues: Small, monotone and trans-dichotomous

This page was built for publication: On perfect hashing of numbers with sparse digit representation via multiplication by a constant