American Psychological Association 6th edition

Lehmann, 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

ISO-690 (author-date, English)

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.

Modern Language Association 9th edition

Lehmann, H.-P., P. Sanders, und S. Walzer. „Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force“. Algorithmica, Bd. 87, Nr. 11, November 2025, S. 1620-68, https://doi.org/10.1007/s00453-025-01321-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Lehmann, Hans-Peter/Sanders, Peter/Walzer, Stefan: Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force, Algorithmica 2025, 1620-1668.

Emerald - Harvard

Lehmann, H.-P., Sanders, P. und Walzer, S. (2025), „Shock Hash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force“, Algorithmica, Vol. 87 No. 11, S. 1620-1668.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.