The following pages link to Olivier Serre (Q456182):
Displaying 31 items.
- Parity games on undirected graphs (Q456183) (← links)
- Counting branches in trees using games (Q729823) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- Vectorial languages and linear temporal logic (Q1884965) (← links)
- Pushdown module checking with imperfect information (Q1951589) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Higher-order recursion schemes and their automata models (Q2244830) (← links)
- Two-way two-tape automata (Q2408799) (← links)
- Marking shortest paths on pushdown graphs does not preserve MSO decidability (Q2629775) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Randomization in Automata on Infinite Trees (Q2946733) (← links)
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information (Q2963922) (← links)
- Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (Q2986793) (← links)
- A Saturation Method for Collapsible Pushdown Systems (Q3167009) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- Qualitative Concurrent Stochastic Games with Imperfect Information (Q3638096) (← links)
- Streaming Property Testing of Visibly Pushdown Languages * (Q4606314) (← links)
- How Good Is a Strategy in a Game with Nature? (Q4635840) (← links)
- Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings (Q4635878) (← links)
- Pure Strategies in Imperfect Information Stochastic Games (Q4692115) (← links)
- How Good Is a Strategy in a Game with Nature? (Q5121272) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191508) (← links)
- C-SHORe (Q5244783) (← links)
- Erratum for “Randomization in Automata on Infinite Trees” (Q5277901) (← links)
- Regularity Problems for Visibly Pushdown Languages (Q5449818) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465872) (← links)
- Automata, Languages and Programming (Q5466545) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q5874295) (← links)
- Foundations of Software Science and Computation Structures (Q5899095) (← links)
- Foundations of Software Science and Computation Structures (Q5899098) (← links)
