See this document in CiteSeerX!

Reducing Randomness In Computation Via Explicit Constructions (1996)  (Make Corrections)  
Shiyu Zhou



  Home/Search   Context   Related

 
View or download:
rutgers.edu/pub/tech...lcsrtr272.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rutgers.edu/pub/technicalrepo... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: OF THE DISSERTATION Reducing Randomness in Computation via Explicit Constructions by Shiyu Zhou Dissertation Director: Professor Michael Saks One of the important issues in both complexity theory and algorithm design is to understand whether randomness can be more powerful than determinism. In this dissertation, we explore some problems related to this issue and study how to reduce randomness in computation via explicit combinatorial constructions. One approach to achieving determinism... (Update)

Similar documents (at the sentence level):
32.3%:   Explicit OR-Dispersers with Polylogarithmic Degree - Saks, Srinivasan, Zhou (1998)   (Correct)

Active bibliography (related documents):   More   All
1.5:   Randomization and Derandomization in Space-Bounded Computation - Saks (1996)   (Correct)
0.6:   Computing With Very Weak Random Sources - Srinivasan, Zuckerman   (Correct)
0.6:   (De)randomized Construction of Small Sample Spaces in NC - Karger, Koller (1994)   (Correct)

Similar documents based on text:   More   All
0.3:   Space Algorithm for (s; t) - Connectivity In Undirected   (Correct)
0.2:   A Lower Bound for Primality - Eric Allender Dept (1999)   (Correct)
0.2:   References In A Memory Hierarc - Vidyadhar Phalke Graduate   (Correct)

BibTeX entry:   (Update)

@misc{ zhou-reducing,
  author = "Shiyu Zhou",
  title = "Reducing Randomness In Computation Via Explicit Constructions",
  url = "citeseer.ist.psu.edu/zhou96reducing.html" }
