| Publication | Date of Publication | Type |
|---|
| Sorting and Selection with Imprecise Comparisons | 2018-10-30 | Paper |
| Determinism versus non-determinism for linear time RAMs (extended abstract) | 2016-09-29 | Paper |
| The independence of the modulo p counting principles | 2016-09-01 | Paper |
| Compactly encoding unstructured inputs with differential compression | 2015-12-07 | Paper |
| A sieve algorithm for the shortest lattice vector problem | 2015-02-27 | Paper |
| Oblivious RAMs without cryptogrpahic assumptions | 2014-08-13 | Paper |
| Lower bounds for RAMs and quantifier elimination | 2014-08-07 | Paper |
| Secure computation with information leaking to an adversary | 2014-06-05 | Paper |
| Determinism versus nondeterminism with arithmetic tests and computation | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414564 | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002761 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002791 | 2011-05-24 | Paper |
| The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice | 2010-08-16 | Paper |
| Representing hard lattices with O(n log n) bits | 2010-08-16 | Paper |
| A conjecture about polynomial time computable lattice-lattice functions | 2010-08-15 | Paper |
| Approximate counting of inversions in a data stream | 2010-08-05 | Paper |
| The invasiveness of off-line memory checking | 2010-08-05 | Paper |
| Sorting and Selection with Imprecise Comparisons | 2009-07-14 | Paper |
| An Architecture for Provably Secure Computation | 2008-09-18 | Paper |
| Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures | 2007-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465355 | 2005-08-22 | Paper |
| Determinism versus nondeterminism for linear time RAMs with memory restrictions | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787194 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542515 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542549 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938616 | 2002-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228443 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228444 | 2002-01-20 | Paper |
| Improved Algorithms and Analysis for Secretary Problems and Generalizations | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526993 | 2001-02-28 | Paper |
| The closure of monadic NP | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252732 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228459 | 1999-05-18 | Paper |
| Fairness in Scheduling | 1999-01-17 | Paper |
| Worst-case complexity, average-case complexity and lattice problems | 1998-08-05 | Paper |
| A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension | 1997-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871074 | 1996-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886081 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850543 | 1996-03-31 | Paper |
| Recursive construction for 3-regular expanders | 1995-02-01 | Paper |
| The complexity of the pigeonhole principle | 1995-02-01 | Paper |
| Datalog vs first-order logic | 1995-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287354 | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284606 | 1994-03-24 | Paper |
| The influence of large coalitions | 1993-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035300 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036706 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972306 | 1992-06-25 | Paper |
| Construction of a Thin Set with small Fourier Coefficients | 1990-01-01 | Paper |
| Reachability is harder for directed than for undirected finite graphs | 1990-01-01 | Paper |
| Optimal parallel selection has complexity O(log log N) | 1989-01-01 | Paper |
| First-order definability on finite structures | 1989-01-01 | Paper |
| Sorting in Average Time $o(\log \,n)$ | 1989-01-01 | Paper |
| A lower bound for finding predecessors in Yao's cell probe model | 1988-01-01 | Paper |
| The Set of Continuous Functions with the Everywhere Convergent Fourier Series | 1987-01-01 | Paper |
| Monotone versus positive | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698835 | 1985-01-01 | Paper |
| On optimal matchings | 1984-01-01 | Paper |
| Hash functions for priority queues | 1984-01-01 | Paper |
| \(\Sigma_ 1^ 1\)-formulae on finite structures | 1983-01-01 | Paper |
| Sorting in \(c \log n\) parallel steps | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318963 | 1983-01-01 | Paper |
| Extremal uncrowded hypergraphs | 1982-01-01 | Paper |
| Largest random component of a k-cube | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956992 | 1982-01-01 | Paper |
| A dense infinite Sidon sequence | 1981-01-01 | Paper |
| The longest path in a random graph | 1981-01-01 | Paper |
| On Turan's theorem for sparse graphs | 1981-01-01 | Paper |
| A note on Ramsey numbers | 1980-01-01 | Paper |
| Isomorphism and higher order equivalence | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950589 | 1979-01-01 | Paper |
| There is no fast single hashing algorithm | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3906644 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4059020 | 1975-01-01 | Paper |
| On the boundedness of definable linear operators | 1974-01-01 | Paper |
| On a class of finite lattices | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5674034 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079651 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5575665 | 1969-01-01 | Paper |
