Simple Constructions of Almost k‐wise Independent Random Variables
- 1 January 1992
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 3 (3), 289-304
- https://doi.org/10.1002/rsa.3240030308
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- On the power of two-point based samplingJournal of Complexity, 1989
- Recognizing primes in random polynomial timePublished by Association for Computing Machinery (ACM) ,1987
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977