| Publication | Date of Publication | Type |
|---|
Algebraic and logical emulations of quantum circuits
Transactions on Computational Science XXXI | 2021-05-26 | Paper |
| Introduction to quantum algorithms via linear algebra | 2021-04-02 | Paper |
Hilbert’s Proof of His Irreducibility Theorem
The American Mathematical Monthly | 2018-07-11 | Paper |
| Exact computation of the number of accepting paths of an NTM | 2018-06-05 | Paper |
Approximation of function evaluation over sequence arguments via specialized data structures
Theoretical Computer Science | 2015-12-08 | Paper |
Efficient memoization for approximate function evaluation over sequence arguments
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
| Quantum algorithms via linear algebra. A primer | 2014-10-10 | Paper |
| People, problems, and proofs. Essays from Gödel's lost letter: 2010 | 2013-12-06 | Paper |
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science | 2012-03-13 | Paper |
Symmetric functions capture general functions (extended abstract)
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Improved simulation of nondeterministic Turing machines
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Improved construction for universality of determinant and permanent
Information Processing Letters | 2010-01-29 | Paper |
| scientific article; zbMATH DE number 5604062 (Why is no real title available?) | 2009-09-15 | Paper |
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Lecture Notes in Computer Science | 2009-03-06 | Paper |
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
Theoretical Computer Science | 2009-01-08 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Games with uniqueness properties
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086402 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1810493 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1414295 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1114020 (Why is no real title available?) | 1998-10-11 | Paper |
Parameterized circuit complexity and the \(W\) hierarchy
Theoretical Computer Science | 1998-08-13 | Paper |
Gap-languages and log-time complexity classes
Theoretical Computer Science | 1998-06-30 | Paper |
| scientific article; zbMATH DE number 1072537 (Why is no real title available?) | 1997-10-08 | Paper |
Index sets and presentations of complexity classes
Theoretical Computer Science | 1997-09-18 | Paper |
Performance of neural net heuristics for maximum clique on diverse highly compressible graphs
Journal of Global Optimization | 1997-07-23 | Paper |
The power of the middle bit of a \(\#\)P function
Journal of Computer and System Sciences | 1996-11-04 | Paper |
Linear Time and Memory-Efficient Computation
SIAM Journal on Computing | 1996-07-02 | Paper |
On closure properties of bounded two-sided error complexity classes
Mathematical Systems Theory | 1995-12-13 | Paper |
Diagonalization, uniformity, and fixed-point theorems
Information and Computation | 1993-01-17 | Paper |
Minimum-complexity pairing functions
Journal of Computer and System Sciences | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 4012593 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4023249 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3873308 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3841832 (Why is no real title available?) | 1983-01-01 | Paper |
