Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. - Christopher Czyba; Wolfgang Thomas; Christopher Spinrath (Int. J. Found. Comput. Sci., 2018)

Parallel-Correctness and Parallel-Boundedness for Datalog Programs. - Frank Neven; Thomas Schwentick; Christopher Spinrath; Brecht Vandevoort (ICDT, 2019)

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. - Christof Löding; Christopher Spinrath (Discret. Math. Theor. Comput. Sci., 2019)

Work-Efficient Query Evaluation with PRAMs. - Jens Keppeler; Thomas Schwentick; Christopher Spinrath (ICDT, 2023)

Rewriting with Acyclic Queries: Mind Your Head. - Gaetano Geck; Jens Keppeler; Thomas Schwentick; Christopher Spinrath (Log. Methods Comput. Sci., 2023)

Query evaluation revised: parallel, distributed, via rewritings - Christopher Spinrath (2024)