Search Results - "ZEUME, THOMAS"

REGISTER AUTOMATA WITH EXTREMA CONSTRAINTS, AND AN APPLICATION TO TWO-VARIABLE LOGIC.

Authors: TORUŃCZYK, SZYMON ZEUME, THOMAS

Source: Logical Methods in Computer Science (LMCS); 2022, Vol. 18 Issue 1, p1-38, 38p, 4 Graphs

DYNAMIC COMPLEXITY OF PARITY EXISTS QUERIES.

Authors: VORTMEIER, NILS ZEUME, THOMAS

Source: Logical Methods in Computer Science (LMCS); 2021, Vol. 17 Issue 4, p1-26, 26p

A More General Theory of Static Approximations for Conjunctive Queries.

Authors: Barceló, Pablo Romero, Miguel Zeume, Thomas

Source: Theory of Computing Systems; Jul2020, Vol. 64 Issue 5, p916-964, 49p

A STRATEGY FOR DYNAMIC PROGRAMS: START OVER AND MUDDLE THROUGH.

Authors: DATTA, SAMIR MUKHERJEE, ANISH SCHWENTICK, THOMAS et al.

Source: Logical Methods in Computer Science (LMCS); Apr2019, Vol. 15 Issue 2, p1-26, 26p, 5 Diagrams

Dynamic conjunctive queries.

Authors: Zeume, Thomas Schwentick, Thomas

Source: Journal of Computer & System Sciences. Sep2017, Vol. 88, p3-26. 24p.

Subjects: Querying (Computer science), Computational complexity, Semantics, Language & languages, Dynamical systems

The dynamic descriptive complexity of k-clique.

Authors: Zeume, Thomas¹

Source: Information & Computation. Oct2017, Vol. 256, p9-22. 14p.

Subjects: Graphic methods, Computational complexity, Ramsey numbers, Quantifiers (Linguistics), Edges (Geometry)

Dynamic Complexity under Definable Changes.

Authors: Schwentick, Thomas Vortmeier, Nils Zeume, Thomas

Source: ACM Transactions on Database Systems; Nov2018, Vol. 43 Issue 3, p1-38, 38p

Reachability Is in DynFO.

Authors: Datta, Samir Kulkarni, Raghav Mukherjee, Anish et al.

Source: Journal of the ACM; Sep2018, Vol. 65 Issue 5, p1-24, 24p

On the quantifier-free dynamic complexity of Reachability.

Authors: Zeume, Thomas Schwentick, Thomas

Source: Information & Computation. Feb2015, Vol. 240, p108-129. 22p.

Subjects: Computational complexity, Dynamical systems, Search algorithms, Mathematical formulas, Graph theory