Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

The Taming of the Semi-Linear Set

- D. Chistikov, C. Haase
- Computer Science
- ICALP
- 2016

Semi-linear sets, which are rational subsets of the monoid (Z^d,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas in… Expand

The complexity of regular abstractions of one-counter languages

- Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
- Computer Science, Mathematics
- 31st Annual ACM/IEEE Symposium on Logic in…
- 10 February 2016

We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) $\mathcal{A}$, construct a nondeterministic finite automaton (NFA)… Expand

Approximate counting in SMT and value estimation for probabilistic programs

- D. Chistikov, R. Dimitrova, R. Majumdar
- Computer Science, Mathematics
- Acta Informatica
- 3 November 2014

Abstract#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the… Expand

Approximate Counting in SMT and Value Estimation for Probabilistic Programs

- Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar
- Computer Science
- TACAS
- 11 April 2015

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume… Expand

Asymmetric Distances for Approximate Differential Privacy

- D. Chistikov, A. Murawski, D. Purser
- Computer Science
- CONCUR
- 20 August 2019

Differential privacy is a widely studied notion of privacy for various models of computation, based on measuring differences between probability distributions. We consider… Expand

Bisimilarity Distances for Approximate Differential Privacy

- D. Chistikov, A. Murawski, D. Purser
- Computer Science, Mathematics
- ATVA
- 26 July 2018

Differential privacy is a widely studied notion of privacy for various models of computation. Technically, it is based on measuring differences between probability distributions. We study \(\epsilon… Expand

O-Minimal Invariants for Linear Loops

- Shaull Almagor, D. Chistikov, J. Ouaknine, J. Worrell
- Computer Science, Mathematics
- ICALP
- 1 February 2018

The termination analysis of linear loops plays a key role in several areas of computer science, including program verification and abstract interpretation. Such deceptively simple questions also… Expand

Nonnegative Matrix Factorization Requires Irrationality

- D. Chistikov, S. Kiefer, Ines Marusic, M. Shirmohammadi, J. Worrell
- Computer Science, Mathematics
- SIAM J. Appl. Algebra Geom.
- 22 May 2016

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$… Expand

On Rationality of Nonnegative Matrix Factorization

- D. Chistikov, S. Kiefer, Ines Marusic, M. Shirmohammadi, J. Worrell
- Mathematics, Computer Science
- SODA
- 16 January 2017

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n × d matrix W and a nonnegative d × m matrix H. NMF has a wide… Expand

Context-Free Commutative Grammars with Integer Counters and Resets

- Dmitry Chistikov, Christoph Haase, Simon Halfon
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 16 November 2015

We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those… Expand