| Publication | Date of Publication | Type |
|---|
Pinpointing computation with modular queries in the Boolean hierarchy
| 2024-07-05 | Paper |
Bootstrapping variables in algebraic circuits
Proceedings of the National Academy of Sciences | 2020-03-04 | Paper |
Bootstrapping variables in algebraic circuits
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The query complexity of a permutation-based variant of mastermind
Discrete Applied Mathematics | 2019-05-03 | Paper |
Erratum: ``PRIMES is in P
Annals of Mathematics. Second Series | 2019-01-18 | Paper |
On the optimality of lattices for the Coppersmith technique
Applicable Algebra in Engineering, Communication and Computing | 2018-04-18 | Paper |
Integer factoring using small algebraic dependencies
| 2018-03-21 | Paper |
Dimension, pseudorandomness and extraction of pseudorandomness
Computability | 2017-11-22 | Paper |
Dimension, Pseudorandomness and Extraction of Pseudorandomness
| 2017-07-13 | Paper |
Approximate verification of the symbolic dynamics of Markov chains
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits
SIAM Journal on Computing | 2016-09-02 | Paper |
Primality and identity testing via Chinese remaindering
Journal of the ACM | 2015-11-12 | Paper |
Approximate verification of the symbolic dynamics of Markov chains
Journal of the ACM | 2015-08-14 | Paper |
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
SIAM Journal on Computing | 2015-06-08 | Paper |
Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
A roadmap for TAMC
Lecture Notes in Computer Science | 2014-04-16 | Paper |
The query complexity of finding a hidden permutation
Lecture Notes in Computer Science | 2013-09-13 | Paper |
The Discrete Time Behaviour of Restricted Linear Hybrid Automata
Modern Applications of Automata Theory | 2013-02-26 | Paper |
On the optimality of lattices for the Coppersmith technique
Information Security and Privacy | 2012-09-07 | Paper |
The isomorphism conjecture for NP
| 2012-09-05 | Paper |
On the arithmetic complexity of Euler function
Computer Science – Theory and Applications | 2011-06-17 | Paper |
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
STACS 2006 | 2008-03-19 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-09-25 | Paper |
The Polynomially Bounded Perfect Matching Problem Is in NC 2
STACS 2007 | 2007-09-03 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-05-02 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
scientific article; zbMATH DE number 5057518 (Why is no real title available?)
| 2006-09-26 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2005-11-11 | Paper |
PRIMES is in P
Annals of Mathematics. Second Series | 2005-04-18 | Paper |
scientific article; zbMATH DE number 2081094 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2081095 (Why is no real title available?)
| 2004-08-04 | Paper |
For completeness, sublogarithmic space is no space.
Information Processing Letters | 2003-01-21 | Paper |
The satisfiability problem for probabilistic ordered branching programs
Theory of Computing Systems | 2002-06-02 | Paper |
Reducing the complexity of reductions
Computational Complexity | 2002-05-05 | Paper |
Characterizing small depth and small space classes by operators of higher types
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
Journal of Computer and System Sciences | 2001-03-12 | Paper |
scientific article; zbMATH DE number 1559593 (Why is no real title available?)
| 2001-03-01 | Paper |
The Formula Isomorphism Problem
SIAM Journal on Computing | 2000-10-18 | Paper |
Reductions in circuit complexity: An isomorphism theorem and a gap theorem
Journal of Computer and System Sciences | 1999-09-29 | Paper |
scientific article; zbMATH DE number 1335882 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1300960 (Why is no real title available?)
| 1999-06-16 | Paper |
A note on decision versus search for graph automorphism
Information and Computation | 1997-11-12 | Paper |
DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization
Journal of Computer and System Sciences | 1997-08-03 | Paper |
On the isomorphism conjecture for weak reducibilities
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Geometric sets of low information content
Theoretical Computer Science | 1997-02-27 | Paper |
Quasi-linear truth-table reductions to \(p\)-selective sets
Theoretical Computer Science | 1997-02-27 | Paper |
Polynomial-time isomorphism of 1-L-complete sets
Journal of Computer and System Sciences | 1996-11-27 | Paper |
NP-Creative sets: A new class of creative sets in NP
Mathematical Systems Theory | 1996-10-16 | Paper |
