The Skolem Problem asks to determine whether a given integer linear
recu...
In this paper we obtain complexity bounds for computational problems on
...
Hypergeometric sequences are rational-valued sequences that satisfy
firs...
Distributional assumptions have been shown to be necessary for the robus...
We study the Escape Problem for discrete-time linear dynamical systems o...
We survey the state of the art on the algorithmic analysis of discrete l...
A fundamental problem in adversarial machine learning is to quantify how...
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...
We study fundamental reachability problems on pseudo-orbits of linear
dy...
We study the Radical Identity Testing problem (RIT): Given an algebraic
...
We investigate the Membership Problem for hypergeometric sequences: give...
We study the computational complexity of the Escape Problem for discrete...
We investigate the complexity of computing the Zariski closure of a fini...
We introduce the notion of porous invariants for multipath (or
branching...
We study a parametric version of the Kannan-Lipton Orbit Problem for lin...
We consider the problem of deciding ω-regular properties on infinite
tra...
We consider the cyclotomic identity testing (CIT) problem: given a polyn...
An infinite sequence ⟨u_n⟩_n∈ℕ of real numbers
is holonomic (also known ...
Consider a discrete dynamical system given by a square matrix M ∈ℚ^d × d...
The Skolem Problem asks, given a linear recurrence sequence (u_n), wheth...
Continuous linear dynamical systems are used extensively in mathematics,...
It is becoming increasingly important to understand the vulnerability of...
The Monniaux Problem in abstract interpretation asks, roughly speaking,
...
We exhibit an algorithm to compute the strongest algebraic (or polynomia...
We consider the Membership and the Half-space Reachability Problems for
...
We consider the problem of deciding termination of single-path while loo...
We consider the problem of determining termination of single-path loops ...
We show that the control-state reachability problem for one-dimensional
...
The Semialgebraic Orbit Problem is a fundamental reachability question t...
We study the growth behaviour of rational linear recurrence sequences. W...
It is known that Metric Temporal Logic (MTL) is strictly less expressive...
We consider Pareto analysis of reachable states of multi-priced timed
au...
The termination analysis of linear loops plays a key role in several are...
We consider the decidability of state-to-state reachability in linear
ti...
We exhibit an algorithm to compute the strongest polynomial (or algebrai...
We study the bisimilarity problem for probabilistic pushdown automata (p...
The Orbit Problem consists of determining, given a linear
transformation...