Making deterministic signatures quickly

DOI10.1145/1541885.1541887zbMath1298.68117OpenAlexW2149213038MaRDI QIDQ2930248

Milan Ruzic, Milan Ružić

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1541885.1541887

zbMATH Keywords

deterministic algorithmsperfect hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (2)

Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets

This page was built for publication: Making deterministic signatures quickly