Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions

Algorithmica (New York)

Volumn 16, Issue 4-5, 1996, Pages 434-449

  Alon, N ^a   Naor, M ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Derandomization; Matrix multiplication; Perfect hashing

Indexed keywords

EID: 0000156664     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01940874     Document Type: Article

References (32)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7 (1986), 567-583.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs, IEEE Transactions on Information Theory, 38 (1992), 509-516.
3. N. Alon, Z. Galil, and O. Margalit, On the exponent of the All Pairs Shortest Path problem. Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, 1991, pp. 569-575. Also Journal of Computer and System Sciences, to appear.
4. N. Alon, Z. Galil, and O. Margalit, On the exponent of the All Pairs Shortest Path problem. Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, 1991, pp. 569-575. Also Journal of Computer and System Sciences, to appear.
5. N. Alon, Z. Galil, O. Margalit, and M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths, Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, 1992, pp. 417-426.
6. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 544-553. Also Random Structures and Algorithms, 3 (1992), 289-304.
7. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 544-553. Also Random Structures and Algorithms, 3 (1992), 289-304.
8. N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1991.
9. c n)-wise independence in NC, Journal of the ACM, 38 (1991), 1026-1046.
10. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, 9 (1990), 251-280.
11. A. Fiat and M. Naor, Implicit O(1) probe search, SIAM Journal on Computing, 22 (1993), 1-10.
12. A. Fiat, M. Naor, J. P. Schmidt, and A. Siegel, Non-oblivious hashing, Journal of the ACM, 31 (1992), 764-782.
13. M. L. Fredman and J. Komlós, On the size of separating systems and families of perfect hash functions. SIAM Journal on Algebraic and Discrete Methods, 5(1) (1984), 61-68.
14. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, Journal of the ACM, 31 (1984), 538-544.
15. Z. Galil and O. Margalit, A faster algorithm for the all pairs shortest path problem for undirected graphs, Manuscript, August 1991.
16. Z. Galil and O. Margalit, Witnesses for Boolean matrix multiplication and for transitive closure, Journal of Complexity, 9 (1993), 201-221.
17. R. M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, Journal of the ACM, 32 (1985), 762-773.
18. J. Körner, Fredman-Komlós bounds and information theory, SIAM Journal on Algebraic and Discrete Methods, 7 (1986), 560-570.
19. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM Journal on Computing, 15 (1986), 1036-1053.
20. M. Luby, Removing randomness in parallel computation without a processor penalty, Journal of Computer Systems and Science, 47 (1993), 250-286.
21. H. Mairson, The effect of table expansion on the program complexity of perfect hash functions, BIT, 32 (1992), 430-440.
22. O. Margalit, Ph.D. Dissertation, Tel Aviv University, 1993.
23. K. Mehlhorn, Data Structure and Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, 1984.
24. R. Motwani, J. Naor and M. Naor, The probabilistic method yields deterministic parallel algorithms, Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 8-13.
25. J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing, 22 (1993), 838-856.
26. A. Nilli, Perfect hashing and probability, Combinatorics, Probability and Computing, 3 (1994), 407-419.
27. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer Systems and Science, 37 (1988), 130-143.
28. T. J. Sager, A polynomial time generator for minimal perfect hash functions, Communications of the ACM, 28 (1985).
29. J. Schmidt and A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing, 19 (1990), 775-786.
30. R. Seidel, On the all-pairs-shortest-path problem, Proc. 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 745-749.
31. J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, PA, 1987.
32. R. E. Tarjan and A. C. Yao, Storing a Sparse Table, Communications of the ACM, 22 (1979), 606-611.