| Publication | Date of Publication | Type |
|---|
| Separating counting communication complexity classes | 2022-08-18 | Paper |
| Tight security bounds for generic stream cipher constructions | 2020-07-21 | Paper |
| On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks | 2018-05-28 | Paper |
| Design and analysis of small-state grain-like stream ciphers | 2018-05-28 | Paper |
| On realizing iterated multiplication by small depth threshold circuits | 2017-12-04 | Paper |
| On the computational power of depth 2 circuits with threshold and modulo gates | 2016-09-01 | Paper |
| The Cryptographic Power of Random Selection | 2012-06-08 | Paper |
| The Preimage Security of Double-Block-Length Compression Functions | 2011-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086738 | 2011-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081628 | 2011-03-09 | Paper |
| More on the Security of Linear RFID Authentication Protocols | 2009-12-09 | Paper |
| Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators | 2009-04-02 | Paper |
| Design Principles for Combiners with Memory | 2008-03-17 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity | 2007-09-11 | Paper |
| OBDD-based cryptanalysis of oblivious keystream generators | 2007-02-14 | Paper |
| On the computational power of Boolean decision lists | 2006-11-17 | Paper |
| On the influence of the variable ordering for algorithmic learning using OBDDs | 2005-10-10 | Paper |
| On relations between counting communication complexity classes | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737247 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736855 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474216 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471153 | 2004-06-18 | Paper |
| Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149706 | 2002-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762792 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508385 | 2001-03-18 | Paper |
| Computing Boolean functions by polynomials and threshold circuits | 2000-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252754 | 1999-08-31 | Paper |
| On the computational power of depth-2 circuits with threshold and modulo gates | 1998-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364587 | 1998-03-10 | Paper |
| Geometric arguments yield better bounds for threshold circuits and distributed computing | 1997-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718001 | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858953 | 1996-05-27 | Paper |
| Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access | 1993-04-01 | Paper |
| Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines | 1993-01-16 | Paper |
| Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974873 | 1992-06-26 | Paper |
| Lower bounds for depth-restricted branching programs | 1992-06-25 | Paper |
| On oblivious branching programs of linear length | 1991-01-01 | Paper |
| Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359756 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3821583 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804193 | 1988-01-01 | Paper |
