Zeitschriftenartikel

Hamann, Matthias ; Moch, Alexander ; Krause, Matthias ; Mikhalev, Vasily (2022) The DRACO stream cipher: a power-efficient small-state stream cipher with full provable security against TMDTO attacks. IACR Transactions on Symmetric Cryptology Bochum 2022 2 1-42 [Zeitschriftenartikel]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi ; Zhang, Bin (2018) Design and analysis of small-state grain-like stream ciphers. Cryptography and Communications New York, NY [u.a.] 10 5 803-834 [Zeitschriftenartikel]

Hamann, Matthias ; Krause, Matthias (2018) On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptography and Communications New York, NY [u.a.] 10 5 959-1012 [Zeitschriftenartikel]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2017) LIZARD - A lightweight stream cipher for power-constrained devices. IACR Transactions on Symmetric Cryptology Bochum 2017 1 45-79 [Zeitschriftenartikel]

Krause, Matthias (2007) OBDD-based cryptanalysis of oblivious keystream generators. Theory of Computing Systems New York, NY [u.a.] 40 1 101-121 [Zeitschriftenartikel]

Krause, Matthias (2006) On the computational power of Boolean decision lists. Computational Complexity : CC Cham 14 4 362-375 [Zeitschriftenartikel]

Krause, Matthias ; Savický, Petr ; Wegener, Ingo (2005) On the influence of the variable ordering for algorithmic learning using OBDDs. Information and Computation Amsterdam 201 2 160-177 [Zeitschriftenartikel]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (2004) On relations between counting communication complexity classes. Journal of Computer and System Sciences : JCSS San Diego, CA [u.a.] 69 2 259-280 [Zeitschriftenartikel]

Krause, Matthias ; Simon, Hans Ulrich (2003) Determining the optimal contrast for secret sharing schemes in visual cryptography. Combinatorics, Probability & Computing : CPC Cambridge 12 3 285-299 [Zeitschriftenartikel]

Krause, Matthias ; Lucks, Stefan (2001) Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. Computational Complexity : CC Cham 10 4 297-313 [Zeitschriftenartikel]

Hofmeister, Thomas ; Krause, Matthias ; Simon, Hans Ulrich (2000) Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theoretical Computer Science Amsterdam [u.a.] 240 2 471-485 [Zeitschriftenartikel]

Krause, Matthias ; Pudlák, Pavel (1998) Computing Boolean functions by polynomials and threshold circuits. Computational Complexity Berlin [u.a.] 7 4 346-370 [Zeitschriftenartikel]

Krause, Matthias ; Pudlák, Pavel (1997) On the computational power of depth 2 circuits with threshold and modulo gates. Theoretical Computer Science Amsterdam [u.a.] 174 1/2 137-156 [Zeitschriftenartikel]

Krause, Matthias (1996) Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science Amsterdam [u.a.] 156 1/2 99-117 [Zeitschriftenartikel]

Krause, Matthias ; Waack, Stephan (1995) Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in. Mathematical Systems Theory New York, NY [u.a.] 28 6 553-564 [Zeitschriftenartikel]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1994) Separating oblivious linear length MODp-branching program classes. Journal of Information Processing and Cybernetics Giessen 30 2 63-75 [Zeitschriftenartikel]

Hromkovič, Juraj ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuits. Information and Computation Amsterdam [u.a.] 96 2 168-178 [Zeitschriftenartikel]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. RAIRO. Theoretical Informatics and Applications Les Ulis 26 4 345-362 [Zeitschriftenartikel]

Krause, Matthias (1992) Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access. RAIRO. Theoretical Informatics and Applications Les Ulis 26 6 507-522 [Zeitschriftenartikel]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1991) Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science Amsterdam [u.a.] 86 2 267-275 [Zeitschriftenartikel]

Krause, Matthias ; Waack, Stephan (1991) On oblivious branching programs of linear length. Information and Computation Amsterdam [u.a.] 94 2 232-249 [Zeitschriftenartikel]

Krause, Matthias (1991) Lower bounds for depth-restricted branching programs. Information and Computation Amsterdam [u.a.] 91 1 1-14 [Zeitschriftenartikel]

