| Publication | Date of Publication | Type |
|---|
Corrigendum to: ``Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework''
Artificial Intelligence | 2023-07-26 | Paper |
| An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm | 2023-03-29 | Paper |
Learning residual alternating automata
Information and Computation | 2022-12-08 | Paper |
Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes
Lecture Notes in Computer Science | 2022-11-09 | Paper |
The generic combinatorial algorithm for image matching with classes of projective transformations
Information and Computation | 2020-12-15 | Paper |
On the universal steganography of optimal rate
Information and Computation | 2020-12-15 | Paper |
New abilities and limitations of spectral graph bisection
(available as arXiv preprint) | 2020-05-27 | Paper |
Proper learning of \(k\)-term DNF formulas from satisfying assignments
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
Artificial Intelligence | 2019-08-28 | Paper |
On the gold standard for security of universal steganography
(available as arXiv preprint) | 2018-07-09 | Paper |
| scientific article; zbMATH DE number 6861949 (Why is no real title available?) | 2018-04-19 | Paper |
Security levels in steganography -- insecurity does not imply detectability
Theoretical Computer Science | 2017-09-05 | Paper |
Algorithmic learning for steganography: proper learning of \(k\)-term DNF formulas from positive samples
Algorithms and Computation | 2016-01-11 | Paper |
A new upper bound for the traveling salesman problem in cubic graphs
Journal of Discrete Algorithms | 2014-07-07 | Paper |
Grey-box steganography
Theoretical Computer Science | 2014-01-16 | Paper |
Grey-box steganography
Lecture Notes in Computer Science | 2011-07-01 | Paper |
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Privacy in non-private environments
Theory of Computing Systems | 2011-04-01 | Paper |
One-way communication complexity of symmetric Boolean functions.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
Theoretical Computer Science | 2009-11-18 | Paper |
New lower and upper bounds for the competitive ratio of transmission protocols
Information Processing Letters | 2009-07-09 | Paper |
New Complexity Bounds for Image Matching under Rotation and Scaling
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Improving the average delay of sorting
Theoretical Computer Science | 2009-03-20 | Paper |
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Multiparty Computations in Non-private Environments
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Susceptible Two-Party Quantum Computations
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Provably Secure Steganography and the Complexity of Sampling
Algorithms and Computation | 2008-04-24 | Paper |
Revealing Additional Information in Two-Party Computations
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Improving the Average Delay of Sorting
Lecture Notes in Computer Science | 2007-11-13 | Paper |
On the Complexity of Affine Image Matching
STACS 2007 | 2007-09-03 | Paper |
Approximating schedules for dynamic process graphs efficiently
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Private computation: k-connected versus 1-connected networks
Journal of Cryptology | 2006-11-03 | Paper |
Space efficient algorithms for directed series–parallel graphs
Journal of Algorithms | 2006-10-05 | Paper |
| Privacy in Non-private Environments | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2086628 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081021 (Why is no real title available?) | 2004-08-04 | Paper |
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962807 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1942421 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1696537 (Why is no real title available?) | 2002-07-09 | Paper |
| scientific article; zbMATH DE number 1689046 (Why is no real title available?) | 2002-01-09 | Paper |
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
Computational Complexity | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1361470 (Why is no real title available?) | 2000-02-01 | Paper |
| scientific article; zbMATH DE number 1072535 (Why is no real title available?) | 1998-01-07 | Paper |
The Sublogarithmic Alternating Space World
SIAM Journal on Computing | 1997-03-03 | Paper |
On the power of 1-tape off-line ATMs running in a bounded number of reversals
Mathematical Systems Theory | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 512811 (Why is no real title available?) | 1994-11-13 | Paper |
On the relationship between deterministic time and deterministic reversal
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 17549 (Why is no real title available?) | 1992-06-26 | Paper |
Reversal Complexity Classes for Alternating Turing Machines
SIAM Journal on Computing | 1990-01-01 | Paper |
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
SIAM Journal on Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4078813 (Why is no real title available?) | 1988-01-01 | Paper |
Alternating real-time computations
Information Processing Letters | 1988-01-01 | Paper |
On reversal bounded alternating Turing machines
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3995649 (Why is no real title available?) | 1986-01-01 | Paper |
