Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Representing Boolean functions as polynomials modulo composite numbers
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Comparing information without leaking it
Communications of the ACM
On learning width two branching programs (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Journal of the ACM (JACM)
Computing with highly mixed states (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Strong bias of group generators: an obstacle to the “product replacement algorithm”
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Multi-head finite automata: data-independent versus data-dependent computations
Theoretical Computer Science
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The Complexity of Tensor Circuit Evaluation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Topological Quantum Computation
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Learning Intermediate Concepts
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On Learning Embedded Midbit Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
On Computational Power of Quantum Branching Programs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Equation Satisfiability and Program Satisfiability for Finite Monoids
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The computing power of programs over finite monoids
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
An algebraic approach to data languages and timed languages
Information and Computation
Counting Modulo Quantifiers on Finite Linearly Ordered Trees
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Circuits And Expressions With Non-Associative Gates
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Completeness results for graph isomorphism
Journal of Computer and System Sciences
The complexity of tensor calculus
Computational Complexity
Strong bias of group generators: an obstacle to the "product replacement algorithm"
Journal of Algorithms - Special issue: SODA 2000
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Functions computable in polynomial space
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
The computational power of Benenson automata
Theoretical Computer Science
On the computational power of probabilistic and quantum branching program
Information and Computation
On learning embedded midbit functions
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning expressions and programs over monoids
Information and Computation
Computing with highly mixed states
Journal of the ACM (JACM)
Computational Complexity
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Robustness of PSPACE-complete sets
Information Processing Letters
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Secure Function Collection with Sublinear Storage
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Functions computable in polynomial space
Information and Computation
On the computational power of probabilistic and quantum branching program
Information and Computation
Learning expressions and programs over monoids
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Relating branching program size and formula size over the full binary basis
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Circuits and context-free languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Additively homomorphic encryption with d-operand multiplications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Algorithms and theory of computation handbook
Counting classes and the fine structure between NC1and L
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Leaf languages and string compression
Information and Computation
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
ROM-based computation: quantum versus classical
Quantum Information & Computation
Estimating Jones polynomials is a complete problem for one clean qubit
Quantum Information & Computation
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Inexpressibility results for regular languages in nonregular settings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the correlation between parity and modular polynomials
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An algebraic view on exact learning from queries
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Linear circuits, two-variable logic and weakly blocked monoids
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Linear circuits, two-variable logic and weakly blocked monoids
Theoretical Computer Science
Lattice-based FHE as secure as PKE
Proceedings of the 5th conference on Innovations in theoretical computer science
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.02 |