Thomas Place

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 48

Top Venues

CoRR

Log. Methods Comput. Sci.

LICS

CSR

École normale supérieure de Cachan, France (PHD)

Education History

École normale supérieure de Cachan, France

PHD

Publications

Thomas Place, Marc Zeitoun
A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. CSL (2024)
Thomas Place, Marc Zeitoun
Dot-depth three, return of the J-class. LICS (2024)
Thomas Place, Marc Zeitoun
Temporal hierarchies of regular languages. CoRR (2024)
Thomas Place, Marc Zeitoun
Dot-depth three, return of the J-class. CoRR (2024)
Thomas Place, Marc Zeitoun
A generic characterization of generalized unary temporal logic and two-variable first-order logic. CoRR (2023)
Thomas Place, Marc Zeitoun
All about unambiguous polynomial closure. TheoretiCS 2 (2023)
Thomas Place, Marc Zeitoun
Group Separation Strikes Back. LICS (2023)
Thomas Place, Marc Zeitoun
Closing star-free closure. CoRR (2023)
Thomas Place, Marc Zeitoun
A generic polynomial time approach to separation by first-order logic without quantifier alternation. CoRR (2022)
Thomas Place, Marc Zeitoun
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. FSTTCS (2022)
Thomas Place, Marc Zeitoun
Group separation strikes back. CoRR (2022)
Thomas Place
The amazing mixed polynomial closure and its applications to two-variable first-order logic. LICS (2022)
Thomas Place
The amazing mixed polynomial closure and its applications to two-variable first-order logic. CoRR (2022)
Thomas Place, Marc Zeitoun
Characterizing level one in group-based concatenation hierarchies. CoRR (2022)
Thomas Place, Marc Zeitoun
Characterizing Level One in Group-Based Concatenation Hierarchies. CSR (2022)
Thomas Place, Marc Zeitoun
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? LATIN (2022)
Thomas Place, Marc Zeitoun
Unambiguous polynomial closure explained. CoRR (2022)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. Log. Methods Comput. Sci. 17 (3) (2021)
Thomas Place
Deciding Classes of Regular Languages: The Covering Approach. LATA (2020)
Thomas Place, Marc Zeitoun
Adding Successor: A Transfer Theorem for Separation and Covering. ACM Trans. Comput. Log. 21 (2) (2020)
Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. Theory Comput. Syst. 63 (4) (2019)
Thomas Place, Marc Zeitoun
On all things star-free. CoRR (2019)
Thomas Place, Marc Zeitoun
Separation and covering for group based concatenation hierarchies. LICS (2019)
Thomas Place, Marc Zeitoun
Separation and covering for group based concatenation hierarchies. CoRR (2019)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of the Wadge Hierarchy. Log. Methods Comput. Sci. 15 (3) (2019)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. CoRR (2019)
Thomas Place, Marc Zeitoun
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. J. ACM 66 (2) (2019)
Thomas Place, Varun Ramanathan, Pascal Weil
Covering and separation for logical fragments with modular predicates. Log. Methods Comput. Sci. 15 (2) (2019)
Thomas Place, Marc Zeitoun
On All Things Star-Free. ICALP (2019)
Thomas Place
Separating regular languages with two quantifier alternations. Log. Methods Comput. Sci. 14 (4) (2018)
Thomas Place, Varun Ramanathan, Pascal Weil
Covering and separation for logical fragments with modular predicates. CoRR (2018)
Thomas Place, Marc Zeitoun
A generic characterization of Pol(C). CoRR (2018)
Thomas Place, Marc Zeitoun
The Complexity of Separation for Levels in Concatenation Hierarchies. FSTTCS (2018)
Thomas Place, Marc Zeitoun
The complexity of separation for levels in concatenation hierarchies. CoRR (2018)
Thomas Place, Marc Zeitoun
The Covering Problem. Log. Methods Comput. Sci. 14 (3) (2018)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of Wadge Hierarchy. CoRR (2018)
Thomas Place, Marc Zeitoun
Separating Without Any Ambiguity. ICALP (2018)
Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. CoRR (2017)
Thomas Place, Marc Zeitoun
The Covering Problem. CoRR (2017)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. LICS (2017)
Thomas Place, Marc Zeitoun
Adding successor: A transfer theorem for separation and covering. CoRR (2017)
Thomas Place, Marc Zeitoun
Concatenation Hierarchies: New Bottle, Old Wine. CSR (2017)
Thomas Place
Separating regular languages with two quantifier alternations. CoRR (2017)
Thomas Place, Marc Zeitoun
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. CoRR (2017)
Thomas Place, Luc Segoufin
Decidable Characterization of FO2(<, +1) and locality of DA. CoRR (2016)
Thomas Place, Marc Zeitoun
Separating Regular Languages with First-Order Logic. Log. Methods Comput. Sci. 12 (1) (2016)
Thomas Place, Marc Zeitoun
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. MFCS (2016)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. FoSSaCS (2016)
Thomas Place, Marc Zeitoun
The tale of the quantifier alternation hierarchy of first-order logic over words. ACM SIGLOG News 2 (3) (2015)
Thomas Place, Marc Zeitoun
A Transfer Theorem for the Separation Problem. CoRR (2015)
Thomas Place, Marc Zeitoun
Separation and the Successor Relation. STACS (2015)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. CoRR (2015)
Thomas Place, Luc Segoufin
Deciding definability in FO2(<h, <v) on trees. Log. Methods Comput. Sci. 11 (3) (2015)
Thomas Place
Separating Regular Languages with Two Quantifiers Alternations. LICS (2015)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. Log. Methods Comput. Sci. 10 (3) (2014)
Thomas Place, Marc Zeitoun
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. ICALP (2) (2014)
Thomas Place, Marc Zeitoun
Going higher in the First-order Quantifier Alternation Hierarchy on Words. CoRR (2014)
Thomas Place, Marc Zeitoun
Separating regular languages with first-order logic. CSL-LICS (2014)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. FSTTCS (2013)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating regular languages by piecewise testable and unambiguous languages CoRR (2013)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. MFCS (2013)
Mikolaj Bojanczyk, Thomas Place
Toward Model Theory with Data Values. ICALP (2) (2012)
Mikolaj Bojanczyk, Thomas Place
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. ICALP (2) (2012)
Thomas Place, Luc Segoufin
A decidable characterization of locally testable tree languages Log. Methods Comput. Sci. 7 (4) (2011)
Thomas Place, Luc Segoufin
(<) (or XPath) on Trees. LICS (2010)
Gaëlle Fontaine, Thomas Place
-calculus. MFCS (2010)
Thomas Place, Luc Segoufin
A Decidable Characterization of Locally Testable Tree Languages. ICALP (2) (2009)
Thomas Place
Characterization of Logics over Ranked Tree Languages. CSL (2008)
Thomas Place, Jeroen Hoppenbrouwers
Decomate: Unified Access to Globally Distributed Libraries. ECDL (2000)

Thomas Place.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Place