Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fast parallel algorithms for similarity of matrices
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The parallel complexity of exponentiating polynomials over finite fields
Journal of the ACM (JACM)
Parallelism and algorithms for algebraic manipulation: current work
ACM SIGSAM Bulletin
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Self-assessment procedure XXI: a self-assessment procedure on concurrency
Communications of the ACM
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation
Effective Noether irreducibility forms and applications
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Algorithms for sparse rational interpolation
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Parallel computation over hyperbolic groups
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
How much can we speedup Gaussian elimination with pivoting?
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallel solutions to geometric problems in the scan model of computation
Journal of Computer and System Sciences
Fast parallel computation of the Smith normal form of polynomial matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Designing programs that check their work
Journal of the ACM (JACM)
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Space-efficient implementation of nested parallelism
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scheduling threads for low space requirement and good locality
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Space-efficient scheduling of nested parallelism
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Computing a context-free grammar-generating series
Information and Computation
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science - Mathematical foundations of computer science
Reversible Space Equals Deterministic Space
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of planarity testing
Information and Computation
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Parallel graph algorithms that are efficient on average
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
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
A straight line program computing the integer greatest common divisor (abstract only)
ACM Communications in Computer Algebra
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
The parallel complexity of finite-state automata problems
Information and Computation
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On covering and rank problems for boolean matrices and their applications
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Reductions to graph isomorphism
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Non-deterministic Boolean proof nets
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Formal theories for linear algebra
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Feasible proofs of matrix properties with csanky's algorithm
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
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
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Relativizing small complexity classes and their theories
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A linearized stabilizer formalism for systems of finite dimension
Quantum Information & Computation
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.02 |