| Publication | Date of Publication | Type |
|---|
| On the complexity of \(k\)-DQBF | 2024-11-26 | Paper |
On two-variable guarded fragment logic with expressive local Presburger constraints
Logical Methods in Computer Science | 2024-09-04 | Paper |
Two variable logic with ultimately periodic counting
SIAM Journal on Computing | 2024-07-17 | Paper |
scientific article; zbMATH DE number 7799614 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
A simple combinatorial proof for the small model property of two-variable logic
Information Processing Letters | 2021-06-16 | Paper |
Subsequence versus substring constraints in sequence pattern languages
Acta Informatica | 2021-04-28 | Paper |
| Register automata with linear arithmetic | 2021-01-19 | Paper |
Register automata with linear arithmetic
(available as arXiv preprint) | 2021-01-19 | Paper |
Finite-State Map-Reduce Computation and Relational Algebra Queries
ACM Transactions on Computational Logic | 2018-08-20 | Paper |
A note on first-order spectra with binary relations
(available as arXiv preprint) | 2018-05-30 | Paper |
| Distributed streaming with finite memory | 2017-06-13 | Paper |
An automata model for trees with ordered data values
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
On the variable hierarchy of first-order spectra
ACM Transactions on Computational Logic | 2017-01-27 | Paper |
Graph reachability and pebble automata over infinite alphabets
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Regular expressions for data words
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Regular graphs and the spectra of two-variable logic with counting
SIAM Journal on Computing | 2015-06-24 | Paper |
Regular expressions for querying data graphs
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
Regular expressions with binding over data words for querying graph databases
Developments in Language Theory | 2013-06-28 | Paper |
Feasible automata for two-variable logic with successor on data words
Language and Automata Theory and Applications | 2012-06-08 | Paper |
On the satisfiability of two-variable logic over data words
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences | 2010-10-07 | Paper |
A note on two-pebble automata over infinite alphabets
Fundamenta Informaticae | 2010-05-25 | Paper |
On Pebble Automata for Data Languages with Decidable Emptiness Problem
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Tree Automata over Infinite Alphabets
Pillars of Computer Science | 2008-03-25 | Paper |
Approximating polyhedral objects with deformable smooth surfaces
Computational Geometry | 2007-12-03 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| Regular expressions for languages over infinite alphabets | 2006-06-19 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Two variable logic with ultimately periodic counting
(available as arXiv preprint) | N/A | Paper |
