| Publication | Date of Publication | Type |
|---|
On the power of counting the total number of computation paths of NPTMs
| 2024-11-12 | Paper |
Completeness, approximability and exponential time results for counting problems with easy decision version
Theoretical Computer Science | 2022-05-31 | Paper |
Completeness results for counting problems with easy decision
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Random walks on some basic classes of digraphs
Theoretical Aspects of Computing – ICTAC 2013 | 2013-10-04 | Paper |
Ordered coloring of grids and related graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Neochromatica.
| 2011-03-23 | Paper |
Ordered coloring grids and related graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Randomized and Approximation Algorithms for Blue-Red Matching
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Path multicoloring with fewer colors in spiders and caterpillars
Computing | 2007-11-19 | Paper |
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry | 2007-10-12 | Paper |
The Complexity of Counting Functions with Easy Decision Version
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
Computer Networks | 2005-12-07 | Paper |
scientific article; zbMATH DE number 2060762 (Why is no real title available?)
| 2004-03-18 | Paper |
Many-valued reflexive autoepistemic logic
Logic Journal of the IGPL | 2004-01-28 | Paper |
scientific article; zbMATH DE number 2011842 (Why is no real title available?)
| 2003-12-02 | Paper |
Satisfying a maximum number of pre-routed requests in all-optical rings.
Computer Networks | 2003-08-13 | Paper |
scientific article; zbMATH DE number 1953880 (Why is no real title available?)
| 2003-07-28 | Paper |
Routing and path multicoloring
Information Processing Letters | 2002-07-25 | Paper |
Probabilistic quantifiers and games
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Does co-NP have short interactive proofs ?
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4057011 (Why is no real title available?)
| 1987-01-01 | Paper |
A decisive characterization of BPP
Information and Control | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4027449 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3943795 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3880118 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3799016 (Why is no real title available?)
| 1982-01-01 | Paper |
Robustness of probabilistic computational complexity classes under definitional perturbations
Information and Control | 1982-01-01 | Paper |
