Analyzing innermost runtime complexity of term rewriting by dependency pairs L Noschinski, F Emmes, J Giesl Journal of Automated Reasoning 51, 27-56, 2013 | 70 | 2013 |

A graph library for Isabelle L Noschinski Mathematics in Computer Science 9 (1), 23-39, 2015 | 45 | 2015 |

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems L Noschinski, F Emmes, J Giesl | 27 | 2011 |

Verification of certifying computations through AutoCorres and Simpl L Noschinski, C Rizkallah, K Mehlhorn NASA Formal Methods: 6th International Symposium, NFM 2014, Houston, TX, USA …, 2014 | 22 | 2014 |

Formalizing graph theory and planarity certificates L Noschinski Technische Universität München, 2016 | 11 | 2016 |

Proof pearl: A probabilistic proof for the Girth-Chromatic number theorem L Noschinski International Conference on Interactive Theorem Proving, 393-404, 2012 | 11 | 2012 |

Pattern-based subterm selection in Isabelle C Traut, L Noschinski Proceedings of Isabelle workshop 2014, 2014 | 7* | 2014 |

Graph Theory. Archive of Formal Proofs (April 2013) L Noschinski | 6 | 2013 |

Experience report: The next 1100 haskell programmers JC Blanchette, L Hupel, T Nipkow, L Noschinski, D Traytel Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell, 25-30, 2014 | 4 | 2014 |

A probabilistic proof of the girth-chromatic number theorem L Noschinski The Archive of Formal Proofs. http://afp. sf. net/entries/Girth Chromatic …, 2012 | 4 | 2012 |

Generating Cases from Labeled Subgoals L Noschinski Archive of Formal Proofs (July 2015). Formal proof development, 2015 | 1 | 2015 |

A Formalisation of Lehmer’s primality criterion S Wimmer, L Noschinski Arch. Formal Proofs, Isabelle, 2013 | 1 | 2013 |

A Formalization of Pratt’s Primality Certificates S Wimmer, L Noschinski | | 2016 |

Towards Structured Proofs for Program Verification (Ongoing Work) L Noschinski Isabelle Workshop (Interactive Theorem Proving), 2014 | | 2014 |

Automated Complexity Analysis of Term Rewrite Systems L Noschinski | | |