| Publication | Date of Publication | Type |
|---|
| Complete and tractable machine-independent characterizations of second-order polytime | 2024-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094117 | 2022-08-02 | Paper |
| A tier-based typed programming language characterizing Feasible Functionals | 2021-01-21 | Paper |
| Type-two polynomial-time and restricted lookahead | 2021-01-20 | Paper |
| Type-two polynomial-time and restricted lookahead | 2020-04-21 | Paper |
| A generalization of Schönemann's theorem via a graph theoretic method | 2019-09-11 | Paper |
| Dynamic graph connectivity in polylogarithmic worst case time | 2019-05-15 | Paper |
| Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes | 2018-07-13 | Paper |
| On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes | 2018-05-17 | Paper |
| Reproducible circularly secure bit encryption: applications and realizations | 2018-02-15 | Paper |
| Resource-bounded continuity and sequentiality for type-two functionals | 2017-06-13 | Paper |
| Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions | 2017-06-13 | Paper |
| The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs | 2017-04-28 | Paper |
| Simultaneous Secrecy and Reliability Amplification for a General Channel Model | 2016-12-21 | Paper |
| On a restricted linear congruence | 2016-11-16 | Paper |
| Restricted linear congruences | 2016-10-26 | Paper |
| Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT | 2016-09-16 | Paper |
| On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes | 2016-04-13 | Paper |
| MMH* with arbitrary modulus is always almost-universal | 2016-04-06 | Paper |
| Reproducible Circularly-Secure Bit Encryption: Applications and Realizations | 2015-12-10 | Paper |
| A framework for non-interactive instance-dependent commitment schemes (NIC) | 2015-10-08 | Paper |
| Gambling, Computational Information and Encryption Security | 2015-09-24 | Paper |
| Lower bound for scalable Byzantine Agreement | 2015-03-10 | Paper |
| Fast asynchronous Byzantine agreement and leader election with full information | 2014-11-18 | Paper |
| Lower bound for scalable Byzantine agreement | 2013-06-28 | Paper |
| Computational Soundness of Coinductive Symbolic Security under Active Attacks | 2013-03-18 | Paper |
| On the Equality of Probabilistic Terms | 2011-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579423 | 2010-08-06 | Paper |
| A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC) | 2007-11-28 | Paper |
| Logics for reasoning about cryptographic constructions | 2006-04-28 | Paper |
| The modal logic of the countable random frame | 2003-09-16 | Paper |
| On characterizations of the basic feasible functionals. I | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501141 | 2000-09-03 | Paper |
| Feasibly continuous type-two functionals | 2000-03-30 | Paper |
| A Note on Negative Tagging for Least Fixed-Point Formulae | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222879 | 1998-12-20 | Paper |
| Limits on the power of parallel random access machines with weak forms of write conflict resolution | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281540 | 1996-07-29 | Paper |
| A new Characterization of Type-2 Feasibility | 1996-06-05 | Paper |
| Zero-one laws for modal logic | 1994-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035304 | 1993-05-18 | Paper |
| Modal sequents and definability | 1987-01-01 | Paper |
