Tomás Kolárik

Orcid: 0000-0002-7207-5197

According to our database1, Tomás Kolárik authored at least 9 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Arithmetic Over the Reals.
SN Comput. Sci., February, 2026

Parallel SMT Solving via Iterative Tree Partitioning.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

Formally Explaining Neural Network Classification.
Proceedings of the Formal Methods - 27th International Symposium, 2026

Interpreting Logical Explanations of Classifying Neural Networks.
Proceedings of the 34th European Symposium on Artificial Neural Networks, 2026

2025
Space Explanations of Neural Network Classification.
Proceedings of the Computer Aided Verification - 37th International Conference, 2025

2024
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
Railway Scheduling Using Boolean Satisfiability Modulo Simulations.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2020
SAT Modulo Differential Equation Simulations.
Proceedings of the Tests and Proofs - 14th International Conference, 2020

2018
Suppressing external visual distractors from driver's field of view.
Proceedings of the 9th IEEE International Conference on Cognitive Infocommunications, 2018


  Loading...