Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
The Tree Model for Hashing: Lower and Upper Bounds
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
Y. Gil
F. Meyer auf der Heide
A. Wigderson
Publication:
SIAM J. on Computing, vol. 25, no. 5, pp. 936-955, October 1996.
Preliminary version in Proceedings of the 22nd STOC, pp. 244-253, May 1990.
Year:
1990
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/gmw96.pdf
Hide
Files
File:
Journal version (pdf)
bibTeX
‹ The Security of Multi-Party Protocols in Distributed Systems
up
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off ›