| Ackermannian and primitive-recursive bounds with Dickson's Lemma D Figueira, S Figueira, S Schmitz, P Schnoebelen Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, 269-278, 2011 | 150 | 2011 |
| Alternating register automata on finite words and trees D Figueira Logical Methods in Computer Science (LMCS) 8 (1), 22, 2012 | 64 | 2012 |
| Satisfiability of downward XPath with data equality tests D Figueira PODS - ACM symposium on Principles of Database Systems, 197-206, 2009 | 53 | 2009 |
| Future-looking logics on data words and trees D Figueira, L Segoufin Mathematical Foundations of Computer Science 2009: 34th International …, 2009 | 53 | 2009 |
| Bottom-up automata on data trees and vertical XPath L Segoufin, D Figueira Logical Methods in Computer Science 13, 2017 | 52* | 2017 |
| Graph logics with rational relations and the generalized intersection problem P Barceló, D Figueira, L Libkin 2012 27th Annual IEEE Symposium on Logic in Computer Science, 115-124, 2012 | 44 | 2012 |
| Relating timed and register automata † D Figueira, P Hofman, S Lasota Mathematical Structures in Computer Science 26 (6), 993-1021, 2016 | 42 | 2016 |
| Reasoning on words and trees with data D Figueira École normale supérieure de Cachan-ENS Cachan, 2010 | 41 | 2010 |
| Reasoning about data repetitions with counter systems S Demri, D Figueira, M Praveen 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 33-42, 2013 | 39 | 2013 |
| Forward-XPath and extended register automata on data-trees D Figueira Proceedings of the 13th International Conference on Database Theory, 231-241, 2010 | 36 | 2010 |
| The expressive power of memory logics C Areces, D Figueira, S Figueira, S Mera The Review of Symbolic Logic 4 (2), 290-318, 2011 | 31 | 2011 |
| Path logics for querying graphs: Combining expressiveness and efficiency D Figueira, L Libkin 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 329-340, 2015 | 29 | 2015 |
| Graph logics with rational relations P Barceló, D Figueira, L Libkin Logical Methods in Computer Science 9, 2013 | 29 | 2013 |
| Decidability of downward XPath D Figueira ACM Transactions on Computational Logic (TOCL) 13 (4), 1-40, 2012 | 29 | 2012 |
| Expressive power and decidability for memory logics C Areces, D Figueira, S Figueira, S Mera WOLLIC - Workshop on Logic, Language, Information and Computation, 56-68, 2008 | 22 | 2008 |
| Model theory of XPath on data trees. Part I: Bisimulation and characterization D Figueira, S Figueira, C Areces Journal of Artificial Intelligence Research 53, 271-314, 2015 | 21 | 2015 |
| Sensitivity of counting queries M Arapinis, D Figueira, M Gaboardi International Colloquium on Automata, Languages, and Programming (ICALP), 2016 | 18 | 2016 |
| A decidable two-way logic on data words D Figueira LICS - IEEE Symposium on Logic in Computer Science (LICS), 365-374, 2011 | 18 | 2011 |
| On XPath with Transitive Axes and Data Tests D Figueira PODS - ACM symposium on Principles of Database Systems, 12, 2013 | 16 | 2013 |
| Containment of Simple Regular Path Queries D Figueira, A Godbole, S Krishna, W Martens, M Niewerth, T Trautner arXiv preprint arXiv:2003.04411, 2020 | 14 | 2020 |
Santiago FigueiraUniversity of Buenos Aires and CONICETVerified email at dc.uba.ar
