Matthias Krause Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Frederik Armknecht [43] [46] [48]
2Oliver Bringmann [54] [55]
3Carsten Damm [12] [16] [17] [44]
4Dominik Englert [55]
5Jürgen Forster [38]
6André Hergenhan [54]
7Thomas Hofmeister [27] [31]
8Juraj Hromkovic [13]
9Satyanarayana V. Lokam [38]
10Stefan Lucks [33] [36] [37] [39]
11Christoph Meinel [2] [3] [4] [7] [12] [13] [15] [16] [17] [44]
12Dieter van Melkebeek [50] [51] [52]
13Rustam Mubarakzjanov [38]
14Volker Nissen [20]
15Pavel Pudlák [18] [19] [24] [26] [28] [50] [51] [52]
16Rüdiger Reischuk [50] [51] [52]
17Wolfgang Rosenstiel [54] [55]
18Petr Savický [29] [30] [45]
19Niels Schmitt [38]
20Hans-Ulrich Simon [27] [31] [32] [34] [38] [42]
21Dirk Stegemann [46] [49] [56]
22Gökhan Tabanoglu [54]
23Stephan Waack [2] [3] [4] [5] [7] [8] [11] [12] [13] [15] [16] [17] [21] [44]
24Ingo Wegener [29] [30] [45]
25Erik Zenner [39]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)