Matthias Krause - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

More on the Security of Linear RFID Authentication ProtocolsMatthias Krause, Dirk Stegemann. sacrypt 2009: 182-196 [doi]

2008

Combination of instruction set simulation and abstract RTOS model execution for fast and accurate target software evaluationMatthias Krause, Dominik Englert, Oliver Bringmann, Wolfgang Rosenstiel. codes 2008: 143-148 [doi]

2007

Timing simulation of interconnected AUTOSAR software-componentsMatthias Krause, Oliver Bringmann, André Hergenhan, Gökhan Tabanoglu, Wolfgang Rosenstiel. date 2007: 474-479 [doi]

OBDD-Based Cryptanalysis of Oblivious Keystream GeneratorsMatthias Krause. mst, 40(1):101-121, 2007. [doi]

2006

Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic ImmunityFrederik Armknecht, Matthias Krause. icalp 2006: 180-191 [doi]

Complexity of Boolean Functions, 12.03. - 17.03.2006Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek, editors, Volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

06111 Abstracts Collection -- Complexity of Boolean FunctionsMatthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek. dagstuhl 2006: [doi]

06111 Executive Summary -- Complexity of Boolean FunctionsMatthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk. dagstuhl 2006: [doi]

On the computational power of Boolean decision listsMatthias Krause. cc, 14(4):362-375, 2006. [doi]

Reducing the Space Complexity of BDD-Based Attacks on Keystream GeneratorsMatthias Krause, Dirk Stegemann. fse 2006: 163-178 [doi]

2005

Design Principles for Combiners with MemoryFrederik Armknecht, Matthias Krause, Dirk Stegemann. indocrypt 2005: 104-117 [doi]

On the influence of the variable ordering for algorithmic learning using OBDDsMatthias Krause, Petr Savický, Ingo Wegener. iandc, 201(2):160-177, 2005. [doi]

2004

On relations between counting communication complexity classesCarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack. jcss, 69(2):259-280, 2004. [doi]

2003

Algebraic Attacks on Combiners with MemoryFrederik Armknecht, Matthias Krause. crypto 2003: 162-175 [doi]

Determining The Optimal Contrast For Secret Sharing Schemes In Visual CryptographyMatthias Krause, Hans-Ulrich Simon. cpc, 12(3), 2003.

2002

On the Computational Power of Boolean Decision ListsMatthias Krause. STACS 2002: 372-383 [doi]

BDD-Based Cryptanalysis of Keystream GeneratorsMatthias Krause. eurocrypt 2002: 222-237 [doi]

2001

2000

1999

Approximations by OBDDs and the Variable Ordering ProblemMatthias Krause, Petr Savický, Ingo Wegener. icalp 1999: 493-502 [doi]

Approximations by OBDDs and the variable ordering problemMatthias Krause, Petr Savický, Ingo Wegener. eccc, 6(11), 1999. [doi]

1998

Computing Boolean Functions by Polynomials and Threshold CircuitsMatthias Krause, Pavel Pudlák. cc, 7(4):346-370, 1998. [doi]

1997

Contrast-Optimal k out of n Secret Sharing Schemes in Visual CryptographyThomas Hofmeister, Matthias Krause, Hans-Ulrich Simon. cocoon 1997: 176-185

On the Computational Power of Depth-2 Circuits with Threshold and Modulo GatesMatthias Krause, Pavel Pudlák. TCS, 174(1-2):137-156, 1997. [doi]

1996

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed ComputingMatthias Krause. TCS, 156(1&2):99-117, 1996. [doi]

1995

Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-InMatthias Krause, Stephan Waack. mst, 28(6):553-564, 1995.

A Note on Realizing Iterated Multiplication by Small Depth Threshold CircuitsMatthias Krause. eccc, 2(9), 1995. [doi]

On Realizing Iterated Multiplication by Small Depth Threshold CircuitsMatthias Krause. STACS 1995: 83-94

On Computing Boolean Functions by Sparse Real PolynomialsMatthias Krause, Pavel Pudlák. focs 1995: 682-691

1994

1992

1991

Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-InMatthias Krause, Stephan Waack. focs 1991: 777-782

Lower Bounds for Depth-Restricted Branching ProgramsMatthias Krause. iandc, 91(1):1-14, March 1991.

Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed ComputingMatthias Krause. cocoon 1991: 314-321

Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_eMatthias Krause, Christoph Meinel, Stephan Waack. TCS, 86(2):267-275, 1991.

On Oblivious Branching Programs of Linear LengthStephan Waack, Matthias Krause. iandc, 94(2):232-249, October 1991.

1990

Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access TimeMatthias Krause. mfcs 1990: 385-391

1989

On Oblivious Branching Programs of Linear Length (Extended Abstract)Matthias Krause, Stephan Waack. fct 1989: 287-296

Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing MachinesMatthias Krause, Christoph Meinel, Stephan Waack. ifip 1989: 287-292

Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing MachinesMatthias Krause, Christoph Meinel, Stephan Waack. cocoon 1989: 240-249

1988

Exponential Lower Bounds on the Complexity of Local and Real-time Branching ProgramsMatthias Krause. eik, 24(3):99-110, 1988.

Separating the Eraser Turing Machine Classes L::e::, NL::e::, co-NL::e:: and P::e::Matthias Krause, Christoph Meinel, Stephan Waack. mfcs 1988: 405-413