Filter your results
- 45
- 27
- 39
- 20
- 10
- 1
- 1
- 1
- 72
- 1
- 7
- 6
- 10
- 10
- 3
- 9
- 6
- 4
- 6
- 4
- 3
- 3
- 1
- 71
- 1
- 56
- 17
- 15
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 72
- 8
- 7
- 7
- 6
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
72 Results
|
Lower Bounds for Arithmetic Circuits via the Hankel MatrixComputational Complexity, 2021, 30 (2), ⟨10.1007/s00037-021-00214-1⟩
Journal articles
hal-03383188v1
|
||
Expressiveness of Probabilistic Modal Logics, RevisitedInternational Colloquium on Automata, Languages, and Programming, ICALP, 2017, Warrsaw, Poland. ⟨10.4230/LIPIcs.ICALP.2017.105⟩
Conference papers
hal-03410678v1
|
|||
|
A Reduction from Parity Games to Simple Stochastic GamesInternational Symposium on Games, Automata, Logics, and Formal Verification, GandALF, 2011, NA, Italy. ⟨10.4204/EPTCS.54.6⟩
Conference papers
hal-03410691v1
|
||
|
Assume-Guarantee Synthesis for Prompt Linear Temporal LogicInternational Joint Conference on Artificial Intelligence, IJCAI, 2020, NA, France. ⟨10.24963/ijcai.2020/17⟩
Conference papers
hal-03410674v1
|
||
Profinite Techniques for Probabilistic AutomataBulletin of the EATCS, 2017, 122
Journal articles
hal-03410677v1
|
|||
|
Counting and Randomising in Automata TheoryComputer Science and Game Theory [cs.GT]. Université Paris Diderot - Paris 7; Université de Varsovie (Pologne), 2015. English. ⟨NNT : ⟩
Theses
tel-03720617v1
|
||
|
The Game of SynthesisComputer Science and Game Theory [cs.GT]. Université de Bordeaux, 2022
Habilitation à diriger des recherches
tel-03720575v1
|
||
Cost-Parity and Cost-Streett GamesFoundations of Software Technology and Theoretical Computer Science, FSTTCS, 2012, NA, India. ⟨10.4230/LIPIcs.FSTTCS.2012.124⟩
Conference papers
hal-03410690v1
|
|||
|
ACME: Automata with Counters, Monoids and EquivalenceATVA, 2014, Sydney, Australia. pp.163-167, ⟨10.1007/978-3-319-11936-6_12⟩
Conference papers
hal-02101510v1
|
||
|
Timed Comparisons of Semi-Markov ProcessesLATA, Apr 2018, Tel Aviv, Israel. pp.271-283, ⟨10.1007/978-3-319-77313-1_21⟩
Conference papers
hal-02504883v1
|
||
|
Characterisation of an Algebraic Algorithm for Probabilistic Automata Characterisation of an Algebraic Algorithm for Probabilistic AutomataSTACS, Symposium on Theoretical Aspects of Computer Science, Feb 2016, Orléans, France
Conference papers
hal-01102610v3
|
||
|
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩
Conference papers
hal-03800510v1
|
||
New Algorithms for Combinations of Objectives using Separating AutomataInternational Symposium on Games, Automata, Logics, and Formal Verification, GandALF, 2021, NA, Italy
Conference papers
hal-03410670v1
|
|||
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⟩
Conference papers
hal-03410683v1
|
|||
L'avènement de la synthèse de programmesInterstices, 2022
Journal articles
hal-03410668v1
|
|||
|
Trace Refinement in Labelled Markov Decision ProcessesLogical Methods in Computer Science, 2020, 16 (2), ⟨10.23638/LMCS-16(2:10)2020⟩
Journal articles
hal-02503354v1
|
||
|
A Robust Class of Linear Recurrence SequencesCSL, 2020, Barcelona, Spain
Conference papers
hal-02395766v1
|
||
Infinite-state Games with Finitary ConditionsComputer Science in Logic, CSL, 2013, NA, Italy. ⟨10.4230/LIPIcs.CSL.2013.181⟩
Conference papers
hal-03410688v1
|
|||
|
Les jeux d'accessibilité généraliséeTechnique et Science Informatiques, 2013, 32 (9-10), ⟨10.3166/tsi.32.931-949⟩
Journal articles
istex
hal-03410689v1
|
||
Monadic Second-Order Logic with Arbitrary Monadic PredicatesMathematical Foundations of Computer Science, MFCS, 2014, NA, France. ⟨10.1007/978-3-662-44522-8\_24⟩
Conference papers
hal-03410686v1
|
|||
|
On the Monniaux Problem in Abstract InterpretationSAS, 2019, Porto, Portugal
Conference papers
hal-02395773v1
|
||
|
Probabilistic automata of bounded ambiguityInformation and Computation, 2022, 282, pp.104648. ⟨10.1016/j.ic.2020.104648⟩
Journal articles
hal-03800467v1
|
||
Public and Private Affairs in Strategic Reasoning19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}, Jul 2022, Haifa, Israel. pp.132-140, ⟨10.24963/kr.2022/14⟩
Conference papers
hal-03775036v1
|
|||
|
Lower Bounds for Alternating Online State Complexity2016
Preprints, Working Papers, ...
hal-01340607v2
|
||
|
Stamina: Stabilisation Monoids IN Automata theoryCIAA - International Conference on Implementation and Application of Automata, 2017, Marne-la-Vallée, France
Conference papers
hal-01891164v1
|
||
|
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity gamesSODA, Jan 2019, San Diego, United States
Conference papers
hal-02395778v1
|
||
|
Statistical Comparison of Algorithm Performance Through Instance SelectionInternational Conference on Principles and Practice of Constraint Programming (CP 2021), Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.43⟩
Conference papers
hal-03800492v1
|
||
|
Cost-Parity and Cost-Streett GamesLogical Methods in Computer Science, 2014, 10 (2), ⟨10.2168/LMCS-10(2:14)2014⟩
Journal articles
hal-03410687v1
|
||
|
Deciding the value 1 problem for probabilistic leaktight automataLogical Methods in Computer Science, 2015, pp.37. ⟨10.2168/LMCS-2014-994⟩
Journal articles
hal-01140262v1
|
||
|
The surprizing complexity of generalized reachability games2010
Preprints, Working Papers, ...
hal-00525762v2
|