Krause, Matthias (1988) Exponential lower bounds on the complexity of local and real-time branching programs. EIK : Journal of Information Processing and Cybernetics Giessen 24 3 99-110 [Zeitschriftenartikel]

Buch

Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van (2006) Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings Wadern 6111 [Buch]

Buchkapitel

Hertling, Claus ; Krause, Matthias ; Schmidt, Martin U. ORCID: 0000-0002-1775-4701 (2021) Innovation, Interdisziplinarität und Internationalität: Die Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik. Borgstedt, Angela ; Eichfelder, Sandra ; Gassert, Philipp Eine Universität für die Gesellschaft : 75 Jahre Neubegründung Wirtschaftshochschule und Universität Mannheim Ubstadt-Weiher 129-132 [Buchkapitel]

Krause, Matthias ; Wegener, Ingo (2010) Circuit complexity. Crama, Yves ; Hammer, Peter L. Boolean models and methods in mathematics, computer science, and engineering Encyclopedia of Mathematics and its Applications Cambridge [u.a.] 134 506-530 [Buchkapitel]

Dissertation

Krause, Matthias (1989) Untere Schranken für Berechnungen durch Verzweigungsprogramme. Berlin [Dissertation]

Konferenzveröffentlichung

Hamann, Matthias ; Krause, Matthias ; Moch, Alexander Tight security bounds for generic stream cipher constructions. Paterson, Kenneth G. ; Stebila, Douglas Lecture Notes in Computer Science 11959 335-364 In: Selected areas in cryptography - SAC 2019 : 26th international conference, Waterloo, ON, Canada, August 12-16, 2019 : revised selected papers (2020) Berlin [u.a.] SAC 2019 (Waterloo, ON) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Hamann, Matthias ; Krause, Matthias Hardware Efficient Authentication based on Random Selection. Katzenbeisser, Stefan GI-Edition : Lecture Notes in Informatics. Proceedings 228 169-185 In: Sicherheit 2014 - Sicherheit, Schutz und Zuverlässigkeit : [Beiträge der 7. Jahrestagung des Fachbereichs Sicherheit in der Gesellschaft für Informatik e. V. (GI);] 19. - 21. März 2014 in Wien (2014) Bonn [Konferenzveröffentlichung]

Kasten, Andreas ; Scherp, Ansgar ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Towards Search on Encrypted Graph Data. Decker, Stefan CEUR Workshop Proceedings 1121 Paper 5 In: PrivOn 2013 : Proceedings of the Workshop on Society, Privacy and the Semantic Web - Policy and Technology (PrivOn2013) co-located with the 12th International Semantic Web Conference (ISWC 2013) Sydney, Australia, October 22, 2013 (2013) Aachen, Germany [Konferenzveröffentlichung]

