A taxonomy of problems with fast parallel algorithms
Information and Control
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
The Boolean hierarchy II: applications
SIAM Journal on Computing
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Gap-definable counting classes
Journal of Computer and System Sciences
Equivalence of NCk and ACk–1 closures of NP and other classes
Information and Computation
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Probabilistic Time and Space
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Collapsing Oracle-Tape Hierarchies
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On the parallel complexity of matrix factorization algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the size of monotone span programs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
| Hi-index | 0.00 |