-
1
-
-
0001011699
-
A fast and simple randomized parallel algorithm for the maximal independent set problem
-
N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7, 567-583 (1986).
-
(1986)
J. Algorithms
, vol.7
, pp. 567-583
-
-
Alon, N.1
Babai, L.2
Itai, A.3
-
2
-
-
84990678058
-
Simple constructions of almost k-wise independent random variables
-
N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Simple constructions of almost k-wise independent random variables, J. Random Structures Algorithms, 3, 289-304 (1992).
-
(1992)
J. Random Structures Algorithms
, vol.3
, pp. 289-304
-
-
Alon, N.1
Goldreich, O.2
Håstad, J.3
Peralta, R.4
-
3
-
-
0030402040
-
Discrepancy sets and pseudorandom generators for combinatorial rectangles
-
Burlington, Vermont
-
R. Armoni, M. Saks, A. Wigderson, and S. Zhou, Discrepancy sets and pseudorandom generators for combinatorial rectangles, Proceedings of the 37th Annual Symposium on the Foundations of Computer Science, Burlington, Vermont, 1996, pp. 412-421.
-
(1996)
Proceedings of the 37th Annual Symposium on the Foundations of Computer Science
, pp. 412-421
-
-
Armoni, R.1
Saks, M.2
Wigderson, A.3
Zhou, S.4
-
4
-
-
85033885375
-
Approximating arbitrary probability distributions using small sample spaces
-
to appear
-
Y. Azar, R. Motwani, and J. Naor, Approximating arbitrary probability distributions using small sample spaces, Combinatorica, to appear.
-
Combinatorica
-
-
Azar, Y.1
Motwani, R.2
Naor, J.3
-
6
-
-
0022198802
-
The bit extraction problem and t-resilient functions
-
Portland, Oregon
-
B. Chor, J. Freidmann, O. Goldreich, J. Hastad, S. Rudich, and R. Smolensky, The bit extraction problem and t-resilient functions, Proceedings of the 26th Annual Symposium on the Foundations of Computer Science, Portland, Oregon, 1985, pp. 396-407.
-
(1985)
Proceedings of the 26th Annual Symposium on the Foundations of Computer Science
, pp. 396-407
-
-
Chor, B.1
Freidmann, J.2
Goldreich, O.3
Hastad, J.4
Rudich, S.5
Smolensky, R.6
-
7
-
-
0002739272
-
On the power of two-point based sampling
-
B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity, 5, 96-106 (1989).
-
(1989)
J. Complexity
, vol.5
, pp. 96-106
-
-
Chor, B.1
Goldreich, O.2
-
9
-
-
0027004045
-
Approximations of general independent distributions
-
G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličković, Approximations of general independent distributions, Proceedings of the 24th ACM Symposium on Theory of Computing (STOC), 1992, pp. 10-16.
-
(1992)
Proceedings of the 24th ACM Symposium on Theory of Computing (STOC)
, pp. 10-16
-
-
Even, G.1
Goldreich, O.2
Luby, M.3
Nisan, N.4
Veličković, B.5
-
10
-
-
85033887400
-
-
G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličković, Approximations of general independent distributions, 1997, available at http://theory.lcs.mit.edu/ ∼oded/eglnv.html.
-
(1997)
Approximations of General Independent Distributions
-
-
Even, G.1
Goldreich, O.2
Luby, M.3
Nisan, N.4
Veličković, B.5
-
12
-
-
0022146483
-
A fast parallel algorithm for the maximal independent set problem
-
R. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. Assoc. Comput. Mech., 32, 762-773 (1985).
-
(1985)
J. Assoc. Comput. Mech.
, vol.32
, pp. 762-773
-
-
Karp, R.1
Wigderson, A.2
-
13
-
-
0002918554
-
The complexity of non uniform random number generation
-
J. Traub, Ed., AC Press, New York
-
D. Knuth and A. Yao, The complexity of non uniform random number generation, in Algorithms and Complexity, J. Traub, Ed., AC Press, New York, 1976, pp. 357-428.
-
(1976)
Algorithms and Complexity
, pp. 357-428
-
-
Knuth, D.1
Yao, A.2
-
14
-
-
0027274447
-
Constructing small sample spaces satisfying given constraints
-
San Diego, California
-
D. Koller and N. Megiddo, Constructing small sample spaces satisfying given constraints, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, California, 1993, pp. 268-277.
-
(1993)
Proceedings of the 25th Annual ACM Symposium on the Theory of Computing
, pp. 268-277
-
-
Koller, D.1
Megiddo, N.2
-
15
-
-
85033893606
-
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
-
to appear
-
N. Linial, M. Luby, M. Saks, and D. Zuckerman, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Combinatorica, to appear.
-
Combinatorica
-
-
Linial, N.1
Luby, M.2
Saks, M.3
Zuckerman, D.4
-
16
-
-
0022807929
-
A simple parallel algorithm for the maximal independent set problem
-
M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Computing, 15, 1036-1053 (1986).
-
(1986)
SIAM J. Computing
, vol.15
, pp. 1036-1053
-
-
Luby, M.1
-
17
-
-
1542710520
-
On deterministic approximation of DNF
-
M. Luby and B. Veličković, On deterministic approximation of DNF, Algorithmica, 16, 415-433 (1996).
-
(1996)
Algorithmica
, vol.16
, pp. 415-433
-
-
Luby, M.1
Veličković, B.2
-
18
-
-
0027641832
-
Small-bias probability spaces: Efficient constructions and applications
-
J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM J. Computing, 22, 838-856 (1993).
-
(1993)
SIAM J. Computing
, vol.22
, pp. 838-856
-
-
Naor, J.1
Naor, M.2
-
19
-
-
0000947929
-
Pseudo-random generators for space-bounded computation
-
N. Nisan, Pseudo-random generators for space-bounded computation, Combinatorica, 12, 449-461 (1992).
-
(1992)
Combinatorica
, vol.12
, pp. 449-461
-
-
Nisan, N.1
|