| Guarded negation V Bárány, BT Cate, L Segoufin Journal of the ACM (JACM) 62 (3), 1-26, 2015 | 174 | 2015 |
| Querying the guarded fragment V Barany, G Gottlob, M Otto Logical Methods in Computer Science 10 (2), 2014 | 160 | 2014 |
| Queries with guarded negation V Bárány, B Ten Cate, M Otto Proceedings of the VLDB Endowment 5 (11), 1328-1339, 2012 | 83 | 2012 |
| Rewriting guarded negation queries V Bárány, M Benedikt, B Ten Cate International Symposium on Mathematical Foundations of Computer Science, 98-110, 2013 | 66 | 2013 |
| Regularity problems for visibly pushdown languages V Bárány, C Löding, O Serre STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006 | 62 | 2006 |
| Declarative probabilistic programming with datalog V Bárány, B Cate, B Kimelfeld, D Olteanu, Z Vagena ACM Transactions on Database Systems (TODS) 42 (4), 1-35, 2017 | 47 | 2017 |
| Automata-based presentations of infinite structures V Bárány, E Grädel, S Rubin Finite and algorithmic model theory - London Mathematical Society Lecture …, 2011 | 38 | 2011 |
| Cardinality and counting quantifiers on omega-automatic structures L Kaiser, S Rubin, V Bárány STACS 2008, 2008 | 37 | 2008 |
| Automatic Presentations of Infinite Structures V Barany RWTH Aachen, 2007 | 35 | 2007 |
| Finite satisfiability for guarded fixpoint logic V Bárány, M Bojańczyk Information Processing Letters 112 (10), 371-375, 2012 | 30 | 2012 |
| Some model theory of guarded negation V Bárány, M Benedikt, B Ten Cate The Journal of Symbolic Logic 83 (4), 1307-1344, 2018 | 24 | 2018 |
| Expressing cardinality quantifiers in monadic second-order logic over trees V Bárány, Ł Kaiser, A Rabinovich Fundamenta Informaticae 100 (1-4), 1-17, 2010 | 23 | 2010 |
| Access patterns and integrity constraints revisited V Bárány, M Benedikt, P Bourhis Proceedings of the 16th International Conference on Database Theory, 213-224, 2013 | 22 | 2013 |
| Invariants of automatic presentations and semi-synchronous transductions V Bárány Annual Symposium on Theoretical Aspects of Computer Science, 289-300, 2006 | 22 | 2006 |
| A hierarchy of automatic ω-words having a decidable MSO theory V Bárány RAIRO-Theoretical Informatics and Applications 42 (3), 417-450, 2008 | 20* | 2008 |
| Cardinality quantifiers in MLO over trees V Bárány, Ł Kaiser, A Rabinovich International Workshop on Computer Science Logic, 117-131, 2009 | 16 | 2009 |
| Declarative statistical modeling with Datalog V Barany, B Cate, B Kimelfeld, D Olteanu, Z Vagena arXiv preprint arXiv:1412.2221, 2014 | 8 | 2014 |
| Expressing cardinality quantifiers in monadic second-order logic over chains V Bárány, Ł Kaiser, A Rabinovich Journal of Symbolic Logic 76 (2), 603-619, 2011 | 8 | 2011 |
| Decidable classes of documents for XPath V Bárány, M Bojańczyk, D Figueira, P Parys IARCS Annual Conference on Foundations of Software Technology and …, 2012 | 6 | 2012 |
| Semi-synchronous transductions V Bárány Acta informatica 46 (1), 29-42, 2009 | 3 | 2009 |
Balder ten CateAssociate Professor確認したメール アドレス: uva.nl