| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7526292 (Why is no real title available?)
| 2022-05-12 | Paper |
Introduction to quantum algorithms via linear algebra
| 2021-04-02 | Paper |
How to store a triangular matrix
IEEE Transactions on Computers | 2018-09-14 | Paper |
DNA2DNA computations: A potential “killer app”?
Automata, Languages and Programming | 2018-07-04 | Paper |
Provably Secure Virus Detection: Using The Observer Effect Against Malware.
| 2017-12-19 | Paper |
Provably-secure remote memory attestation for heap overflow protection
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Simple strategies for large zero-sum games with applications to complexity theory
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Polynomial-time algorithm for the orbit problem
Journal of the ACM | 2016-01-04 | Paper |
Time-space lower bounds for satisfiability
Journal of the ACM | 2015-12-04 | Paper |
Algorithms for black-box fields and their application to cryptography
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
A \(p\)-adic approach to the Jacobian conjecture
Journal of Pure and Applied Algebra | 2015-02-27 | Paper |
Quantum algorithms via linear algebra. A primer
| 2014-10-10 | Paper |
scientific article; zbMATH DE number 6292751 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
People, problems, and proofs. Essays from Gödel's lost letter: 2010
| 2013-12-06 | Paper |
An approximate restatement of the Four-Color Theorem
Journal of Graph Algorithms and Applications | 2013-10-29 | Paper |
Amplifying circuit lower bounds against polynomial time, with applications
Computational Complexity | 2013-07-19 | Paper |
Algorithms for message ferrying on mobile ad hoc networks
| 2012-10-24 | 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 |
Best-order streaming model
Theoretical Computer Science | 2011-05-18 | Paper |
On tractable exponential sums
Frontiers in Algorithmics | 2010-09-07 | Paper |
Improved simulation of nondeterministic Turing machines
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the Fourier spectrum of symmetric Boolean functions
Combinatorica | 2010-08-13 | Paper |
The \(\text{P}=\text{NP}\) question and Gödel's lost letter
| 2010-08-03 | Paper |
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters | 2010-06-16 | Paper |
Non-uniform depth of polynomial time and space simulations.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Polynomials that sign represent parity and Descartes' rule of signs
Computational Complexity | 2009-06-17 | Paper |
Best-Order Streaming Model
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2009-05-26 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Algorithms for Modular Counting of Roots of Multivariate Polynomials
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Inapproximability results for combinatorial auctions with submodular utility functions
Algorithmica | 2008-09-12 | Paper |
Algorithms for modular counting of roots of multivariate polynomials
Algorithmica | 2008-04-23 | Paper |
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
Journal of Computer and System Sciences | 2006-04-28 | Paper |
Financial Cryptography and Data Security
Lecture Notes in Computer Science | 2005-12-22 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem
| 2005-07-26 | Paper |
Estimating the maximum
Journal of Algorithms | 2005-02-22 | Paper |
scientific article; zbMATH DE number 2079409 (Why is no real title available?)
| 2004-07-28 | Paper |
On the importance of eliminating errors in cryptographic computations
Journal of Cryptology | 2003-08-26 | Paper |
A note on square rooting of time functions of Turing machines
Theory of Computing Systems | 2003-08-26 | Paper |
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1568794 (Why is no real title available?)
| 2001-02-22 | Paper |
The Complexity of theA B CProblem
SIAM Journal on Computing | 2000-10-18 | Paper |
scientific article; zbMATH DE number 1241378 (Why is no real title available?)
| 2000-05-18 | Paper |
scientific article; zbMATH DE number 1414321 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1342103 (Why is no real title available?)
| 1999-11-21 | Paper |
scientific article; zbMATH DE number 1256688 (Why is no real title available?)
| 1999-11-08 | Paper |
scientific article; zbMATH DE number 1241372 (Why is no real title available?)
| 1999-01-17 | Paper |
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing | 1998-09-21 | Paper |
scientific article; zbMATH DE number 1003261 (Why is no real title available?)
| 1997-10-29 | Paper |
scientific article; zbMATH DE number 1024063 (Why is no real title available?)
| 1997-09-17 | Paper |
scientific article; zbMATH DE number 1030974 (Why is no real title available?)
| 1997-07-06 | Paper |
On the computational power of DNA
Discrete Applied Mathematics | 1997-04-21 | Paper |
On proving that a graph has no large clique: A connection with Ramsey theory
Information Processing Letters | 1997-02-27 | Paper |
scientific article; zbMATH DE number 799766 (Why is no real title available?)
| 1996-07-28 | Paper |
Query size estimation by adaptive sampling
Journal of Computer and System Sciences | 1996-02-13 | Paper |
Subquadratic Simulations of Balanced Formulae by Branching Programs
SIAM Journal on Computing | 1994-08-14 | Paper |
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences | 1994-04-27 | Paper |
A Monte-Carlo Algorithm for Estimating the Permanent
SIAM Journal on Computing | 1993-05-17 | Paper |
Clocked adversaries for hashing
Algorithmica | 1993-05-16 | Paper |
On games of incomplete information
Theoretical Computer Science | 1993-01-16 | Paper |
scientific article; zbMATH DE number 18527 (Why is no real title available?)
| 1992-06-26 | Paper |
Set systems with no union of cardinality 0 modulo \(m\)
Graphs and Combinatorics | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4191094 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4205986 (Why is no real title available?)
| 1990-01-01 | Paper |
The processor identity problem
Information Processing Letters | 1990-01-01 | Paper |
Unbounded fan-in circuits and associative functions
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Pseudorandom number generation and space complexity
Information and Control | 1985-01-01 | Paper |
Alternating Pushdown and Stack Automata
SIAM Journal on Computing | 1984-01-01 | Paper |
Alternation bounded auxiliary pushdown automata
Information and Control | 1984-01-01 | Paper |
VLSI Layout as Programming
ACM Transactions on Programming Languages and Systems | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3852437 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3876586 (Why is no real title available?)
| 1983-01-01 | Paper |
Turing machines that take advice
L'Enseignement Mathématique. 2e Série | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3778752 (Why is no real title available?)
| 1982-01-01 | Paper |
Computing extremal and approximate distances in graphs having unit cost edges
Acta Informatica | 1981-01-01 | Paper |
Covering Graphs by Simple Circuits
SIAM Journal on Computing | 1981-01-01 | Paper |
On the structure of sets in NP and other complexity classes
Theoretical Computer Science | 1981-01-01 | Paper |
Applications of a Planar Separator Theorem
SIAM Journal on Computing | 1980-01-01 | Paper |
Social processes and proofs of theorems and programs
The Mathematical Intelligencer | 1980-01-01 | Paper |
Addition Chain Methods for the Evaluation of Specific Polynomials
SIAM Journal on Computing | 1980-01-01 | Paper |
Space-Time Trade-Offs in Structured Programming
Journal of the ACM | 1980-01-01 | Paper |
External Hashing Schemes for Collections of Data Structures
Journal of the ACM | 1980-01-01 | Paper |
Generalized Nested Dissection
SIAM Journal on Numerical Analysis | 1979-01-01 | Paper |
A Separator Theorem for Planar Graphs
SIAM Journal on Applied Mathematics | 1979-01-01 | Paper |
Linear programming is log-space hard for P
Information Processing Letters | 1979-01-01 | Paper |
On the complexity of computations under varying sets of primitives
Journal of Computer and System Sciences | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3652320 (Why is no real title available?)
| 1979-01-01 | Paper |
A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings
Mathematical Systems Theory | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3583260 (Why is no real title available?)
| 1978-01-01 | Paper |
A probabilistic remark on algebraic program testing
Information Processing Letters | 1978-01-01 | Paper |
A batching method for coloring planar graphs
Information Processing Letters | 1978-01-01 | Paper |
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
Journal of Computer and System Sciences | 1978-01-01 | Paper |
Preserving average proximity in arrays
Communications of the ACM | 1978-01-01 | Paper |
Polynomials with 0-1 Coefficients That are Hard to Evaluate
SIAM Journal on Computing | 1978-01-01 | Paper |
Evaluation of polynomials with super-preconditioning
Journal of Computer and System Sciences | 1978-01-01 | Paper |
The enforcement of security policies for computation
Journal of Computer and System Sciences | 1978-01-01 | Paper |
Word Problems Solvable in Logspace
Journal of the ACM | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3715013 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3635501 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3648730 (Why is no real title available?)
| 1977-01-01 | Paper |
A Linear Time Algorithm for Deciding Subject Security
Journal of the ACM | 1977-01-01 | Paper |
Synchronization and computing capabilities of linear asynchronous structures
Journal of Computer and System Sciences | 1977-01-01 | Paper |
Complexity measures and hierarchies for the evaluation of integers and polynomials
Theoretical Computer Science | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3635497 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3582425 (Why is no real title available?)
| 1976-01-01 | Paper |
Multidimensional Searching Problems
SIAM Journal on Computing | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3591381 (Why is no real title available?)
| 1976-01-01 | Paper |
Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3564333 (Why is no real title available?)
| 1976-01-01 | Paper |
Reduction
Communications of the ACM | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3499229 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3635492 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3562484 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3485216 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3562542 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3562512 (Why is no real title available?)
| 1974-01-01 | Paper |
