Julian D'Costa

According to our database, Julian D'Costa authored at least 7 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Nonnegativity Problems for Matrix Semigroups.

Julian D'Costa, Joël Ouaknine, James Worrell

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems.

Julian D'Costa, Toghrul Karimov, Joël Ouaknine, Mahmoud Salamati, James Worrell

CoRR, 2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set.

Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems.

Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets.

Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Pseudo-Skolem Problem is Decidable.

Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

How Fast Can You Escape a Compact Polytope?

Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020