A formal framework handling the description and implementation of multigrid algorithms. - Uwe Meyer 003; Guido Wirtz (ICS, 1989)

Techniques for Partial Evaluation of Imperative Languages. - Uwe Meyer 003 (PEPM, 1991)

Partielle Auswertung imperativer Sprachen. - Uwe Meyer 003 (1992)

Correctness of On-Line Partial Evaluation for a Pascal-Like Language. - Uwe Meyer 003 (Sci. Comput. Program., 1999)

Patterns for Name Analysis and Type Analysis with JastAdd. - Uwe Meyer 003; Björn Pfarr (CoRR, 2020)

Program analysis for reversible languages. - Niklas Deworetzki; Uwe Meyer 003 (SOAP@PLDI, 2021)

Compiling Janus to RSSA. - Martin Kutrib; Uwe Meyer 003; Niklas Deworetzki; Marc Schuster (RC, 2021)

Optimizing Reversible Programs. - Niklas Deworetzki; Martin Kutrib; Uwe Meyer 003; Pia-Doreen Ritzke (RC, 2022)

Designing a Reversible Stack Machine. - Niklas Deworetzki; Uwe Meyer 003 (RC, 2022)

Tree-Walking-Storage Automata. - Martin Kutrib; Uwe Meyer 003 (DLT, 2023)

Deterministic Real-Time Tree-Walking-Storage Automata. - Martin Kutrib; Uwe Meyer 003 (NCMA, 2023)

Reversible Top-Down Syntax Analysis. - Martin Kutrib; Uwe Meyer 003 (Int. J. Found. Comput. Sci., 2023)

Syntax checking either way. - Martin Kutrib; Uwe Meyer 003 (Theor. Comput. Sci., 2023)

Context-Free Binding Grammars. - Björn Lötters; Uwe Meyer 003 (IFL, 2024)

Connecting Reversible and Classical Computing Through Hybrid SSA. - Lukas Gail; Uwe Meyer 003 (RC, 2024)