Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hugo Gimbert
2010 – today
- 2012
[j4]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert: On Subgame Perfection in Quantitative Reachability Games. Logical Methods in Computer Science 9(1) (2012)
[j3]Hugo Gimbert, Wieslaw Zielonka: Blackwell Optimal Strategies in Priority mean-Payoff Games. Int. J. Found. Comput. Sci. 23(3): 687-711 (2012)
[c18]Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert: Subgame Perfection for Equilibria in Quantitative Reachability Games. FoSSaCS 2012: 286-300
[c17]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj: Deciding the Value 1 Problem for Probabilistic Leaktight Automata. LICS 2012: 295-304
[i6]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz: Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012)- 2011
[i5]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj: Pushing undecidability of the isolation problem for probabilistic automata. CoRR abs/1104.3054 (2011)
[i4]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj: A Class of Probabilistic Automata with a Decidable Value 1 Problem. CoRR abs/1104.3055 (2011)- 2010
[c16]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63
[c15]Hugo Gimbert, Youssouf Oualhadj: Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. ICALP (2) 2010: 527-538
[c14]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. MFCS 2010: 246-257
[c13]
[c12]Hugo Gimbert, Wieslaw Zielonka: Blackwell-Optimal Strategies in Priority Mean-Payoff Games. GANDALF 2010: 7-21
[i3]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. CoRR abs/1006.0673 (2010)
2000 – 2009
- 2009
[j2]
[c11]Nathalie Bertrand, Blaise Genest, Hugo Gimbert: Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009: 319-328- 2008
[c10]Hugo Gimbert, Wieslaw Zielonka: Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. Logic and Automata 2008: 331-356
[c9]
[c8]Hugo Gimbert, Florian Horn: Simple Stochastic Games with Few Random Vertices Are Easy to Solve. FoSSaCS 2008: 5-19
[i2]Nathalie Bertrand, Blaise Genest, Hugo Gimbert: Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides. CoRR abs/0811.3975 (2008)
[i1]Florian Horn, Hugo Gimbert: Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions. CoRR abs/0811.3978 (2008)- 2007
[c7]
[c6]Hugo Gimbert, Wieslaw Zielonka: Limits of Multi-Discounted Markov Decision Processes. LICS 2007: 89-98
[c5]- 2006
[c4]Hugo Gimbert, Wieslaw Zielonka: Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. ICALP (2) 2006: 312-323- 2005
[j1]Hugo Gimbert, Wieslaw Zielonka: Discounting Infinite Games But How and Why? Electr. Notes Theor. Comput. Sci. 119(1): 3-9 (2005)
[c3]Hugo Gimbert, Wieslaw Zielonka: Games Where You Can Play Optimally Without Any Memory. CONCUR 2005: 428-442- 2004
[c2]
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-05 19:37 CET by the dblp team



