| 2011 | ASIACRYPT | The Preimage Security of Double-Block-Length Compression Functions. | Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger |
| 2007 | DATE | Timing simulation of interconnected AUTOSAR software-components. | Matthias Krause, Oliver Bringmann, Andr Hergenhan, Gkhan Tabanoglu, Wolfgang Rosenstiel |
| 2006 | FSE | Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. | Matthias Krause, Dirk Stegemann |
| 2006 | ICALP | Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. | Frederik Armknecht, Matthias Krause |
| 2005 | INDOCRYPT | Design Principles for Combiners with Memory. | Frederik Armknecht, Matthias Krause, Dirk Stegemann |
| 2003 | CRYPTO | Algebraic Attacks on Combiners with Memory. | Frederik Armknecht, Matthias Krause |
| 2002 | EuroCrypt | BDD-Based Cryptanalysis of Keystream Generators. | Matthias Krause |
| 2002 | STACS | On the Computational Power of Boolean Decision Lists. | Matthias Krause |
| 2001 | ACISP | Improved Cryptanalysis of the Self-Shrinking Generator. | Erik Zenner, Matthias Krause, Stefan Lucks |
| 2001 | STACS | On the Minimal Hardware Complexity of Pseudorandom Function Generators. | Matthias Krause, Stefan Lucks |
| 2000 | LATIN | Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. | Matthias Krause, Hans Ulrich Simon |
| 1999 | ICALP | Approximations by OBDDs and the Variable Ordering Problem. | Matthias Krause, Petr Savick, Ingo Wegener |
| 1997 | COCOON | Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. | Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon |
| 1995 | FOCS | On Computing Boolean Functions by Sparse Real Polynomials. | Matthias Krause, Pavel Pudlk |
| 1995 | STACS | On Realizing Iterated Multiplication by Small Depth Threshold Circuits. | Matthias Krause |
| 1994 | STOC | On the computational power of depth 2 circuits with threshold and modulo gates. | Matthias Krause, Pavel Pudlk |
| 1992 | STACS | Separating Counting Communication Complexity Classes. | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
| 1991 | FOCS | Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In | Matthias Krause, Stephan Waack |
| 1990 | MFCS | Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. | Matthias Krause |
| 1989 | FCT | On Oblivious Branching Programs of Linear Length (Extended Abstract). | Matthias Krause, Stephan Waack |
| 1988 | MFCS | Separating the Eraser Turing Machine Classes L | Matthias Krause, Christoph Meinel, Stephan Waack |