| 2013 | ||
|---|---|---|
| c8 | Vince Bárány, Michael Benedikt, Pierre Bourhis: Access patterns and integrity constraints revisited. ICDT 2013: 213-224 | |
| 2012 | ||
| j6 | Vince Bárány, Mikolaj Bojanczyk: Finite satisfiability for guarded fixpoint logic. Inf. Process. Lett. 112(10): 371-375 (2012) | |
| j5 | Vince Bárány, Balder ten Cate, Martin Otto: Queries with Guarded Negation. PVLDB 5(11): 1328-1339 (2012) | |
| c7 | Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys: Decidable classes of documents for XPath. FSTTCS 2012: 99-111 | |
| i3 | Vince Bárány, Balder ten Cate, Martin Otto: Queries with Guarded Negation (full version). CoRR abs/1203.0077 (2012) | |
| 2011 | ||
| j4 | Vince Bárány, Lukasz Kaiser, Alexander Rabinovich: Expressing cardinality quantifiers in monadic second-order logic over chains. J. Symb. Log. 76(2): 603-619 (2011) | |
| c6 | ||
| i2 | Vince Bárány, Mikolaj Bojanczyk: Finite Satisfiability for Guarded Fixpoint Logic. CoRR abs/1104.2262 (2011) | |
| 2010 | ||
| j3 | Vince Bárány, Lukasz Kaiser, Alexander Moshe Rabinovich: Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. Fundam. Inform. 100(1-4): 1-17 (2010) | |
| c5 | ||
| 2009 | ||
| j2 | ||
| c4 | Vince Bárány, Lukasz Kaiser, Alexander Rabinovich: Cardinality Quantifiers in MLO over Trees. CSL 2009: 117-131 | |
| 2008 | ||
| j1 | Vince Bárány: A Hierarchy of Automatic $\omega$-Words having a Decidable MSO Theory. ITA 42(3): 417-450 (2008) | |
| c3 | Lukasz Kaiser, Sasha Rubin, Vince Bárány: Cardinality and counting quantifiers on omega-automatic structures. STACS 2008: 385-396 | |
| i1 | Lukasz Kaiser, Sasha Rubin, Vince Bárány: Cardinality and counting quantifiers on omega-automatic structures. CoRR abs/0802.2866 (2008) | |
| 2007 | ||
| b1 | Vince Bárány: Automatic presentations of infinite structures. RWTH Aachen University 2007, pp. 1-146 | |
| 2006 | ||
| c2 | Vince Bárány: Invariants of Automatic Presentations and Semi-synchronous Transductions. STACS 2006: 289-300 | |
| c1 | Vince Bárány, Christof Löding, Olivier Serre: Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431 | |
Data released under the ODC-BY 1.0 license — See also our legal information page