Filtrer vos résultats
- 24
- 2
- 18
- 7
- 1
- 26
- 1
- 2
- 5
- 3
- 5
- 5
- 1
- 4
- 1
- 26
- 26
- 3
- 2
- 1
- 1
- 1
- 26
- 10
- 9
- 6
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
26 résultats
|
|
triés par
|
|
How to Play in Infinite MDPs47th International Colloquium on Automata, Languages, and Programming (ICALP 202)0, Jul 2020, Sarrebruck, Germany. pp.3:1--3:18, ⟨10.4230/LIPIcs.ICALP.2020.3⟩
Communication dans un congrès
hal-03064669v1
|
||
|
Costs and rewards in priced timed automataInformation and Computation, 2022, 282, pp.104656. ⟨10.1016/j.ic.2020.104656⟩
Article dans une revue
hal-03861549v1
|
||
|
Coverability in 1-VASS with Disequality Tests31st International Conference on Concurrency Theory, CONCUR 2020, Aug 2020, Vienna, Austria. pp.38:1--38:20, ⟨10.4230/LIPIcs.CONCUR.2020.38⟩
Communication dans un congrès
hal-03064637v1
|
||
|
Multiplicity Problems on Algebraic Series and Context-Free Grammars2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States. pp.1-12, ⟨10.1109/LICS56636.2023.10175707⟩
Communication dans un congrès
hal-04252566v1
|
||
|
Transience in Countable MDPs32nd International Conference on Concurrency Theory, {CONCUR} 2021, Aug 2021, Virtual Conference, France
Communication dans un congrès
hal-03435906v1
|
||
|
Cyclotomic Identity Testing and ApplicationsISSAC '21: International Symposium on Symbolic and Algebraic Computation, Jul 2021, Virtual Event Russian Federation, France. pp.35-42, ⟨10.1145/3452143.3465530⟩
Communication dans un congrès
hal-03435904v1
|
||
|
On strong determinacy of countable stochastic games2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-12, ⟨10.1109/LICS.2017.8005134⟩
Communication dans un congrès
hal-02411538v1
|
||
|
The Membership Problem for Hypergeometric Sequences with Quadratic ParametersISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023, Jul 2023, Tromsø Norway, Norway. pp.407-416, ⟨10.1145/3597066.3597121⟩
Communication dans un congrès
hal-04252563v1
|
||
|
Synchronizing Automata over Nested WordsJournal of Automata Languages and Combinatorics, 2019, 24 (2-4), pp.219--251. ⟨10.25596/jalc-2019-219⟩
Article dans une revue
hal-02411524v1
|
||
On the Complexity of Value Iteration46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.102⟩
Communication dans un congrès
hal-02411530v1
|
|||
|
On Rationality of Nonnegative Matrix FactorizationProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelona, Spain. pp.1290-1305, ⟨10.1137/1.9781611974782.84⟩
Communication dans un congrès
hal-02411542v1
|
||
|
Revisiting reachability in timed automata2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-12, ⟨10.1109/LICS.2017.8005098⟩
Communication dans un congrès
hal-02411539v1
|
||
|
Strategy Complexity of Parity Objectives in Countable MDPs31st International Conference on Concurrency Theory, CONCUR 2020, Aug 2020, Vienna, Austria. pp.39:1--39:17, ⟨10.4230/LIPIcs.CONCUR.2020.39⟩
Communication dans un congrès
hal-03064654v1
|
||
Büchi Objectives in Countable MDPs46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.119⟩
Communication dans un congrès
hal-02411532v1
|
|||
|
Effective definability of the reachability relation in timed automataInformation Processing Letters, 2020, 153, pp.105871. ⟨10.1016/j.ipl.2019.105871⟩
Article dans une revue
hal-03064610v1
|
||
|
Costs and Rewards in Priced Timed Automata45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.125⟩
Communication dans un congrès
hal-02411534v1
|
||
A Beginner's Tutorial on Strategy Complexity in Stochastic GamesACM SIGLOG News, 2022, 9 (4), pp.27-43. ⟨10.1145/3583660.3583666⟩
Article dans une revue
hal-04252568v1
|
|||
|
Trace Refinement in Labelled Markov Decision ProcessesLogical Methods in Computer Science, 2020, 16 (2), ⟨10.23638/LMCS-16(2:10)2020⟩
Article dans une revue
hal-02503354v1
|
||
Trace Refinement in Labelled Markov Decision ProcessesFoundations of Software Science and Computation Structures, FoSSaCS, 2016, NA, United Kingdom. ⟨10.1007/978-3-662-49630-5\_18⟩
Communication dans un congrès
hal-03410683v1
|
|||
|
The Membership Problem for Hypergeometric Sequences with Rational ParametersISSAC '22: International Symposium on Symbolic and Algebraic Computation, Jul 2022, Villeneuve-d'Ascq France, France. pp.381-389, ⟨10.1145/3476446.3535504⟩
Communication dans un congrès
hal-03861547v1
|
||
|
Identity Testing for Radical ExpressionsLICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa Israel, France. pp.1-11, ⟨10.1145/3531130.3533331⟩
Communication dans un congrès
hal-03861546v1
|
||
|
Synchronizing Data Words for Register AutomataACM Transactions on Computational Logic, 2019, 20 (2), pp.1-27. ⟨10.1145/3309760⟩
Article dans une revue
hal-02411520v1
|
||
|
Formal Modeling and Analysis of Timed SystemsSpringer International Publishing, 12860, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-85037-1⟩
Ouvrages
hal-03435905v1
|
||
|
On the Computation of the Zariski Closure of Finitely Generated Groups of MatricesProceedings of ISSAC 2022, 2022, Villeneuve-d’Ascq, France. ⟨10.1145/3476446.3536172⟩
Communication dans un congrès
hal-03450297v1
|
||
|
Parity objectives in countable MDPs2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-11, ⟨10.1109/LICS.2017.8005100⟩
Communication dans un congrès
hal-02411536v1
|
||
|
The complexity of synchronizing Markov decision processesJournal of Computer and System Sciences, 2019, 100, pp.96-129. ⟨10.1016/j.jcss.2018.09.004⟩
Article dans une revue
hal-02411525v1
|