SEM-based nanoprobing on 32 and 28 nm CMOS devices challenges for semiconductor failure analysis. - Erik Paul; Holger Herzog; Sören Jansen; Christian Hobert; Eckhard Langer (Microelectron. Reliab., 2014)

On Finite and Polynomial Ambiguity of Weighted Tree Automata. - Erik Paul (DLT, 2016)

Monitor Logics for Quantitative Monitor Automata. - Erik Paul (MFCS, 2017)

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable. - Erik Paul (MFCS, 2017)

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. - Manfred Droste; Erik Paul (MFCS, 2018)

Expressiveness and Decidability of Weighted Automata and Weighted Logics. - Erik Paul (2020)

Ausdrucksstärke gewichteter Automaten und Logiken. - Erik Paul (Ausgezeichnete Informatikdissertationen, 2020)

Finite Sequentiality of Unambiguous Max-Plus Tree Automata. - Erik Paul (Theory Comput. Syst., 2021)

Logical Characterizations of Weighted Complexity Classes. - Guillermo Badia; Manfred Droste; Carles Noguera; Erik Paul (MFCS, 2024)

Weighted HOM-Problem for Nonnegative Integers. - Andreas Maletti; Andreea-Teodora Nász; Erik Paul (STACS, 2024)

Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. - Erik Paul (Int. J. Found. Comput. Sci., 2024)

Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. - Erik Paul (Theory Comput. Syst., 2024)

Fagin's Theorem for Semiring Turing Machines. - Guillermo Badia; Manfred Droste; Thomas Eiter; Rafael Kiesel; Carles Noguera; Erik Paul (CoRR, 2025)