A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Polynomial time solutions of some problems of computational algebra
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
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
Fast parallel computation of the Smith normal form of polynomial matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On some variations of two-way probabilistic finite automata models
Theoretical 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
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Proceedings of the forty-second ACM symposium on Theory of computing
Space-efficient Gröbner basis computation without degree bounds
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Journal of the ACM (JACM)
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
LTL model checking of interval markov chains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |