The computational complexity of universal hashing

Theoretical Computer Science

Volumn 107, Issue 1, 1993, Pages 121-133

  Mansour, Yishay ^a   Nisan, Noam ^b   Tiwari, Prasoon ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149074447     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(93)90257-T     Document Type: Article

References (26)

1. Time-space tradeoffs for branching programs constructed with those straight line programs
2. Complexity classes in communication complexity theory
3. A general sequential time space tradeoff for finding unique elements
4. The complexity of finite functions
5. A time-space tradeoff for sorting on a general sequential model of computation
6. Parallel computation for well-endowed rings and space-bounded probabilistic machines
7. A time-space tradeoff for sorting on non-oblivious machines
8. Universal hash functions
9. The recognition problem for the set of perfect squares, conference record
10. Upper and lower bounds for parallel random access machines without simultaneous writes
11. Private coins versus public coins in interactive proof systems
12. How to recycle random bits
13. A method of determining lower bounds for the complexity of π schemes
14. Tradeoffs between communication and space
15. Constant depth circuits fourier transform and learnability
16. Pseudorandom generators for space-bounded computation
17. On universal classes of fast high performance hash functions their time-space tradeoff and their application
18. A complexity theoretic approach to randomness
19. A complexity theory for VLSI
20. The communication complexity of distributed computing and a parallel algorithm for polynomial roots
21. Time-space tradeoffs for computing functions, using connectivity properties of their circuits
22. The entropic limitations on VLSI computations
23. A time-space tradeoff for matrix multiplication and the discrete fourier transform on a general sequential random access computer