Krause, Matthias ; Hamann, Matthias The Cryptographic Power of Random Selection. Miri, Ali Lecture Notes in Computer Science 7118 134-150 In: Selected Areas in Cryptography (2012) Berlin [u.a.] (Toronto, Canada) [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Fleischmann, Ewan ; Krause, Matthias ; Lee, Jooyoung ; Stam, Martijn ; Steinberger, John The preimage security of double-block-length compression functions. Lee, Dong Hoon Lecture Notes in Computer Science 7073 233-251 In: Advances in cryptology : proceedings / ASIACRYPT 2011, 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4 - 8, 2011 (2011) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Stegemann, Dirk More on the Security of Linear RFID Authentication Protocols. Jacobson, Michael J. Lecture Notes in Computer Science 5867 182-196 In: Selected areas in cryptography : 16th International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13 - 14, 2009; revised selected paper (2009) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Stegemann, Dirk Algebraic Attacks against Linear RFID Authentication Protocols. Dagstuhl Seminar Proceedings 09031 No. 9 (2009) Wadern [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Abstracts collection - Complexity of Boolean functions. Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Dagstuhl Seminar Proceedings 6111 1 In: Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03. - 17.03.2006 (2006) Wadern Complexity of Boolean Functions (Dagstuhl, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Melkebeek, Dieter van ; Pudlák, Pavel ; Reischuk, Rüdiger Executive Summary of the Dagstuhl Seminar 06111 "Complexity of Boolean Functions". Krause, Matthias ; Pudlák, Pavel ; Reischuk, Rüdiger ; Melkebeek, Dieter van Dagstuhl Seminar Proceedings 6111 1-5 In: Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03 - 17.03.2006 (2006) Wadern Complexity of Boolean Functions (Dagstuhl, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Stegemann, Dirk Reducing the Space Complexity of BDD-based Attacks on Keystream Generators. Robshaw, Matthew Fast Software Encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 - 17, 2006; revised selected papers 4047 163-178 In: Fast software encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 - 17, 2006; revised selected papers (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. Bugliesi, Michele Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 - 14, 2006; proceedings 2 180-191 In: Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 - 14, 2006; proceedings (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias ; Stegemann, Dirk Design Principles for Combiners with Memory. Maitra, Subhamoy Lecture Notes in Computer Science 3797 104-117 In: Progress in cryptology - INDOCRYPT 2005 : 6th International Conference on Cryptology in India, Bangalore, India; proceedings (2005) Berlin [u.a.] [Konferenzveröffentlichung]

Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Krause, Matthias Algebraic attacks on combiners with memory. Boneh, Dan Lecture Notes in Computer Science 2729 162-175 In: Advances in cryptology - CRYPTO 2003 : 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17 - 21, 2003; proceedings (2003) Berlin [u.a.] CRYPTO 2003 (Santa Barbara, CA) [Konferenzveröffentlichung]

Krause, Matthias BDD-based Cryptanalysis of Keystream Generators. Knudsen, Lars Lecture Notes in Computer Science 2332 222-237 In: Advances in cryptology - EUROCRYPT 2002 : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002; proceedings (2002) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias On the Computational Power of Boolean Decision Lists. Alt, Helmut STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes- Juan les Pins, France, March 14 - 16, 2002; proceedings 372-383 In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes- Juan les Pins, France, March 14 - 16, 2002; proceedings (2002) Berlin [Konferenzveröffentlichung]

Zenner, Erik ; Krause, Matthias ; Lucks, Stefan Improved Cryptanalysis of the Self-Shrinking Generator. Varadharajan, Vijay Lecture Notes in Computer Science 2119 21-35 In: Information security and privacy : 6th Australasian Conference, ACISP 2001, Sydney, Australia, July 11 - 13, 2001; proceedings (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Lucks, Stefan On the Minimal Hardware Complexity of Pseudorandom Function Generators. Ferreira, Afonso Lecture Notes in Computer Science 2010 419-430 In: Proceedings STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15 - 17, 2001 (2001) Berlin [u.a.] [Konferenzveröffentlichung]

Forster, Jürgen ; Krause, Matthias ; Lokam, Satyanarayana V. ; Mubarakzjanov, Rustam ; Schmitt, Niels ; Simon, Hans Ulrich Relations between communication complexity, linear arrangements, and computational complexity. Hariharan, Ramesh ; Vinay, V. ; Mukund, Madhavan Lecture Notes in Computer Science 2245 171-182 In: FST TCS 2001: Foundations of software technology and theoretical computer science : 21st Conference, Bangalore, India, December 13–15, 2001, proceedings (2001) Berlin [u.a.] FST TCS 2001 (Bangaluru, India) [Konferenzveröffentlichung]

Krause, Matthias ; Simon, Hans Ulrich Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. Gonnet, Gastón H. Lecture Notes in Computer Science 1776 280-291 In: LATIN 2000: Theoretical informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10 - 14, 2000; proceedings (2000) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Savický, Petr ; Wegener, Ingo Approximations by OBDDs and the variable ordering problem. Wiedermann, Jiri Lecture Notes in Computer Science 1644 Nr.164 493-502 In: Automata, languages and programming : 26th International Colloquium, ICALP '99, Prague, Czech Republik, July 11 - 15, 1999; proceedings (1999) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias ; Simon, Hans Ulrich ; Hofmeister, Thomas Contrast-optimal k out of n secret sharing schemes in visual cryptography. Jiang, Tao Lecture Notes in Computer Science 1276 176-185 In: Computing and combinatorics : third Annual International Conference COCOON '97, Shanghai, China, August 20-22, 1997; proceedings (1997) Berlin [u.a.] [Konferenzveröffentlichung]

Krause, Matthias On realizing iterated multiplication by small depth threshold circuits. Mayr, Ernst W. ; Puech, Claude Lecture Notes in Computer Science 900 83-94 In: STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, proceedings (1995) Berlin [u.a.] STACS 95 (München, Germany) [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel On computing Boolean functions by sparse real polynomials. Raghavan, Prabhakar 682-691 In: 36th Annual Symposium on Foundations of Computer Science : October 23 - 25, 1995, Milwaukee, Wisconsin, proceedings (1995) Los Alamitos, CA [u.a.] FOCS 1995 (Milwaukee, WI) [Konferenzveröffentlichung]

Krause, Matthias ; Pudlák, Pavel On the computational power of depth 2 circuits with threshold and modulo gates. Leighton, F. Tom ; Goodrich, Michael 48-57 In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing : Montréal, Québec, Canada, May 23 - 25, 1994 (1994) New York, NY STOC '94 (Montreal, QC) [Konferenzveröffentlichung]

Nissen, Volker ; Krause, Matthias Constrained combinatorial optimization with an evolution strategy. Reusch, Bernd 33-40 In: Fuzzy Logik : Theorie und Praxis, 4. Dortmunder Fuzzy-Tage, Dortmund, 6.-8. Juni 1994 (1994) Berlin ; Heidelberg [u.a.] 4. Dortmunder Fuzzy-Tage (Dortmund, Germany) [Konferenzveröffentlichung]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating counting communication complexity classes. Finkel, Alain ; Jantzen, Matthias Lecture Notes in Computer Science 577 279-292 In: STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13 - 15, 1992, proceedings (1992) Berlin [u.a.] STACS 92 (Cachan, France) [Konferenzveröffentlichung]

Krause, Matthias Geometric arguments yield better bounds for threshold circuits and distributed computing. 314-321 In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, June 30 - July 3, 1991, University of Chicago, Chicago, Illinois (1991) Los Alamitos, CA [u.a.] 6th Annual Structure in Complexity Theory Conference (Chicago, IL) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in. Sipser, Michael 1 777-782 In: 32nd Annual Symposium on Foundations of Computer Science : San Juan, Puerto Rico, October 1 - 4, 1991, proceedings (1991) Los Alamitos, CA [u.a.] FOCS 1991 (San Juan, Puerto Rico) [Konferenzveröffentlichung]

Krause, Matthias Separating ⊕L from L, NL, co-NL and AL (=P) for oblivious turing machines of linear access time. Rovan, Branislav Lecture Notes in Computer Science 452 385-391 In: Mathematical Foundations of Computer Science 1990 : Banská Bystrica, Czechoslovakia, August 27–31, 1990, proceedings (1990) Berlin [u.a.] MFCS 1990 (Banská Bystrica, Czechoslovakia) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan On oblivious branching programs of linear length. Csirik, János ; Demetrovics, János ; Gécseg, Ferenc Lecture Notes in Computer Science 380 287-296 In: Fundamentals of computation theory : International Conference FCT '89, Szeged, Hungary, August 21 - 25, 1989, proceedings (1989) Berlin [u.a.] FCT '89 (Szeged, Hungary) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Young, Paul 240-249 In: Structure in complexity theory : Fourth Annual Conference, June 19 - 22, 1989, University of Oregon, Eugene, Oregon, proceedings (1989) Washington, DC [u.a.] 4th Annual Conference on Structure in Complexity Theory (Eugene, OR) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to restricted logarithmic space-bounded Turing machines. Ritter, Gerhard X. IFIP congress series 11 287-292 In: Information Processing 89 : Proceedings of the IFIP 11th World Computer Congress, San Francisco, U.S.A., August 28 - September 1, 1989 (1989) Amsterdam [u.a.] IFIP '89 (San Francisco, CA) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating the eraser turing machine classes Le, NLe, co-NLe and Pe. Chytil, Michal P. ; Janiga, Ladislav ; Koubek, Václav Lecture Notes in Computer Science 324 405-413 In: Mathematical Foundations of Computer Science 1988 : proceedings of the 13th Symposium, Carlsbad, Czechoslovakia, August 29 – September 2, 1988 (1988) Berlin [u.a.] MFCS '88 (Carlsbad, Czechoslovakia) [Konferenzveröffentlichung]

Arbeitspapier

Hamann, Matthias ; Krause, Matthias (2019) Tight security bounds for generic stream cipher constructions. Cryptology ePrint Archive Santa Barbara, CA Report 2019/007 [Arbeitspapier]

Krause, Matthias (2017) On the hardness of trivium and grain with respect to generic time-memory-data trade off attacks. Cryptology ePrint Archive Santa Barbara, CA Report 2017/289 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi ; Zhang, Bin (2017) Time-memory-data tradeoff attacks against small-state stream ciphers. Cryptology ePrint Archive Santa Barbara, CA Report 2017/384 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2017) A note on stream ciphers that continuously use the IV. Cryptology ePrint Archive Santa Barbara, CA Report 2017/1172 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias ; Meier, Willi (2016) LIZARD – A lightweight stream cipher for power-constrained devices. Cryptology ePrint Archive Santa Barbara, CA Report 2016/926 [Arbeitspapier]

Krause, Matthias (2015) Analyzing constructions for key-alternating pseudorandom functions with applications to stream cipher operation modes. Cryptology ePrint Archive Santa Barbara, CA Report 2015/636 [Arbeitspapier]

Hamann, Matthias ; Krause, Matthias (2015) Stream cipher operation modes with improved security against generic collision attacks. Cryptology ePrint Archive Santa Barbara, CA Report 2015/757 [Arbeitspapier]

Krause, Matthias ; Hamann, Matthias (2011) The cryptographic power of random selection. Cryptology ePrint Archive Santa Barbara, CA Report 2011/511 [Arbeitspapier]

Krause, Matthias ; Armknecht, Frederik ORCID: 0009-0003-9935-8095 ; Fleischmann, Ewan (2010) Preimage resistance beyond the birthday bound: Double-length hashing revisited. Cryptology ePrint Archive Santa Barbara, CA Report 2010/519 [Arbeitspapier]

Vorschau

Krause, Matthias (2001) BDD-based cryptanalysis of keystream generators. Cryptology ePrint Archive Santa Barbara, CA Report 2001/092 [Arbeitspapier]

Krause, Matthias ; Simon, Hans Ulrich (2000) Determining the optimal contrast for secret sharing schemes in visual cryptography. Electronic Colloquium on Computational Complexity : ECCC Trier TR00-003 [Arbeitspapier]

Krause, Matthias ; Lucks, Stefan (2000) On learning versus distinguishing and the minimal hardware complexity of pseudorandom function generators. Electronic Colloquium on Computational Complexity : ECCC Trier TR00-014 [Arbeitspapier]

Krause, Matthias ; Savický, Petr ; Wegener, Ingo (1999) Approximations by OBDDs and the variable ordering problem. Electronic Colloquium on Computational Complexity : ECCC Trier TR99-011 [Arbeitspapier]

Krause, Matthias (1995) A note on realizing iterated multiplication by small depth threshold circuits. Electronic Colloquium on Computational Complexity : ECCC Trier TR95-009 [Arbeitspapier]

Krause, Matthias ; Pudlák, Pavel (1994) On the computational power of depth 2 circuits with threshold and modulo gates. Electronic Colloquium on Computational Complexity : ECCC Trier TR94-023 [Arbeitspapier]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating counting communication complexity classes. Forschungsbericht / Universität Trier, Mathematik, Informatik Trier 92-01 [Arbeitspapier]

Habilitation

Krause, Matthias (1993) Zur Berechnung Boolescher Funktionen durch Branching Programme und Schaltkreise kleiner Tiefe. Dortmund [Habilitation]

Abschlussarbeit

Krause, Matthias (1986) Exponentielle untere Schranken für one-time-only Branching Programme. Berlin [Abschlussarbeit]