João Sousa Pinto

According to our database, João Sousa Pinto authored at least 8 papers between 2015 and 2024.

Collaborative distances:

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

2024

An efficient algorithm for solving linear equality-constrained LQR problems.

João Sousa Pinto, Dominique Orban

CoRR, 2024

Primal-Dual iLQR.

João Sousa Pinto, Dominique Orban

CoRR, 2024

2019

On the Decidability of Membership in Matrix-exponential Semigroups.

Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

J. ACM, 2019

On the decidability of reachability in linear time-invariant systems.

Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

2017

On the Polytope Escape Problem for Continuous Linear Dynamical Systems.

Joël Ouaknine, João Sousa Pinto, James Worrell

Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, 2017

2016

Solvability of Matrix-Exponential Equations.

Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

The Polyhedral Escape Problem is Decidable.

Joël Ouaknine, João Sousa Pinto, James Worrell

CoRR, 2015

On Termination of Integer Linear Loops.

Joël Ouaknine, João Sousa Pinto, James Worrell

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015