| Publication | Date of Publication | Type |
|---|
| Upward translation of optimal and P-optimal proof systems in the Boolean hierarchy over NP | 2024-12-03 | Paper |
| Oracle with \(\text{P}=\text{NP}\cap\text{coNP}\), but no many-one completeness in UP, disjNP, and disjConNP | 2024-08-06 | Paper |
| NP-Completeness, Proof Systems, and Disjoint NP-Pairs. | 2023-02-07 | Paper |
| Emptiness problems for integer circuits | 2020-05-26 | Paper |
Emptiness problems for integer circuits
Theoretical Computer Science | 2020-05-23 | Paper |
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Theoretical Computer Science | 2017-11-07 | Paper |
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
Information and Computation | 2017-09-28 | Paper |
Introduction to autoreducibility and mitoticity
Computability and Complexity | 2017-04-04 | Paper |
Efficient algorithms for membership in Boolean hierarchies of regular languages
Theoretical Computer Science | 2016-08-31 | Paper |
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Pursuit of the Universal | 2016-08-17 | Paper |
Unions of disjoint NP-complete sets
ACM Transactions on Computation Theory | 2015-09-07 | Paper |
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Perfect correspondences between dot-depth and polynomial-time hierarchies
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Autoreducibility of complete sets for log-space and polynomial-time reductions
Automata, Languages, and Programming | 2013-08-06 | Paper |
| Efficient algorithms for membership in Boolean hierarchies of regular languages | 2013-03-19 | Paper |
Applications of discrepancy theory in multiobjective approximation
(available as arXiv preprint) | 2012-08-31 | Paper |
Structural complexity of multiobjective NP search problems
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Unions of disjoint NP-complete sets
Lecture Notes in Computer Science | 2011-08-17 | Paper |
The fault tolerance of NP-hard problems
Information and Computation | 2011-07-27 | Paper |
The shrinking property for NP and coNP
Theoretical Computer Science | 2011-02-21 | Paper |
Space-efficient informational redundancy
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Satisfiability of algebraic circuits over sets of natural numbers
Discrete Applied Mathematics | 2010-08-13 | Paper |
Approximability and Hardness in Multi-objective Optimization
Programs, Proofs, Processes | 2010-07-29 | Paper |
Equivalence problems for circuits over sets of natural numbers
Theory of Computing Systems | 2010-03-05 | Paper |
Machines that can output empty words
Theory of Computing Systems | 2009-08-06 | Paper |
THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS
International Journal of Foundations of Computer Science | 2009-06-30 | Paper |
Non-mitotic sets
Theoretical Computer Science | 2009-05-28 | Paper |
The Fault Tolerance of NP-Hard Problems
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy
Developments in Language Theory | 2009-03-26 | Paper |
The Informational Content of Canonical Disjoint NP-Pairs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Multiobjective Disk Cover Admits a PTAS
Algorithms and Computation | 2009-01-29 | Paper |
Space-Efficient Informational Redundancy
Algorithms and Computation | 2009-01-29 | Paper |
The complexity of unions of disjoint sets
Journal of Computer and System Sciences | 2008-11-19 | Paper |
Splitting NP-Complete Sets
SIAM Journal on Computing | 2008-10-28 | Paper |
The Shrinking Property for NP and coNP
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Equivalence Problems for Circuits over Sets of Natural Numbers
Computer Science – Theory and Applications | 2008-06-03 | Paper |
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Non-mitotic Sets
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Languages of dot-depth 3/2
Theory of Computing Systems | 2008-04-03 | Paper |
Redundancy in Complete Sets
STACS 2006 | 2008-03-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Machines that Can Output Empty Words
Lecture Notes in Computer Science | 2007-09-05 | Paper |
The Complexity of Unions of Disjoint Sets
STACS 2007 | 2007-09-03 | Paper |
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Properties of NP‐Complete Sets
SIAM Journal on Computing | 2007-05-03 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science | 2007-02-26 | Paper |
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences | 2007-01-22 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences | 2006-10-05 | Paper |
Generation problems
Theoretical Computer Science | 2005-12-06 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Reductions between disjoint NP-pairs
Information and Computation | 2005-09-02 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics | 2005-05-04 | Paper |
Disjoint NP-Pairs
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2087228 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080228 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1747443 (Why is no real title available?) | 2002-08-05 | Paper |
| scientific article; zbMATH DE number 1500543 (Why is no real title available?) | 2000-09-04 | Paper |
