Kousha etessami biography of michael
•
Finite and Algorithmic Model Theory research revolves around the study of the expressive power of various logics on finite and finitely presented structures, and the connections between this and different computational models and mathematical formalisms.
The methods and tools of finite and algorithmic model theory (FAMT) have played an active role in the development of several areas of computer science. Finite or finitely representable structures are those that serve as inputs to computation, and the study of the expressive power of logical languages on such structures has led to fundamental insights in diverse areas, including database theory, computational complexity, random structures and combinatorics, verification, automata theory, proof complexity, and algorithmic game theory.
Over the past four decades FAMT has established itself as a rich research field with a strong and evolving community of researchers with a shared agenda. Much of the progress can be traced to the
•
Michael Benedikt
default search action
ask others
Person information
- affiliation:University of Oxford, UK
2020 – today
- 2024
[j68]
Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory.Log. Methods Comput. Sci.20(3) (2024)[j67]
Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting.SIAM J. Comput.53(4): 884-968 (2024)[j66]
Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik:
Rewriting the Infinite Chase for Guarded TGDs.ACM Trans. Database Syst.49(4): 14:1-14:44 (2024)[c92]
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations.ICALP2024: 127:1-127:20[c91]
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and•
Lampis Michael - CV
Communications avec actes
Hanaka T., Kiya H., Lampis M., Ono H., Yoshiwatari K. (2024), Faster Winner Determination Algorithms for (Colored) Arc Kayles, in Henning Fernau, Serge Gaspers, Ralf Klasing, SOFSEM 2024: Theory and Practice of Computer Science, Springer Nature Switzerland, 297-310 p.
Hanaka T., Lampis M., Vasilakis M., Yoshiwatari K. (2024), Parameterized Vertex Integrity Revisited, in Rastislav Královič, Antonín Kučera, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Hanaka T., Kohler N., Lampis M. (2024), Core Stability in Additively Separable Hedonic Games of Low Treewidth, in , Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 39:1-39:17 p.
Feldmann A., Lampis M. (2024), Parameterized Algorithms for Steiner Forest in Bounded Width Graphs, in Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 61:1-61:20 p.
Lampis M., Vasilakis M. (2023), Structural Parameterizations for Two