default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Place
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Thomas Place, Marc Zeitoun:
A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. CSL 2024: 45:1-45:23- [c28]Thomas Place
, Marc Zeitoun:
Dot-depth three, return of the J-class. LICS 2024: 64:1-64:15 - [i26]Thomas Place, Marc Zeitoun:
Dot-depth three, return of the J-class. CoRR abs/2401.16195 (2024) - [i25]Thomas Place, Marc Zeitoun:
Temporal hierarchies of regular languages. CoRR abs/2402.10080 (2024) - 2023
- [j14]Thomas Place, Marc Zeitoun:
All about unambiguous polynomial closure. TheoretiCS 2 (2023) - [c27]Thomas Place, Marc Zeitoun:
Group Separation Strikes Back. LICS 2023: 1-13 - [i24]Thomas Place, Marc Zeitoun:
A generic characterization of generalized unary temporal logic and two-variable first-order logic. CoRR abs/2307.09349 (2023) - [i23]Thomas Place, Marc Zeitoun:
Closing star-free closure. CoRR abs/2307.09376 (2023) - 2022
- [c26]Thomas Place, Marc Zeitoun:
Characterizing Level One in Group-Based Concatenation Hierarchies. CSR 2022: 320-337 - [c25]Thomas Place, Marc Zeitoun:
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. FSTTCS 2022: 43:1-43:22 - [c24]Thomas Place, Marc Zeitoun:
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? LATIN 2022: 409-425 - [c23]Thomas Place:
The amazing mixed polynomial closure and its applications to two-variable first-order logic. LICS 2022: 14:1-14:14 - [i22]Thomas Place, Marc Zeitoun:
Characterizing level one in group-based concatenation hierarchies. CoRR abs/2201.06826 (2022) - [i21]Thomas Place:
The amazing mixed polynomial closure and its applications to two-variable first-order logic. CoRR abs/2202.03989 (2022) - [i20]Thomas Place, Marc Zeitoun:
Group separation strikes back. CoRR abs/2205.01632 (2022) - [i19]Thomas Place, Marc Zeitoun:
Unambiguous polynomial closure explained. CoRR abs/2205.12703 (2022) - [i18]Thomas Place, Marc Zeitoun:
A generic polynomial time approach to separation by first-order logic without quantifier alternation. CoRR abs/2210.00946 (2022) - 2021
- [j13]Thomas Place, Marc Zeitoun:
Separation for dot-depth two. Log. Methods Comput. Sci. 17(3) (2021) - 2020
- [j12]Thomas Place, Marc Zeitoun:
Adding Successor: A Transfer Theorem for Separation and Covering. ACM Trans. Comput. Log. 21(2): 9:1-9:45 (2020) - [c22]Thomas Place:
Deciding Classes of Regular Languages: The Covering Approach. LATA 2020: 89-112
2010 – 2019
- 2019
- [j11]Thomas Place, Marc Zeitoun:
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. J. ACM 66(2): 12:1-12:65 (2019) - [j10]Thomas Place, Varun Ramanathan, Pascal Weil:
Covering and separation for logical fragments with modular predicates. Log. Methods Comput. Sci. 15(2) (2019) - [j9]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) - [j8]Thomas Place, Marc Zeitoun:
Generic Results for Concatenation Hierarchies. Theory Comput. Syst. 63(4): 849-901 (2019) - [c21]Thomas Place, Marc Zeitoun:
On All Things Star-Free. ICALP 2019: 126:1-126:14 - [c20]Thomas Place, Marc Zeitoun:
Separation and covering for group based concatenation hierarchies. LICS 2019: 1-13 - [i17]Thomas Place, Marc Zeitoun:
Separation for dot-depth two. CoRR abs/1901.03361 (2019) - [i16]Thomas Place, Marc Zeitoun:
Separation and covering for group based concatenation hierarchies. CoRR abs/1902.04957 (2019) - [i15]Thomas Place, Marc Zeitoun:
On all things star-free. CoRR abs/1904.11863 (2019) - 2018
- [j7]Thomas Place, Marc Zeitoun:
The Covering Problem. Log. Methods Comput. Sci. 14(3) (2018) - [j6]Thomas Place:
Separating regular languages with two quantifier alternations. Log. Methods Comput. Sci. 14(4) (2018) - [c19]Thomas Place, Marc Zeitoun:
The Complexity of Separation for Levels in Concatenation Hierarchies. FSTTCS 2018: 47:1-47:17 - [c18]Thomas Place, Marc Zeitoun:
Separating Without Any Ambiguity. ICALP 2018: 137:1-137:14 - [i14]Thomas Place, Marc Zeitoun:
A generic characterization of Pol(C). CoRR abs/1802.06141 (2018) - [i13]Thomas Place, Varun Ramanathan, Pascal Weil:
Covering and separation for logical fragments with modular predicates. CoRR abs/1804.08883 (2018) - [i12]Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak:
Regular tree languages in low levels of Wadge Hierarchy. CoRR abs/1806.02041 (2018) - [i11]Thomas Place, Marc Zeitoun:
The complexity of separation for levels in concatenation hierarchies. CoRR abs/1810.09287 (2018) - 2017
- [c17]Thomas Place, Marc Zeitoun:
Concatenation Hierarchies: New Bottle, Old Wine. CSR 2017: 25-37 - [c16]Thomas Place, Marc Zeitoun:
Separation for dot-depth two. LICS 2017: 1-12 - [i10]Thomas Place:
Separating regular languages with two quantifier alternations. CoRR abs/1707.03295 (2017) - [i9]Thomas Place, Marc Zeitoun:
The Covering Problem. CoRR abs/1707.03370 (2017) - [i8]Thomas Place, Marc Zeitoun:
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. CoRR abs/1707.05696 (2017) - [i7]Thomas Place, Marc Zeitoun:
Adding successor: A transfer theorem for separation and covering. CoRR abs/1709.10052 (2017) - [i6]Thomas Place, Marc Zeitoun:
Generic Results for Concatenation Hierarchies. CoRR abs/1710.04313 (2017) - 2016
- [j5]Thomas Place, Marc Zeitoun:
Separating Regular Languages with First-Order Logic. Log. Methods Comput. Sci. 12(1) (2016) - [c15]Théo Pierron, Thomas Place, Marc Zeitoun:
Quantifier Alternation for Infinite Words. FoSSaCS 2016: 234-251 - [c14]Thomas Place, Marc Zeitoun:
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. MFCS 2016: 77:1-77:15 - [i5]Thomas Place, Luc Segoufin:
Decidable Characterization of FO2(<, +1) and locality of DA. CoRR abs/1606.03217 (2016) - 2015
- [j4]Thomas Place, Luc Segoufin:
Deciding definability in FO2(<h, <v) on trees. Log. Methods Comput. Sci. 11(3) (2015) - [j3]Thomas Place, Marc Zeitoun:
The tale of the quantifier alternation hierarchy of first-order logic over words. ACM SIGLOG News 2(3): 4-17 (2015) - [c13]Thomas Place:
Separating Regular Languages with Two Quantifiers Alternations. LICS 2015: 202-213 - [c12]Thomas Place, Marc Zeitoun:
Separation and the Successor Relation. STACS 2015: 662-675 - [i4]Thomas Place, Marc Zeitoun:
A Transfer Theorem for the Separation Problem. CoRR abs/1501.00569 (2015) - [i3]Théo Pierron, Thomas Place, Marc Zeitoun:
Quantifier Alternation for Infinite Words. CoRR abs/1511.09011 (2015) - 2014
- [j2]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) - [c11]Thomas Place, Marc Zeitoun:
Separating regular languages with first-order logic. CSL-LICS 2014: 75:1-75:10 - [c10]Thomas Place, Marc Zeitoun:
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. ICALP (2) 2014: 342-353 - [i2]Thomas Place, Marc Zeitoun:
Going higher in the First-order Quantifier Alternation Hierarchy on Words. CoRR abs/1404.6832 (2014) - 2013
- [c9]Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. FSTTCS 2013: 363-375 - [c8]Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. MFCS 2013: 729-740 - [i1]Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating regular languages by piecewise testable and unambiguous languages. CoRR abs/1304.6734 (2013) - 2012
- [c7]Mikolaj Bojanczyk, Thomas Place:
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. ICALP (2) 2012: 104-115 - [c6]Mikolaj Bojanczyk, Thomas Place:
Toward Model Theory with Data Values. ICALP (2) 2012: 116-127 - 2011
- [j1]Thomas Place, Luc Segoufin:
A decidable characterization of locally testable tree languages. Log. Methods Comput. Sci. 7(4) (2011) - 2010
- [b1]Thomas Place:
Decidable characterizations for tree logics. (Caractérisation décidables de logiques sur les arbres). École normale supérieure de Cachan, France, 2010 - [c5]Thomas Place, Luc Segoufin:
Deciding Definability in FO2(<) (or XPath) on Trees. LICS 2010: 253-262 - [c4]Gaëlle Fontaine, Thomas Place:
Frame Definability for Classes of Trees in the µ-calculus. MFCS 2010: 381-392
2000 – 2009
- 2009
- [c3]Thomas Place, Luc Segoufin:
A Decidable Characterization of Locally Testable Tree Languages. ICALP (2) 2009: 285-296 - 2008
- [c2]Thomas Place:
Characterization of Logics over Ranked Tree Languages. CSL 2008: 401-415 - 2000
- [c1]Thomas Place, Jeroen Hoppenbrouwers:
Decomate: Unified Access to Globally Distributed Libraries. ECDL 2000: 467-470
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
