 | 2009 |
|---|
| 56 |       | Matthias Krause,
Dirk Stegemann:
More on the Security of Linear RFID Authentication Protocols.
Selected Areas in Cryptography 2009: 182-196 |
| 2008 |
|---|
| 55 | | 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 |
|---|
| 54 | | Matthias Krause,
Oliver Bringmann,
André Hergenhan,
Gökhan Tabanoglu,
Wolfgang Rosenstiel:
Timing simulation of interconnected AUTOSAR software-components.
DATE 2007: 474-479 |
| 53 | | Matthias Krause:
OBDD-Based Cryptanalysis of Oblivious Keystream Generators.
Theory Comput. Syst. 40(1): 101-121 (2007) |
| 2006 |
|---|
| 52 |  | Matthias Krause,
Pavel Pudlák,
Rüdiger Reischuk,
Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 51 | | Matthias Krause,
Pavel Pudlák,
Rüdiger Reischuk,
Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions.
Complexity of Boolean Functions 2006 |
| 50 | | Matthias Krause,
Dieter van Melkebeek,
Pavel Pudlák,
Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions.
Complexity of Boolean Functions 2006 |
| 49 | | Matthias Krause,
Dirk Stegemann:
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators.
FSE 2006: 163-178 |
| 48 | | Frederik Armknecht,
Matthias Krause:
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity.
ICALP (2) 2006: 180-191 |
| 47 | | Matthias Krause:
On the computational power of Boolean decision lists.
Computational Complexity 14(4): 362-375 (2006) |
| 2005 |
|---|
| 46 | | Frederik Armknecht,
Matthias Krause,
Dirk Stegemann:
Design Principles for Combiners with Memory.
INDOCRYPT 2005: 104-117 |
| 45 | | 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) |
| 2004 |
|---|
| 44 | | 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 |
|---|
| 43 | | Frederik Armknecht,
Matthias Krause:
Algebraic Attacks on Combiners with Memory.
CRYPTO 2003: 162-175 |
| 42 | | Matthias Krause,
Hans-Ulrich Simon:
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography.
Combinatorics, Probability & Computing 12(3): (2003) |
| 2002 |
|---|
| 41 | | Matthias Krause:
BDD-Based Cryptanalysis of Keystream Generators.
EUROCRYPT 2002: 222-237 |
| 40 | | Matthias Krause:
On the Computational Power of Boolean Decision Lists.
STACS 2002: 372-383 |
| 2001 |
|---|
| 39 | | Erik Zenner,
Matthias Krause,
Stefan Lucks:
Improved Cryptanalysis of the Self-Shrinking Generator.
ACISP 2001: 21-35 |
| 38 | | 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 |
| 37 | | Matthias Krause,
Stefan Lucks:
On the Minimal Hardware Complexity of Pseudorandom Function Generators.
STACS 2001: 419-430 |
| 36 | | Matthias Krause,
Stefan Lucks:
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.
Computational Complexity 10(4): 297-313 (2001) |
| 35 | | Matthias Krause:
BDD-based Cryptanalysis of Keystream Generators
Electronic Colloquium on Computational Complexity (ECCC)(078): (2001) |
| 2000 |
|---|
| 34 | | Matthias Krause,
Hans-Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography.
LATIN 2000: 280-291 |
| 33 | | 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) |
| 32 | | 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) |
| 31 | | 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) |
| 1999 |
|---|
| 30 | | Matthias Krause,
Petr Savický,
Ingo Wegener:
Approximations by OBDDs and the Variable Ordering Problem.
ICALP 1999: 493-502 |
| 29 | | Matthias Krause,
Petr Savický,
Ingo Wegener:
Approximations by OBDDs and the variable ordering problem
Electronic Colloquium on Computational Complexity (ECCC) 6(11): (1999) |
| 1998 |
|---|
| 28 | | Matthias Krause,
Pavel Pudlák:
Computing Boolean Functions by Polynomials and Threshold Circuits.
Computational Complexity 7(4): 346-370 (1998) |
| 1997 |
|---|
| 27 | | Thomas Hofmeister,
Matthias Krause,
Hans-Ulrich Simon:
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography.
COCOON 1997: 176-185 |
| 26 | | 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) |
| 1996 |
|---|
| 25 | | Matthias Krause:
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing.
Theor. Comput. Sci. 156(1&2): 99-117 (1996) |
| 1995 |
|---|
| 24 | | Matthias Krause,
Pavel Pudlák:
On Computing Boolean Functions by Sparse Real Polynomials.
FOCS 1995: 682-691 |
| 23 | | Matthias Krause:
On Realizing Iterated Multiplication by Small Depth Threshold Circuits.
STACS 1995: 83-94 |
| 22 | | Matthias Krause:
A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits
Electronic Colloquium on Computational Complexity (ECCC) 2(9): (1995) |
| 21 | | 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) |
| 1994 |
|---|
| 20 | | Volker Nissen,
Matthias Krause:
Constrained Combinatorial Optimization with an Evolution Strategy.
Fuzzy Days 1994: 33-40 |
| 19 | | Matthias Krause,
Pavel Pudlák:
On the computational power of depth 2 circuits with threshold and modulo gates.
STOC 1994: 48-57 |
| 18 | | 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) |
| 17 | | 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) |
| 1992 |
|---|
| 16 | | Carsten Damm,
Matthias Krause,
Christoph Meinel,
Stephan Waack:
Separating Counting Communication Complexity Classes.
STACS 1992: 281-292 |
| 15 | | Matthias Krause,
Christoph Meinel,
Stephan Waack:
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines.
ITA 26: 345-362 (1992) |
| 14 | | Matthias Krause:
Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access.
ITA 26: 507-540 (1992) |
| 13 | | 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) |
| 12 | | Carsten Damm,
Matthias Krause,
Christoph Meinel,
Stephan Waack:
Separating Counting Communication Complexity Classes
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01: (1992) |
| 1991 |
|---|
| 11 | | 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 |
| 10 | | Matthias Krause:
Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing.
Structure in Complexity Theory Conference 1991: 314-321 |
| 9 | | Matthias Krause:
Lower Bounds for Depth-Restricted Branching Programs
Inf. Comput. 91(1): 1-14 (1991) |
| 8 | | Stephan Waack,
Matthias Krause:
On Oblivious Branching Programs of Linear Length
Inf. Comput. 94(2): 232-249 (1991) |
| 7 | | 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) |
| 1990 |
|---|
| 6 | | Matthias Krause:
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.
MFCS 1990: 385-391 |
| 1989 |
|---|
| 5 | | Matthias Krause,
Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract).
FCT 1989: 287-296 |
| 4 | | Matthias Krause,
Christoph Meinel,
Stephan Waack:
Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines.
IFIP Congress 1989: 287-292 |
| 3 | | 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 |
| 1988 |
|---|
| 2 | | Matthias Krause,
Christoph Meinel,
Stephan Waack:
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe.
MFCS 1988: 405-413 |
| 1 | | Matthias Krause:
Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs.
Elektronische Informationsverarbeitung und Kybernetik 24(3): 99-110 (1988) |
