LEHMANN, Hans-Peter, SANDERS, Peter und WALZER, Stefan, 2025. Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. Algorithmica. 1 November 2025. Vol. 87, no. 11, p. 1620-1668. DOI 10.1007/s00453-025-01321-z.
Elsevier - Harvard (with titles)Lehmann, H.-P., Sanders, P., Walzer, S., 2025. Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. Algorithmica 87, 1620-1668. https://doi.org/10.1007/s00453-025-01321-z
American Psychological Association 7th editionLehmann, H.-P., Sanders, P., & Walzer, S. (2025). Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. Algorithmica, 87(11), 1620-1668. https://doi.org/10.1007/s00453-025-01321-z
Springer - Basic (author-date)Lehmann H-P, Sanders P, Walzer S (2025) Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.. Algorithmica 87:1620-1668. https://doi.org/10.1007/s00453-025-01321-z
Juristische Zitierweise (Stüber) (Deutsch)Lehmann, Hans-Peter/ Sanders, Peter/ Walzer, Stefan, Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force., Algorithmica 2025, 1620-1668.