| Publication | Date of Publication | Type |
|---|
Mathematical foundations of computer science. Mathematical thinking and proof -- an introduction
| 2024-02-06 | Paper |
On monotonous oracle machines
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Reductions to sets of low information content (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Experimental comparison of the two Fredman-Khachiyan-algorithms
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
The model checking fingerprints of CTL operators
Acta Informatica | 2019-08-13 | Paper |
Complexity of model checking for logics over Kripke models
| 2018-09-04 | Paper |
Optimal non-approximability of MaxClique
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
On the complexity of bribery and manipulation in tournaments with uncertain information
Journal of Applied Logic | 2015-12-23 | Paper |
Complexity of finite-horizon Markov decision process problems
Journal of the ACM | 2015-12-17 | Paper |
Mathematische Grundlagen der Informatik
| 2015-10-27 | Paper |
The tractability of model checking for LTL: the good, the bad, and the ugly fragments
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The complexity of primal logic with disjunction
Information Processing Letters | 2015-04-02 | Paper |
The tractability of model-checking for LTL: the good, the bad, and the ugly fragments
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic
Computational Complexity | 2014-11-26 | Paper |
Undecidability of multi-modal hybrid logics
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
Intuitionistic implication makes model checking hard
Logical Methods in Computer Science | 2012-05-16 | Paper |
The model checking problem for propositional intuitionistic logic with one variable is \(\text{AC}^1\)-complete
| 2012-01-23 | Paper |
How to apply SAT-solving for the equivalence test of monotone normal forms
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Mathematical foundations of computer science. Mathematical thinking and proving. An introduction.
| 2011-04-26 | Paper |
Complexity of hybrid logics over transitive frames
Journal of Applied Logic | 2011-03-22 | Paper |
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
Lecture Notes in Computer Science | 2010-08-31 | Paper |
The complexity of hybrid logics over equivalence relations
Journal of Logic, Language and Information | 2010-01-06 | Paper |
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation | 2008-08-22 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
scientific article; zbMATH DE number 5039778 (Why is no real title available?)
| 2006-07-11 | Paper |
scientific article; zbMATH DE number 2166294 (Why is no real title available?)
| 2005-05-06 | Paper |
The complexity of optimal small policies
Mathematics of Operations Research | 2001-11-26 | Paper |
Nonapproximability results for partially observable Markov decision processes
The Journal of Artificial Intelligence Research (JAIR) | 2001-06-18 | Paper |
scientific article; zbMATH DE number 1361472 (Why is no real title available?)
| 2000-11-08 | Paper |
scientific article; zbMATH DE number 1500525 (Why is no real title available?)
| 2000-09-04 | Paper |
On hard instances
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1404756 (Why is no real title available?)
| 2000-02-22 | Paper |
scientific article; zbMATH DE number 1361500 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1333601 (Why is no real title available?)
| 1999-09-19 | Paper |
scientific article; zbMATH DE number 1335900 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1318517 (Why is no real title available?)
| 1999-08-08 | Paper |
scientific article; zbMATH DE number 1301107 (Why is no real title available?)
| 1999-06-15 | Paper |
scientific article; zbMATH DE number 1216123 (Why is no real title available?)
| 1998-10-28 | Paper |
Monotonous and randomized reductions to sparse sets
RAIRO - Theoretical Informatics and Applications | 1997-04-29 | Paper |
Upper bounds for the complexity of sparse and tally descriptions
Mathematical Systems Theory | 1996-02-20 | Paper |
scientific article; zbMATH DE number 512798 (Why is no real title available?)
| 1994-03-10 | Paper |
Random languages for nonuniform complexity classes
Journal of Complexity | 1992-06-26 | Paper |
