Carlo Comin
Orcid: 0000-0001-5748-2029
According to our database1,
Carlo Comin
authored at least 20 papers
between 2012 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks.
J. Log. Algebraic Methods Program., 2020
2018
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm.
Inf. Comput., 2018
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication.
Algorithmica, 2018
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018
2017
Complexity in Infinite Games on Graphs and Temporal Constraint Networks. (Complexité dans les Jeux Infinis sur les Graphes et les Réseaux de Contraintes Temporelles).
PhD thesis, 2017
Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games.
Constraints An Int. J., 2017
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games.
Algorithmica, 2017
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017
2016
Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games).
CoRR, 2016
Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games.
CoRR, 2016
2015
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games.
CoRR, 2015
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015
2014
Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata.
Fundam. Informaticae, 2014
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014
2013
(Extended Version) Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata
CoRR, 2013
Proceedings of the ICSOFT 2013, 2013
2012
Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata
CoRR, 2012