| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Concurrency Makes Simple Theories Hard | Göller, Stefan et al. | 2012 |
| 2 | On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two | Broadbent, Christopher et al. | 2012 |
| 3 | The First-Order Theory of Ground Tree Rewrite Graphs | Göller, Stefan et al. | 2011 |
| 4 | Branching-time Model Checking of One-counter Processes | Göller, Stefan et al. | 2010 |
| 5 | PDL with Intersection and Converse is 2EXP-complete | Göller, Stefan et al. | 2008 |
| Number of result pages: | 1 |
| Number of documents: | 5 |
