A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. - Lars Noschinski; Fabian Emmes; Jürgen Giesl (CADE, 2011)

Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem. - Lars Noschinski (ITP, 2012)

A Probabilistic Proof of the Girth-Chromatic Number Theorem. - Lars Noschinski (Arch. Formal Proofs, 2012)

Graph Theory. - Lars Noschinski (Arch. Formal Proofs, 2013)

Pratt's Primality Certificates. - Simon Wimmer 001; Lars Noschinski (Arch. Formal Proofs, 2013)

Lehmer's Theorem. - Simon Wimmer 001; Lars Noschinski (Arch. Formal Proofs, 2013)

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. - Lars Noschinski; Fabian Emmes; Jürgen Giesl (J. Autom. Reason., 2013)

Experience report: the next 1100 Haskell programmers. - Jasmin Christian Blanchette; Lars Hupel; Tobias Nipkow; Lars Noschinski; Dmitriy Traytel (Haskell, 2014)

Verification of Certifying Computations through AutoCorres and Simpl. - Lars Noschinski; Christine Rizkallah; Kurt Mehlhorn (NASA Formal Methods, 2014)

Generating Cases from Labeled Subgoals. - Lars Noschinski (Arch. Formal Proofs, 2015)

A Graph Library for Isabelle. - Lars Noschinski (Math. Comput. Sci., 2015)

Formalizing Graph Theory and Planarity Certificates (Formalisierung von Graphentheorie und Planaritätszertifikaten) - Lars Noschinski (2016)

Pattern-based Subterm Selection in Isabelle. - Lars Noschinski; Christoph Traut (CoRR, 2021)