We study the computational complexity of a robust version of the problem...
We study the Escape Problem for discrete-time linear dynamical systems o...
We study the computational complexity of the Escape Problem for discrete...
In the author's PhD thesis (2019) universal envelopes were introduced as...
We study the decidability of the Skolem Problem, the Positivity Problem,...
We give a technical overview of our exact-real implementation of various...
We extend the framework for complexity of operators in analysis devised ...
We show that the Fréchet distance of two-dimensional parametrised surfac...
We show that the Fréchet distance of two-dimensional parametrised surfac...
A famous result due to Ko and Friedman (1982) asserts that the problems ...