The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthias Krause: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erik Zenner, Matthias Krause, Stefan Lucks
    Improved Cryptanalysis of the Self-Shrinking Generator. [Citation Graph (0, 0)][DBLP]
    ACISP, 2001, pp:21-35 [Conf]
  2. Matthias Krause
    Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:314-321 [Conf]
  3. Matthias Krause, Christoph Meinel, Stephan Waack
    Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:240-249 [Conf]
  4. Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon
    Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:176-185 [Conf]
  5. Frederik Armknecht, Matthias Krause
    Algebraic Attacks on Combiners with Memory. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:162-175 [Conf]
  6. Matthias Krause
    BDD-Based Cryptanalysis of Keystream Generators. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:222-237 [Conf]
  7. Matthias Krause, Stephan Waack
    On Oblivious Branching Programs of Linear Length (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:287-296 [Conf]
  8. Matthias Krause, Pavel Pudlák
    On Computing Boolean Functions by Sparse Real Polynomials. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:682-691 [Conf]
  9. Matthias Krause, Stephan Waack
    Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:777-782 [Conf]
  10. Matthias Krause, Dirk Stegemann
    Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators. [Citation Graph (0, 0)][DBLP]
    FSE, 2006, pp:163-178 [Conf]
  11. Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
    Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:171-182 [Conf]
  12. Volker Nissen, Matthias Krause
    Constrained Combinatorial Optimization with an Evolution Strategy. [Citation Graph (0, 0)][DBLP]
    Fuzzy Days, 1994, pp:33-40 [Conf]
  13. Frederik Armknecht, Matthias Krause
    Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:180-191 [Conf]
  14. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the Variable Ordering Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:493-502 [Conf]
  15. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:287-292 [Conf]
  16. Frederik Armknecht, Matthias Krause, Dirk Stegemann
    Design Principles for Combiners with Memory. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2005, pp:104-117 [Conf]
  17. Matthias Krause, Hans-Ulrich Simon
    Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:280-291 [Conf]
  18. Matthias Krause
    Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:385-391 [Conf]
  19. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:405-413 [Conf]
  20. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Counting Communication Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:281-292 [Conf]
  21. Matthias Krause
    On the Computational Power of Boolean Decision Lists. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:372-383 [Conf]
  22. Matthias Krause
    On Realizing Iterated Multiplication by Small Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:83-94 [Conf]
  23. Matthias Krause, Stefan Lucks
    On the Minimal Hardware Complexity of Pseudorandom Function Generators. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:419-430 [Conf]
  24. Matthias Krause, Pavel Pudlák
    On the computational power of depth 2 circuits with threshold and modulo gates. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:48-57 [Conf]
  25. Matthias Krause
    On the computational power of Boolean decision lists. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:14, n:4, pp:362-375 [Journal]
  26. Matthias Krause, Stefan Lucks
    Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:297-313 [Journal]
  27. Matthias Krause, Pavel Pudlák
    Computing Boolean Functions by Polynomials and Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:4, pp:346-370 [Journal]
  28. Matthias Krause, Hans-Ulrich Simon
    Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  29. Matthias Krause, Hans-Ulrich Simon
    Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:3, pp:- [Journal]
  30. Matthias Krause, Stefan Lucks
    On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:14, pp:- [Journal]
  31. Matthias Krause
    BDD-based Cryptanalysis of Keystream Generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:078, pp:- [Journal]
  32. Matthias Krause, Pavel Pudlák
    On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:23, pp:- [Journal]
  33. Matthias Krause
    A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:9, pp:- [Journal]
  34. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the variable ordering problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:11, pp:- [Journal]
  35. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Oblivious Linear Length MODp-Branching Program Classes. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:2, pp:63-75 [Journal]
  36. Matthias Krause
    Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:3, pp:99-110 [Journal]
  37. Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
    Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:2, pp:168-178 [Journal]
  38. Matthias Krause
    Lower Bounds for Depth-Restricted Branching Programs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:91, n:1, pp:1-14 [Journal]
  39. Matthias Krause, Petr Savický, Ingo Wegener
    On the influence of the variable ordering for algorithmic learning using OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:201, n:2, pp:160-177 [Journal]
  40. Stephan Waack, Matthias Krause
    On Oblivious Branching Programs of Linear Length [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:2, pp:232-249 [Journal]
  41. Matthias Krause
    Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:507-540 [Journal]
  42. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:345-362 [Journal]
  43. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    On relations between counting communication complexity classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:259-280 [Journal]
  44. Matthias Krause, Stephan Waack
    Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:6, pp:553-564 [Journal]
  45. Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon
    Contrast-optimal k out of n secret sharing schemes in visual cryptography. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:471-485 [Journal]
  46. Matthias Krause
    Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:156, n:1&2, pp:99-117 [Journal]
  47. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:267-275 [Journal]
  48. Matthias Krause, Pavel Pudlák
    On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:137-156 [Journal]
  49. Matthias Krause, Oliver Bringmann, André Hergenhan, Gökhan Tabanoglu, Wolfgang Rosenstiel
    Timing simulation of interconnected AUTOSAR software-components. [Citation Graph (0, 0)][DBLP]
    DATE, 2007, pp:474-479 [Conf]
  50. Matthias Krause
    OBDD-Based Cryptanalysis of Oblivious Keystream Generators. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:1, pp:101-121 [Journal]

  51. Combination of instruction set simulation and abstract RTOS model execution for fast and accurate target software evaluation. [Citation Graph (, )][DBLP]


  52. 06111 Abstracts Collection -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  53. 06111 Executive Summary -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  54. More on the Security of Linear RFID Authentication Protocols. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.066secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002