( en | de | ru )

 

Disambiguation of "Place, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
MPEG21 DIDL Application Profile for NEEO Repositories, Version 0.4

. (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Place

Bohu Wenzel Placek

Leticia Placeres

Luis Placencia

Kurt Placek

 

Other publications of authors with the same name

Exchanging information between RePEc and Economists Online. (May 2008)Going Higher in First-Order Quantifier Alternation Hierarchies on Words., and . J. ACM, 66 (2): 12:1-12:65 (2019)Separation and covering for group based concatenation hierarchies., and . LICS, page 1-13. IEEE, (2019)How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?, and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 409-425. Springer, (2022)Deciding Classes of Regular Languages: The Covering Approach.. LATA, volume 12038 of Lecture Notes in Computer Science, page 89-112. Springer, (2020)Covering and separation for logical fragments with modular predicates., , and . Log. Methods Comput. Sci., (2019)Characterizing Level One in Group-Based Concatenation Hierarchies., and . CSR, volume 13296 of Lecture Notes in Computer Science, page 320-337. Springer, (2022)A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic., and . CSL, volume 288 of LIPIcs, page 45:1-45:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On All Things Star-Free., and . ICALP, volume 132 of LIPIcs, page 126:1-126:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The amazing mixed polynomial closure and its applications to two-variable first-order logic.. LICS, page 14:1-14:14. ACM, (2022)