| Visibly pushdown transducers JF Raskin, F Servais International Colloquium on Automata, Languages, and Programming, 386-397, 2008 | 47 | 2008 |
| From two-way to one-way finite state transducers E Filiot, O Gauwin, PA Reynier, F Servais 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 468-477, 2013 | 45 | 2013 |
| Properties of visibly pushdown transducers E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot International Symposium on Mathematical Foundations of Computer Science, 355-367, 2010 | 41 | 2010 |
| Minimal coverability set for petri nets: Karp and miller algorithm with pruning PA Reynier, F Servais International Conference on Application and Theory of Petri Nets and …, 2011 | 36 | 2011 |
| Definability problems for graph query languages T Antonopoulos, F Neven, F Servais ICDT 2013 - 16th International Conference on Database Theory, 2013 | 24 | 2013 |
| Streamability of nested word transductions E Filiot, O Gauwin, PA Reynier, F Servais Logical Methods in Computer Science 15, 2019 | 21 | 2019 |
| Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning PA Reynier, F Servais Fundamenta Informaticae 122 (1-2), 1-30, 2013 | 20 | 2013 |
| Visibly pushdown transducers F Servais, JF Raskin ULB, Belgique, 2011 | 15 | 2011 |
| Visibly pushdown transducers with look-ahead E Filiot, F Servais International Conference on Current Trends in Theory and Practice of …, 2012 | 14 | 2012 |
| On the symbolic computation of the hardest configurations of the rush hour game S Collette, JF Raskin, F Servais Computers and Games, 220-233, 2007 | 12 | 2007 |
| Visibly pushdown transducers E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot Journal of Computer and System Sciences 97, 147-181, 2018 | 9 | 2018 |
| Distributed streaming with finite memory F Neven, N Schweikardt, F Servais, T Tan 18th International Conference on Database Theory (ICDT 2015), 2015 | 9 | 2015 |
| XEvolve: an XML schema evolution framework F Picalausa, F Servais, E Zimányi Proceedings of the 2011 ACM Symposium on Applied Computing, 1645-1650, 2011 | 8 | 2011 |
| On the computation of the minimal coverability set of Petri nets PA Reynier, F Servais Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019 | 7 | 2019 |
| On functionality of visibly pushdown transducers E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot arXiv preprint arXiv:1002.1443, 2010 | 7 | 2010 |
| Expressiveness of visibly pushdown transducers M Caralp, E Filiot, PA Reynier, F Servais, JM Talbot arXiv preprint arXiv:1311.5571, 2013 | 6 | 2013 |
| Finding hard initial configurations of Rush Hour with binary decision diagrams F Servais M. Sc. thesis, Université libre de Bruxelles, Faculté des sciences, 2005 | 6 | 2005 |
| Verifying and Testing BPEL Processes F Servais Thesis of ULB, 54-58, 2006 | 3 | 2006 |
| Finite-state map-reduce computation and relational algebra queries F Neven, N Schweikardt, F Servais, T Tan ACM Transactions on Computational Logic (TOCL) 19 (2), 1-37, 2018 | 1 | 2018 |
| Height-bounded memory visibly pushdown transductions E Filiot, O Gauwin, PA Reynier, F Servais Submitted, 2011 | 1 | 2011 |
Pierre-Alain ReynierLIS, Aix-Marseille UniversitéΗ διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα lif.univ-mrs.fr
