| Publication | Date of Publication | Type |
|---|
| Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits | 2023-08-03 | Paper |
| k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits | 2023-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5871911 | 2023-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075309 | 2022-05-12 | Paper |
| Optimality of Correlated Sampling Strategies | 2020-12-17 | Paper |
| Leading the field: fortune favors the bold in Thurstonian choice models | 2019-01-28 | Paper |
| Time-Space Trade-offs in Population Protocols | 2018-07-16 | Paper |
| RSA Chips (Past/Present/Future) (Extended abstract) | 2018-07-11 | Paper |
| All-or-nothing encryption and the package transform | 2018-05-09 | Paper |
| On the Design and Security of RC2 | 2018-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608043 | 2018-03-15 | Paper |
| A “Paradoxical” Solution to The Signature Problem | 2017-04-10 | Paper |
| Picture-hanging puzzles | 2015-01-21 | Paper |
| The subgraph homeomorphism problem | 2014-03-14 | Paper |
| Coping with errors in binary search procedures (Preliminary Report) | 2014-03-14 | Paper |
| Introduction to algorithms. | 2013-12-12 | Paper |
| \texttt{FlipIt}: the game of ``stealthy takeover | 2013-11-15 | Paper |
| Defending against the Unknown Enemy: Applying FlipIt to System Security | 2013-03-13 | Paper |
| Tweakable block ciphers | 2012-09-21 | Paper |
| The invertibility of the XOR of rotations of a binary word | 2011-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3066732 | 2011-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3651735 | 2009-12-11 | Paper |
| Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 | 2009-08-11 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619797 | 2009-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619846 | 2009-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619798 | 2009-04-09 | Paper |
| Amplifying Collision Resistance: A Complexity-Theoretic Treatment | 2009-03-10 | Paper |
| On the notion of ‘software independence’ in voting systems | 2009-01-21 | Paper |
| Lightweight Email Signatures (Extended Abstract) | 2008-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739521 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474199 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472077 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472072 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409107 | 2003-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4706390 | 2003-06-15 | Paper |
| Piecemeal graph exploration by a mobile robot. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949336 | 2002-12-02 | Paper |
| Introduction to algorithms | 2001-10-14 | Paper |
| Permutation polynomials modulo \(2^w\) | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249327 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941798 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484898 | 2000-06-05 | Paper |
| Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer | 2000-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385518 | 1998-05-04 | Paper |
| On breaking a Huffman code | 1996-07-31 | Paper |
| Diversity-based inference of finite automata | 1995-09-10 | Paper |
| A formal model of hierarchical concept learning | 1995-05-01 | Paper |
| Complete variable-length ``fix-free codes | 1995-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314055 | 1995-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314049 | 1994-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279583 | 1994-09-20 | Paper |
| On choosing between experimenting and thinking when learning | 1994-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279609 | 1994-02-17 | Paper |
| Learning Binary Relations and Total Orders | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140418 | 1993-12-15 | Paper |
| Inference of finite automata using homing sequences | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013558 | 1992-09-27 | Paper |
| Results on learnability and the Vapnik-Chervonenkis dimension | 1991-01-01 | Paper |
| A knapsack-type public key cryptosystem based on arithmetic in finite fields | 1989-01-01 | Paper |
| Inferring decision trees using the minimum description length principle | 1989-01-01 | Paper |
| A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | 1988-01-01 | Paper |
| Is the data encryption standard a group? (Results of cycling experiments on DES) | 1988-01-01 | Paper |
| Game tree searching by min/max approximation | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753361 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203708 | 1988-01-01 | Paper |
| Global wire routing in two-dimensional arrays | 1987-01-01 | Paper |
| Network control by Bayesian broadcast | 1987-01-01 | Paper |
| Estimating a probability using finite memory | 1986-01-01 | Paper |
| Is the Data Encryption Standard a Group? (Preliminary Abstract) | 1986-01-01 | Paper |
| Efficient Factoring Based on Partial Information | 1986-01-01 | Paper |
| A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322997 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671039 | 1983-01-01 | Paper |
| How to reuse a “write-once≓ memory | 1982-01-01 | Paper |
| Coping with errors in binary search procedures | 1980-01-01 | Paper |
| Orthogonal Packings in Two Dimensions | 1980-01-01 | Paper |
| The subgraph homeomorphism problem | 1980-01-01 | Paper |
| On the Polyhedral Decision Problem | 1980-01-01 | Paper |
| Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam | 1979-01-01 | Paper |
| An \(\Omega((n/lg\,n)^{1/2})\) lower bound on the number of additions necessary to compute 0-1 polynomials over the ring of integer polynomials | 1979-01-01 | Paper |
| A method for obtaining digital signatures and public-key cryptosystems | 1978-01-01 | Paper |
| k + 1 Heads Are Better than k | 1978-01-01 | Paper |
| Optimal Arrangement of Keys in a Hash Table | 1978-01-01 | Paper |
| On recognizing graph properties from adjacency matrices | 1977-01-01 | Paper |
| On the Worst-Case Behavior of String-Searching Algorithms | 1977-01-01 | Paper |
| The game of \(N\) questions of a tree | 1977-01-01 | Paper |
| On self-organizing sequential search heuristics | 1976-01-01 | Paper |
| Constructing optimal binary decision trees is NP-complete | 1976-01-01 | Paper |
| Partial-Match Retrieval Algorithms | 1976-01-01 | Paper |
| Linear expected time of a simple union-find algorithm | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131017 | 1976-01-01 | Paper |
| Expected time bounds for selection | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133137 | 1975-01-01 | Paper |
| Asymptotic bounds for the number of convex \(n\)-ominoes | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4048576 | 1974-01-01 | Paper |
| A Procedure for Improving the Upper Bound for the Number of n-Ominoes | 1973-01-01 | Paper |
| Time bounds for selection | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125778 | 1972-01-01 | Paper |
