• Publications
  • Influence
The Taming of the Semi-Linear Set
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 inExpand
  • 28
  • 3
The complexity of regular abstractions of one-counter languages
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
  • 8
  • 2
Approximate counting in SMT and value estimation for probabilistic programs
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 theExpand
  • 51
  • 1
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
#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 volumeExpand
  • 12
  • 1
Asymmetric Distances for Approximate Differential Privacy
Differential privacy is a widely studied notion of privacy for various models of computation, based on measuring differences between probability distributions. We considerExpand
  • 10
  • 1
Bisimilarity Distances for Approximate Differential Privacy
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 \(\epsilonExpand
  • 9
  • 1
O-Minimal Invariants for Linear Loops
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 alsoExpand
  • 7
  • 1
Nonnegative Matrix Factorization Requires Irrationality
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
  • 12
  • 1
On Rationality of Nonnegative Matrix Factorization
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 wideExpand
  • 4
  • 1
Context-Free Commutative Grammars with Integer Counters and Resets
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. ThoseExpand
  • 10