Citations (may not include all citations):
957   The Probabilistic Method (context) - Alon, Spencer - 1991
951   Computational Complexity (context) - Papadimitriou - 1994
837   Cambridge University Press (context) - Motwani, Raghavan - 1995
339   Theory and applications of trapdoor functions (context) - Yao - 1982
334   How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
218   Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1988
199   A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
170   Nondeterministic space is closed under complementation - Immerman - 1988
168   A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
167   Pseudo-Random Generation from One-Way Functions (context) - Impagliazzo, Levin et al. - 1989
145   Introduction to Finite Fields and their applications (context) - Lidl, Niederreiter - 1986
145   Computational complexity of probabilistic Turing machines (context) - Gill - 1977
139   Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
138   Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1993
132   Relationships between nondeterministic and deterministic spa.. (context) - Savitch - 1970
128   Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1992
122   How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
120   Unbiased Bits from Sources of Weak Randomness and Probabilis.. - Chor, Goldreich - 1988
106   Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
102   A fast and simple randomized parallel algorithm for the Maxi.. (context) - Alon, Babai et al. - 1986
88   Deterministic Simulation of Logspace (context) - Ajtai, Koml'os et al. - 1987
84   Simulating BPP Using a General Weak Random Source - Zuckerman - 1991
81   The bit extraction problem or t-resilient functions - Chor, Goldreich et al. - 1985
78   Probabilistic algorithm for testing primality (context) - Rabin - 1980
71   A fast parallel algorithm for the maximal independent set pr.. (context) - Karp, Wigderson - 1984
71   Explicit construction of linear-sized superconcentrators (context) - Gabber, Galil - 1981
70   the power of two point based sampling - Chor, Goldreich - 1989
68   Communication Complexity (context) - Kushilevitz, Nisan
68   Pseudorandom generators for space-bounded computation (context) - Nisan - 1990
66   A fast Monte-Carlo test for primality (context) - Solovay, Strassen - 1977
61   Expanders that Beat the Eigenvalue Bound: Explicit Construct.. - Wigderson, Zuckerman - 1993
58   Construction of asymptotically good low-rate error-correctin.. (context) - Alon, Bruck et al. - 1992
54   and Weak Random Sources (context) - Cohen, Wigderson et al. - 1989
53   The probabilistic method yields deterministic parallel algor.. - Motwani, Naor et al. - 1989
46   Random Polynomial Time is Equal to Slightly-Random Polynomia.. (context) - Vazirani, Vazirani - 1985
43   Symmetric space-bounded computation (context) - Lewis, Papadimitiou - 1982
42   The method of forced enumeration for nondeterministic automa.. (context) - Szelepcs'enyi - 1988
42   wise independence in NC (context) - Berger, Rompel et al. - 1991
41   Generating Quasi-Random Sequences from Slightly Random Sourc.. (context) - Santha, Vazirani - 1986
40   Approximations of general independent distributions - Even, Goldreich et al. - 1992
40   Explicit expanders and the Ramanujan conjectures (context) - Lubotzky, Phillips et al. - 1986
37   Multi-party protocols (context) - Chandra, Furst et al. - 1983
36   Recognizing primes in random polynomial time (context) - Adelman, Huang - 1987
36   Universal hash functions (context) - Carter, Wegman - 1979
35   General Weak Random Sources (context) - Zuckerman - 1990
35   On extracting randomness from weak random sources (context) - Ta-Shma - 1996
32   Hardness vs (context) - Nisan, Wigderson - 1988
31   Undirected Connectivity in O (context) - Nisan, Szemer'edi et al. - 1992
31   More Deterministic Simulation in Logspace (context) - Nisan, Zuckerman - 1993
31   Extracting Randomness: How and Why (context) - Nisan - 1996
30   Adversaries and Computation (context) - Vazirani - 1986
29   Independent Unbiased Coin Flips from a Correlated Biased Sou.. (context) - Blum - 1986
28   or Time versus Space (context) - Sipser, Randomness - 1988
28   randomized construction of small sample spaces in NC - Karger, Koller - 1994
26   Strong Communication Complexity or Generating QuasiRandom Se.. (context) - Vazirani - 1987
25   NP-complete problems have a version that's hard to approxima.. (context) - Zuckerman - 1993
25   Multiparty protocols and logspacehard pseudorandom sequences (context) - Babai, Nisan et al. - 1989
25   Symmetric logspace is closed under complement - Nisan, Ta-Shma - 1995
23   Sample spaces uniform on neighborhoods (context) - Schulman - 1992
21   universal sequences and the complexity of maze problems (context) - Aleliunas, Karp et al. - 1979
20   Efficiency Considerations in Using Semi-Random Sources (context) - Vazirani - 1987
19   Relationships among PL (context) - Allender, Ogihara - 1994
19   Monte Carlo simulations: Hidden errors from (context) - Ferrenberg, Landau et al. - 1992
19   Explicit constructions of exponential sized families of k- i.. (context) - Alon - 1986
17   Explicit dispersers with polylog degree (context) - Saks, Srinivasan et al. - 1995
16   Journal of Combinatorial Theory (context) - Erdos, Selfridge et al. - 1973
16   Splitters and near-optimal derandomization - Naor, Schulman et al. - 1995
16   Efficient construction of a small hitting set for combinator.. - Linial, Luby et al. - 1993
16   and other ramifications of a simple min-cut algorithm (context) - Karger, in - 1993
15   Pseudorandomness for network algorithms - Impagliazzo, Nisan et al. - 1994
15   Randomization and Derandomization in Space-Bounded Computati.. - Saks - 1996
13   wise independent random variables (context) - Karloff, Mansour et al. - 1994
12   Parallel implementation of algorithms for finding connected .. - Hsu, Ramachandran et al. - 1994
12   Constructing a maximum matching is in random NC (context) - Karp, Upfal et al. - 1986
12   On Using Deterministic Functions in Probabilistic Algorithms (context) - Santha - 1987
12   Improved algorithms via approximations of probability distri.. - Chari, Rohatgi et al. - 1994
11   Using hard problems to create pseudorandom generators (context) - Nisan - 1991
10   Discrepancy sets and pseudorandom generators for combinatori.. - Armoni, Saks et al. - 1996
9   multiple access to randomness in Logspace (context) - Nisan, vs - 1993
9   Graph augmentation and related problems: theory and practice - Hsu - 1993
9   Relationships between probabilistic and deterministic tape c.. (context) - Jung
6   Vector sets for exhaustive testing of logic circuits (context) - Seroussi, Bshouty - 1988
6   probe search (context) - Fiat, Naor - 1993
4   Pseudorandomness for space bounded computations (context) - Armoni, Wigderson - 1995
3   Finding small sample spaces satisfying given constraints (context) - Koller, Megiddo - 1993
2   Parallel computation and wellendowed rings and space-bounded.. (context) - Borodin, Cook et al. - 1983
1   Various techniques for use in connection with random digits (context) - von Neumann - 1963
1   Sample spaces with small bias on neighborhoods and error-cor.. (context) - Saks, Zhou - 1996
1   Mathematical Foundations of Computer Science: Proceedings (context) - Wigderson, of - 1992
1   Derandomizing Chebyshev's inequality to find independent set.. (context) - Fundia - 1994
1   Lecture notes on Random Structures and Algorithms (context) - Saks - 1994
1   A parallel algorithm version of the Local Lemma (context) - Alon - 1991

Documents on the same site (http://www.cs.rutgers.edu/pub/technical-reports/):   More
Constrained REDO: An Alternative to REPLAY - Liew, Steinberg (1993)   (Correct)
Jambalaya: Using Multicast for Blind Distributed Web Searching .. - Navas, Hirsh (1998)   (Correct)
Law-Governed Regularities in Software Systems - Minsky (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC