Maciej Liskiewicz

CoRR, 2024

Probabilistic and Causal Satisfiability: the Impact of Marginalization.

[BibT_eX]

[DOI]

Julian Dörfler

CoRR, 2024

The Existential Theory of the Reals with Summation Operators.

[BibT_eX]

[DOI]

Julian Dörfler

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40].

[BibT_eX]

[DOI]

Artif. Intell., August, 2023

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

The Hardness of Reasoning about Probabilities and Causality.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

"Act natural!": Exchanging Private Messages on Public Blockchains.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

Practical Algorithms for Orientations of Partially Directed Graphical Models.

[BibT_eX]

[DOI]

Malte Luttermann

Proceedings of the Conference on Causal Learning and Reasoning, 2023

Efficient Enumeration of Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Finding Front-Door Adjustment Sets in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2022

A new constructive criterion for Markov equivalence of MAGs.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Identification in Tree-shaped Linear Structural Causal Models.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

A White-Box Masking Scheme Resisting Computational and Algebraic Attacks.

[BibT_eX]

[DOI]

Okan Seker

Thomas Eisenbarth

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

"Act natural!": Having a Private Chat on a Public Blockchain.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Extendability of causal graphical models: Algorithms and computational complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm.

[BibT_eX]

[DOI]

Proceedings of the KI 2021: Advances in Artificial Intelligence - 44th German Conference on AI, Virtual Event, September 27, 2021

Recent Advances in Counting and Sampling Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the KI 2021: Advances in Artificial Intelligence - 44th German Conference on AI, Virtual Event, September 27, 2021

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The generic combinatorial algorithm for image matching with classes of projective transformations.

[BibT_eX]

[DOI]

Christian Rosenke

Inf. Comput., 2020

On the universal steganography of optimal rate.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Recovering Causal Structures from Low-Order Conditional Independencies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Proper learning of <i>k</i>-term DNF formulas from satisfying assignments.

[BibT_eX]

[DOI]

Matthias Lutter

J. Comput. Syst. Sci., 2019

Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework.

[BibT_eX]

[DOI]

Artif. Intell., 2019

Finding Minimal d-separators in Linear Time and Applications.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

2018

On the Gold Standard for Security of Universal Steganography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2017

Security levels in steganography - Insecurity does not imply detectability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Proper Learning of k-term DNF Formulas from Satisfying Assignments.

[BibT_eX]

[DOI]

Matthias Lutter

Electron. Colloquium Comput. Complex., 2017

Learning Residual Alternating Automata.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Abilities and Limitations of Spectral Graph Bisection.

[BibT_eX]

[DOI]

CoRR, 2017

New Abilities and Limitations of Spectral Graph Bisection.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Algorithm Substitution Attacks from a Steganographic Perspective.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Hard Communication Channels for Steganography.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security, 2016

On Searching for Generalized Instrumental Variables.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Separators and Adjustment Sets in Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Learning from Pairwise Marginal Independencies.

[BibT_eX]

[DOI]

Alexander Idelberger

Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.

[BibT_eX]

[DOI]

Matthias Ernst

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Efficiently Finding Conditional Instruments for Causal Inference.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

A new upper bound for the traveling salesman problem in cubic graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Constructing Separators and Adjustment Sets in Ancestral Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

A generic finite automata based approach to implementing lymphocyte repertoire models.

[BibT_eX]

[DOI]

Katharina Dannenberg

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals.

[BibT_eX]

[DOI]

Alexander Idelberger

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Grey-box steganography.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Improved Analysis of an Exact Algorithm for Cubic Graph TSP

[BibT_eX]

[DOI]

CoRR, 2012

2011

New complexity bounds for image matching under rotation and scaling.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective.

[BibT_eX]

[DOI]

Proceedings of the UAI 2011, 2011

2010

Negative selection algorithms without generating detectors.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009

Improving the average delay of sorting.

[BibT_eX]

[DOI]

Christian Schindelhauer

Theor. Comput. Sci., 2009

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation.

[BibT_eX]

[DOI]

Ragnar Nevries

Theor. Comput. Sci., 2009

2008

Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Susceptible Two-Party Quantum Computations.

[BibT_eX]

[DOI]

Aleksander Madry

Proceedings of the Information Theoretic Security, Third International Conference, 2008

Two-Dimensional Pattern Matching with Combined Scaling and Rotation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Preface.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

A Combinatorial Geometric Approach to Linear Image Matching.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

On the Complexity of Affine Image Matching.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.

[BibT_eX]

[DOI]

Aleksander Madry

Electron. Colloquium Comput. Complex., 2006

Provably Secure Steganography and the Complexity of Sampling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Multiparty Computations in Non-private Environments.

[BibT_eX]

[DOI]

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

On the Intractability of Inverting Geometric Distortions in Watermarking Schemes.

[BibT_eX]

[DOI]

Proceedings of the Information Hiding, 7th International Workshop, 2005

Revealing Additional Information in Two-Party Computations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Approximating schedules for dynamic process graphs efficiently.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

New lower and upper bounds for the competitive ratio of transmission protocols.

[BibT_eX]

[DOI]

Bodo Manthey

Inf. Process. Lett., 2004

Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity.

[BibT_eX]

[DOI]

Hemant J. Purohit

Dhananjay V. Raje

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.

[BibT_eX]

[DOI]

Mitsunori Ogihara

Seinosuke Toda

Theor. Comput. Sci., 2003

One-Way Communication Complexity of Symmetric Boolean Functions

[BibT_eX]

[DOI]

Jan Arpe

Electron. Colloquium Comput. Complex., 2003

Privacy in Non-Private Environments

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Private Computation - k-connected versus 1-connected Networks

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Private Computations in Networks: Topology versus Randomness.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Space Efficient Algorithms for Directed Series-Parallel Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Paths Problems in Symmetric Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Dynamic Process Graphs and the Complexity of Scheduling

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Space Efficient Algorithms for Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

The Complexity of Some Basic Problems for Dynamic Process Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

The Expressive Power and Complexity of Dynamic Process Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.

[BibT_eX]

[DOI]

Comput. Complex., 1999

Scheduling Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

1997

Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

The Sublogarithmic Alternating Space World.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

1995

On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

1994

The Complexity World below Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

On the Relationship Between Deterministic Time and Deterministic Reversal.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Separating the Lower Levels of the Sublogarithmic Space Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

1990

Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Reversal Complexity Classes for Alternating Turing Machines.

[BibT_eX]

[DOI]

Miroslaw Kutylowski

SIAM J. Comput., 1990

1989

On Reversal Complexity for Alternating Turing Machines (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Some Time-Space Bounds for One-Tape Deterministic Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Alternating Real-Time Computations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

On Reversal Bounded Alternating Turing Machines.

[BibT_eX]

[DOI]