Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time-space trade-offs for undirected st-connectivity on a JAG
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Reversible Space Equals Deterministic Space
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Some observations on the computational complexity of graph accessibility problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.00 |