First-order query evaluation on structures of bounded degree by Wojciech Kazana, Luc Segoufin

Get full text

First-order queries on classes of structures with bounded expansion by Wojtek Kazana, Luc Segoufin

Get full text

A decidable characterization of locally testable tree languages by Thomas Place, Luc Segoufin

Get full text

Bottom-up automata on data trees and vertical XPath by Diego Figueira, Luc Segoufin

Get full text

Tree Languages Defined in First-Order Logic with One Quantifier Alternation by Mikolaj Bojanczyk, Luc Segoufin

Get full text

Deciding definability in FO2(<h,<v) on trees by Thomas Place, Luc Segoufin

Get full text

Unary negation by Luc Segoufin, Balder ten Cate

Get full text

Tameness and the power of programs over monoids in DA by Nathan Grosshans, Pierre Mckenzie, Luc Segoufin

Get full text

FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems by Florent Jacquemard, Luc Segoufin, Jerémie Dimino

Get full text

Piecewise testable tree languages by Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing

Get full text

Datalog Rewritings of Regular Path Queries using Views by Nadime Francis, Luc Segoufin, Cristina Sirangelo

Get full text

Enumerating Answers to First-Order Queries over Databases of Low Degree by Arnaud Durand, Nicole Schweikardt, Luc Segoufin

Get full text