The SCEAS System
| |||||||

## Search the dblp DataBase
Olivier Serre:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Olivier Serre
**Parity Games Played on Transition Graphs of One-Counter Processes.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2006, pp:337-351 [Conf] - Christof Löding, Olivier Serre
**Propositional Dynamic Logic with Recursive Programs.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2006, pp:292-306 [Conf] - Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz
**Pushdown Games with Unboundedness and Regular Conditions.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:88-99 [Conf] - Christof Löding, P. Madhusudan, Olivier Serre
**Visibly Pushdown Games.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:408-420 [Conf] - Olivier Serre
**Games with Winning Conditions of High Borel Complexity.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:1150-1162 [Conf] - Olivier Serre
**Vectorial Languages and Linear Temporal Logic.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:576-587 [Conf] - Vince Bárány, Christof Löding, Olivier Serre
**Regularity Problems for Visibly Pushdown Languages.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:420-431 [Conf] - Olivier Serre
**Note on winning positions on pushdown games with [omega]-regular conditions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:6, pp:285-291 [Journal] - Olivier Serre
**Vectorial languages and linear temporal logic.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:79-116 [Journal] - Olivier Serre
**Games with winning conditions of high Borel complexity.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:350, n:2-3, pp:345-372 [Journal] - Christof Löding, Carsten Lutz, Olivier Serre
**Propositional dynamic logic with recursive programs.**[Citation Graph (0, 0)][DBLP] J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:51-69 [Journal] **Tree Pattern Rewriting Systems.**[Citation Graph (, )][DBLP]**Qualitative Concurrent Stochastic Games with Imperfect Information.**[Citation Graph (, )][DBLP]**µ-calculus Pushdown Module Checking with Imperfect State Information.**[Citation Graph (, )][DBLP]**Collapsible Pushdown Automata and Recursion Schemes.**[Citation Graph (, )][DBLP]**Recursion Schemes and Logical Reflection.**[Citation Graph (, )][DBLP]**Winning Regions of Higher-Order Pushdown Games.**[Citation Graph (, )][DBLP]**Qualitative Concurrent Games with Imperfect Information**[Citation Graph (, )][DBLP]
Search in 0.039secs, Finished in 0.040secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |