Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Perfect hash function
OpenAlex ID:
C87431388
New hash functions and their use in authentication and set equality
1981
·
Mark N. Wegman
, J.Lawrence Carter
·
Journal of Computer and System Sciences
·
1,665
Cuckoo hashing
2004
·
Rasmus Pagh
, Flemming Friche Rodler
·
Journal of Algorithms
·
1,273
Universal one-way hash functions and their cryptographic applications
1989
·
M. Naor
, M. Yung
·
ACM Symposium on Theory of Computing (STOC)
·
1,074
PDF
Similarity estimation techniques from rounding algorithms
2002
·
Moses S. Charikar
·
ACM Symposium on Theory of Computing (STOC)
·
929
Fast pose estimation with parameter-sensitive hashing
2003
·
Shakhnarovich
, Viola
, et al.
·
IEEE/CVF International Conference on Computer Vision (ICCV)
·
816
Small-Bias Probability Spaces: Efficient Constructions and Applications
1993
·
Joseph Naor
, Moni Naor
·
SIAM Journal on Computing
·
678
The PHOTON Family of Lightweight Hash Functions
2011
·
Jian Guo
, Thomas Peyrin
, et al.
·
Lecture notes in computer science
·
658
A complexity theoretic approach to randomness
1983
·
Michael Sipser
·
ACM Symposium on Theory of Computing (STOC)
·
553
Universal classes of hash functions (Extended Abstract)
1977
·
J. Lawrence Carter
, Mark N. Wegman
·
ACM Symposium on Theory of Computing (STOC)
·
517
PDF
Cryptographic Hash Functions from Expander Graphs
2007
·
Denis X. Charles
, Kristin E. Lauter
, et al.
·
Journal of Cryptology
·
486
PDF
Dynamic Perfect Hashing: Upper and Lower Bounds
1988
·
M. Dietzfelbinger
, A. Karlin
, et al.
·
SIAM Journal on Computing
·
442
Splitters and near-optimal derandomization
2002
·
M. Naor
, L.J. Schulman
, et al.
·
Annual Symposium on Foundations of Computer Science
·
394
Generalized Compact Knapsacks Are Collision Resistant
2006
·
Vadim Lyubashevsky
, Daniele Micciancio
·
Lecture notes in computer science
·
373
Cuckoo Hashing
2001
·
Rasmus Pagh
, Flemming Friche Rodler
·
Lecture notes in computer science
·
372
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
2002
·
John Black
, Phillip Rogaway
, et al.
·
Lecture notes in computer science
·
371
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
2008
·
Martijn Stam
·
Lecture notes in computer science
·
367
Algorithmic construction of sets for k -restrictions
2006
·
Noga Alon
, Dana Moshkovitz
, et al.
·
ACM Transactions on Algorithms
·
347
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
1989
·
Donovan A. Schneider
, David J. DeWitt
·
ACM SIGMOD Record
·
346
Optimal Data-Dependent Hashing for Approximate Near Neighbors
2015
·
Alexandr Andoni
, Ilya Razenshteyn
·
ACM Symposium on Theory of Computing (STOC)
·
329
Quark: A Lightweight Hash
2010
·
Jean-Philippe Aumasson
, Luca Henzen
, et al.
·
Lecture notes in computer science
·
318
Fast search in Hamming space with multi-index hashing
2012
·
M. Norouzi
, A. Punjani
, et al.
·
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
·
289
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
1997
·
Mihir Bellare
, Daniele Micciancio
·
Lecture notes in computer science
·
285
Cryptography in $NC^0$
2006
·
Benny Applebaum
, Yuval Ishai
, et al.
·
SIAM Journal on Computing
·
270
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
1996
·
Shai Halevi
, Silvio Micali
·
Lecture notes in computer science
·
252
On the Size of Separating Systems and Families of Perfect Hash Functions
1984
·
Michael L. Fredman
, János Komlós
·
SIAM Journal on Algebraic and Discrete Methods
·
251
Show more works
View as search
Works count:
2,536
Citation count:
42,960
Year
Topic
Type