Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
A taxonomy of problems with fast parallel algorithms
Information and Control
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing a perfect matching is in random NC
Combinatorica
NP is as easy as detecting unique solutions
Theoretical Computer Science
The two-processor scheduling problem is in R-NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Towards the learnability of DNF formulae
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The monotone theory for the PAC-model
Information and Computation
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A near-optimal real-time hardware scheduler for large cardinality crossbar switches
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A two-stage hardware scheduler combining greedy and optimal scheduling
Journal of Parallel and Distributed Computing
The ideal membership problem and polynomial identity testing
Information and Computation
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Efficiency-revenue trade-offs in auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Frobenius's Degree Formula and Toda's Polynomials
Theory of Computing Systems
| Hi-index | 0.00 |