Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Matthias Krause
2010 – today
- 2011
[b1]Matthias Krause: Automatisierte Erstellung und Verfeinerung virtueller Prototypen für den Entwurf verteilter eingebetteter Systeme. Eberhard Karls University of Tübingen 2011, ISBN 978-3-86853-887-8, pp. 1-208- [c32]Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger: The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT 2011: 233-251
- [c31]Matthias Krause, Matthias Hamann: The Cryptographic Power of Random Selection. Selected Areas in Cryptography 2011: 134-150
- [i10]Matthias Krause, Matthias Hamann: The Cryptographic Power of Random Selection. IACR Cryptology ePrint Archive 2011: 511 (2011)
- 2010
- [i9]Matthias Krause, Frederik Armknecht, Ewan Fleischmann: Preimage Resistance Beyond the Birthday Bound: Double-Length Hashing Revisited. IACR Cryptology ePrint Archive 2010: 519 (2010)
2000 – 2009
- 2009
- [c30]Matthias Krause, Dirk Stegemann: More on the Security of Linear RFID Authentication Protocols. Selected Areas in Cryptography 2009: 182-196
- 2008
- [c29]Matthias Krause, Dominik Englert, Oliver Bringmann, Wolfgang Rosenstiel: Combination of instruction set simulation and abstract RTOS model execution for fast and accurate target software evaluation. CODES+ISSS 2008: 143-148
- 2007
- [j20]Matthias Krause: OBDD-Based Cryptanalysis of Oblivious Keystream Generators. Theory Comput. Syst. 40(1): 101-121 (2007)
- [c28]Matthias Krause, Oliver Bringmann, André Hergenhan, Gökhan Tabanoglu, Wolfgang Rosenstiel: Timing simulation of interconnected AUTOSAR software-components. DATE 2007: 474-479
- 2006
- [j19]Matthias Krause: On the computational power of Boolean decision lists. Computational Complexity 14(4): 362-375 (2006)
- [c27]Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk: 06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006
- [c26]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek: 06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006
- [c25]Matthias Krause, Dirk Stegemann: Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. FSE 2006: 163-178
- [c24]Frederik Armknecht, Matthias Krause: Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. ICALP (2) 2006: 180-191
- [c23]Matthias Krause, Oliver Bringmann, Wolfgang Rosenstiel: Communication Refinement and Target Software Generation using SystemC. MBMV 2006: 30-37
- [e1]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek (Eds.): Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j18]Matthias Krause, Oliver Bringmann, Wolfgang Rosenstiel: Target software generation: an approach for automatic mapping of SystemC specifications onto real-time operating systems. Design Autom. for Emb. Sys. 10(4): 229-251 (2005)
- [j17]Matthias Krause, Petr Savický, Ingo Wegener: On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201(2): 160-177 (2005)
- [c22]Frederik Armknecht, Matthias Krause, Dirk Stegemann: Design Principles for Combiners with Memory. INDOCRYPT 2005: 104-117
- 2004
- [j16]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004)
- 2003
- [j15]Matthias Krause, Hans-Ulrich Simon: Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. Combinatorics, Probability & Computing 12(3): 285-299 (2003)
- [c21]Frederik Armknecht, Matthias Krause: Algebraic Attacks on Combiners with Memory. CRYPTO 2003: 162-175
- 2002
- [c20]
- [c19]
- 2001
- [j14]Matthias Krause, Stefan Lucks: Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. Computational Complexity 10(4): 297-313 (2001)
- [c18]Erik Zenner, Matthias Krause, Stefan Lucks: Improved Cryptanalysis of the Self-Shrinking Generator. ACISP 2001: 21-35
- [c17]Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon: Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS 2001: 171-182
- [c16]Matthias Krause, Stefan Lucks: On the Minimal Hardware Complexity of Pseudorandom Function Generators. STACS 2001: 419-430
- [i8]Matthias Krause: BDD-based Cryptanalysis of Keystream Generators. Electronic Colloquium on Computational Complexity (ECCC)(078) (2001)
- [i7]Matthias Krause: BDD-based Cryptanalysis of Keystream Generators. IACR Cryptology ePrint Archive 2001: 92 (2001)
- 2000
- [j13]Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon: Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240(2): 471-485 (2000)
- [c15]Matthias Krause, Hans-Ulrich Simon: Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN 2000: 280-291
- [i6]Matthias Krause, Hans-Ulrich Simon: Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. Electronic Colloquium on Computational Complexity (ECCC) 7(3) (2000)
- [i5]Matthias Krause, Stefan Lucks: On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators. Electronic Colloquium on Computational Complexity (ECCC) 7(14) (2000)
1990 – 1999
- 1999
- [c14]Matthias Krause, Petr Savický, Ingo Wegener: Approximations by OBDDs and the Variable Ordering Problem. ICALP 1999: 493-502
- [i4]Matthias Krause, Petr Savický, Ingo Wegener: Approximations by OBDDs and the variable ordering problem. Electronic Colloquium on Computational Complexity (ECCC) 6(11) (1999)
- 1998
- [j12]Matthias Krause, Pavel Pudlák: Computing Boolean Functions by Polynomials and Threshold Circuits. Computational Complexity 7(4): 346-370 (1998)
- 1997
- [j11]Matthias Krause, Pavel Pudlák: On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. Theor. Comput. Sci. 174(1-2): 137-156 (1997)
- [c13]Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon: Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON 1997: 176-185
- 1996
- [j10]Matthias Krause: Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. Theor. Comput. Sci. 156(1&2): 99-117 (1996)
- 1995
- [j9]Matthias Krause, Stephan Waack: Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. Mathematical Systems Theory 28(6): 553-564 (1995)
- [c12]Matthias Krause, Pavel Pudlák: On Computing Boolean Functions by Sparse Real Polynomials. FOCS 1995: 682-691
- [c11]Matthias Krause: On Realizing Iterated Multiplication by Small Depth Threshold Circuits. STACS 1995: 83-94
- [i3]Matthias Krause: A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits. Electronic Colloquium on Computational Complexity (ECCC) 2(9) (1995)
- 1994
- [j8]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Oblivious Linear Length MODp-Branching Program Classes. Elektronische Informationsverarbeitung und Kybernetik 30(2): 63-75 (1994)
- [c10]Volker Nissen, Matthias Krause: Constrained Combinatorial Optimization with an Evolution Strategy. Fuzzy Days 1994: 33-40
- [c9]Matthias Krause, Pavel Pudlák: On the computational power of depth 2 circuits with threshold and modulo gates. STOC 1994: 48-57
- [i2]Matthias Krause, Pavel Pudlák: On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates. Electronic Colloquium on Computational Complexity (ECCC) 1(23) (1994)
- 1992
- [j7]Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack: Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits. Inf. Comput. 96(2): 168-178 (1992)
- [j6]Matthias Krause, Christoph Meinel, Stephan Waack: Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. ITA 26: 345-362 (1992)
- [j5]Matthias Krause: Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. ITA 26: 507-540 (1992)
- [c8]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes. STACS 1992: 281-292
- [i1]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992)
- 1991
- [j4]Matthias Krause: Lower Bounds for Depth-Restricted Branching Programs. Inf. Comput. 91(1): 1-14 (1991)
- [j3]Stephan Waack, Matthias Krause: On Oblivious Branching Programs of Linear Length. Inf. Comput. 94(2): 232-249 (1991)
- [j2]Matthias Krause, Christoph Meinel, Stephan Waack: Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. Theor. Comput. Sci. 86(2): 267-275 (1991)
- [c7]Matthias Krause: Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. Structure in Complexity Theory Conference 1991: 314-321
- [c6]Matthias Krause, Stephan Waack: Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In. FOCS 1991: 777-782
- 1990
- [c5]Matthias Krause: Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. MFCS 1990: 385-391
1980 – 1989
- 1989
- [c4]Matthias Krause, Christoph Meinel, Stephan Waack: Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. Structure in Complexity Theory Conference 1989: 240-249
- [c3]Matthias Krause, Stephan Waack: On Oblivious Branching Programs of Linear Length (Extended Abstract). FCT 1989: 287-296
- [c2]Matthias Krause, Christoph Meinel, Stephan Waack: Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. IFIP Congress 1989: 287-292
- 1988
- [j1]Matthias Krause: Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. Elektronische Informationsverarbeitung und Kybernetik 24(3): 99-110 (1988)
- [c1]Matthias Krause, Christoph Meinel, Stephan Waack: Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. MFCS 1988: 405-413
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:17 CEST by the dblp team