Decomate: Unified Access to Globally Distributed Libraries. - Thomas Place; Jeroen Hoppenbrouwers (ECDL, 2000)

Characterization of Logics over Ranked Tree Languages. - Thomas Place (CSL, 2008)

Deciding Definability in FO2(<) (or XPath) on Trees. - Thomas Place; Luc Segoufin (LICS, 2010)

Frame Definability for Classes of Trees in the µ-calculus. - Gaëlle Fontaine; Thomas Place (MFCS, 2010)

Decidable characterizations for tree logics. (Caractérisation décidables de logiques sur les arbres). - Thomas Place (2010)

A decidable characterization of locally testable tree languages - Thomas Place; Luc Segoufin (Log. Methods Comput. Sci., 2011)

Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. - Mikolaj Bojanczyk; Thomas Place (ICALP (2), 2012)

Toward Model Theory with Data Values. - Mikolaj Bojanczyk; Thomas Place (ICALP (2), 2012)

Separating Regular Languages by Piecewise Testable and Unambiguous Languages. - Thomas Place; Lorijn van Rooijen; Marc Zeitoun (MFCS, 2013)

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. - Thomas Place; Marc Zeitoun (ICALP (2), 2014)

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. - Thomas Place; Lorijn van Rooijen; Marc Zeitoun (Log. Methods Comput. Sci., 2014)

Separating Regular Languages with Two Quantifiers Alternations. - Thomas Place (LICS, 2015)

Separation and the Successor Relation. - Thomas Place; Marc Zeitoun (STACS, 2015)

Deciding definability in FO2(<h, <v) on trees. - Thomas Place; Luc Segoufin (Log. Methods Comput. Sci., 2015)

A Transfer Theorem for the Separation Problem. - Thomas Place; Marc Zeitoun (CoRR, 2015)

The tale of the quantifier alternation hierarchy of first-order logic over words. - Thomas Place; Marc Zeitoun (ACM SIGLOG News, 2015)

Quantifier Alternation for Infinite Words. - Théo Pierron; Thomas Place; Marc Zeitoun (FoSSaCS, 2016)

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. - Thomas Place; Marc Zeitoun (MFCS, 2016)

Decidable Characterization of FO2(<, +1) and locality of DA. - Thomas Place; Luc Segoufin (CoRR, 2016)

Separating Regular Languages with First-Order Logic. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2016)

Concatenation Hierarchies: New Bottle, Old Wine. - Thomas Place; Marc Zeitoun (CSR, 2017)

The Complexity of Separation for Levels in Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (FSTTCS, 2018)

Separating Without Any Ambiguity. - Thomas Place; Marc Zeitoun (ICALP, 2018)

A generic characterization of Pol(C). - Thomas Place; Marc Zeitoun (CoRR, 2018)

Separating regular languages with two quantifier alternations. - Thomas Place (Log. Methods Comput. Sci., 2018)

The Covering Problem. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2018)

On All Things Star-Free. - Thomas Place; Marc Zeitoun (ICALP, 2019)

Separation and covering for group based concatenation hierarchies. - Thomas Place; Marc Zeitoun (LICS, 2019)

Going Higher in First-Order Quantifier Alternation Hierarchies on Words. - Thomas Place; Marc Zeitoun (J. ACM, 2019)

Regular tree languages in low levels of the Wadge Hierarchy. - Mikolaj Bojanczyk; Filippo Cavallari; Thomas Place; Michal Skrzypczak (Log. Methods Comput. Sci., 2019)

Covering and separation for logical fragments with modular predicates. - Thomas Place; Varun Ramanathan 001; Pascal Weil (Log. Methods Comput. Sci., 2019)

Generic Results for Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (Theory Comput. Syst., 2019)

Deciding Classes of Regular Languages: The Covering Approach. - Thomas Place (LATA, 2020)

Adding Successor: A Transfer Theorem for Separation and Covering. - Thomas Place; Marc Zeitoun (ACM Trans. Comput. Log., 2020)

Separation for dot-depth two. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2021)

Characterizing Level One in Group-Based Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (CSR, 2022)

A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. - Thomas Place; Marc Zeitoun (FSTTCS, 2022)

How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? - Thomas Place; Marc Zeitoun (LATIN, 2022)

The amazing mixed polynomial closure and its applications to two-variable first-order logic. - Thomas Place (LICS, 2022)

Unambiguous polynomial closure explained. - Thomas Place; Marc Zeitoun (CoRR, 2022)

Group Separation Strikes Back. - Thomas Place; Marc Zeitoun (LICS, 2023)

All about unambiguous polynomial closure. - Thomas Place; Marc Zeitoun (TheoretiCS, 2023)

A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. - Thomas Place; Marc Zeitoun (CSL, 2024)

Dot-depth three, return of the J-class. - Thomas Place; Marc Zeitoun (LICS, 2024)

Temporal hierarchies of regular languages. - Thomas Place; Marc Zeitoun (CoRR, 2024)

Closing Star-Free Closure. - Thomas Place; Marc Zeitoun (ACM Trans. Comput. Log., 2025)