Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
Authors:
- 1 October 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 16 (4-5) , 434-449
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Perfect Hashing and ProbabilityCombinatorics, Probability and Computing, 1994
- Witnesses for Boolean Matrix Multiplication and for Transitive ClosureJournal of Complexity, 1993
- Implicit $O(1)$ Probe SearchSIAM Journal on Computing, 1993
- Nonoblivious hashingJournal of the ACM, 1992
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Simulating (log c n )-wise independence in NCJournal of the ACM, 1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984