Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Linear hash functions

From MaRDI portal
Publication:3158554
Jump to:navigation, search

DOI10.1145/324133.324179zbMath1065.68520OpenAlexW2138593246MaRDI QIDQ3158554

Erez Petrank, Martin Dietzfelbinger, Peter Bro Miltersen, Gábor Tardos, Noga Alon

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

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



Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05)


Related Items (4)

HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Linear Hashing Is Awesome ⋮ Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers




This page was built for publication: Linear hash functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3158554&oldid=16277652"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki