Linear hashing in the Boolean cube with clusters of limited size
Discrete Mathematics and Applications · 28.07.2026 · 36 (1) · 21-26
DOI: 10.1515/dma-2026-0002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics and Applications, online erschienen am 24.07.2026. Verfasst von Aleksandr V. Chashkin. Die Arbeit nennt 1 Literaturangaben.
Abstract (Originalsprache)
It is shown that for an arbitrary M -element subset of the Boolean n -cube there exists a linear hash function with clusters consisting of at most a elements and with rank not higher than 2 log 2 M − 2 log 2 a + 𝒪(1).
Zitieren
APA
Chashkin, A. V. (2026). Linear hashing in the Boolean cube with clusters of limited size. Discrete Mathematics and Applications, 36(1), 21-26. https://doi.org/10.1515/dma-2026-0002
Vancouver
Chashkin AV. Linear hashing in the Boolean cube with clusters of limited size. Discrete Mathematics and Applications. 2026;36(1):21-26. doi:10.1515/dma-2026-0002
BibTeX
@article{Chashkin2026,
author = {Chashkin, Aleksandr V.},
title = {Linear hashing in the Boolean cube with clusters of limited size},
journal = {Discrete Mathematics and Applications},
year = {2026},
volume = {36},
number = {1},
pages = {21--26},
doi = {10.1515/dma-2026-0002}
}
EUVIMED