| Publication | Date of Publication | Type |
|---|
| Practical settlement bounds for longest-chain consensus | 2024-02-02 | Paper |
| Approximating latin square extensions | 2024-01-29 | Paper |
| A composable security treatment of ECVRF and batch verifications | 2023-07-28 | Paper |
| Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol | 2023-06-28 | Paper |
| Germ order for one-dimensional packings | 2022-08-02 | Paper |
| Fast isomorphic state channels | 2022-06-22 | Paper |
| Dynamic ad hoc clock synchronization | 2021-12-08 | Paper |
| Quantum-access-secure message authentication via blind-unforgeability | 2021-12-01 | Paper |
| Efficient simulation of random states and random unitaries | 2021-12-01 | Paper |
| Ledger combiners for fast settlement | 2021-12-01 | Paper |
| The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains | 2021-02-02 | Paper |
| The complexity of synchronous iterative Do-All with crashes | 2020-12-04 | Paper |
| Let a non-barking watchdog bite: cliptographic signatures with an offline watchdog | 2020-01-28 | Paper |
| Small-Support Uncertainty Principles on $\mathbb{Z}/p$ over Finite Fields | 2019-06-12 | Paper |
| Correcting subverted random oracles | 2018-09-26 | Paper |
| Markovian Hitters and the Complexity of Blind Rendezvous | 2018-07-16 | Paper |
| Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain | 2018-07-09 | Paper |
| How to Realize a Graph on Random Points | 2018-04-23 | Paper |
| Work-Competitive Scheduling on Task Dependency Graphs | 2017-12-15 | Paper |
| Ouroboros: a provably secure proof-of-stake blockchain protocol | 2017-11-03 | Paper |
| Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts | 2017-06-23 | Paper |
| Cliptography: Clipping the Power of Kleptographic Attacks | 2017-01-06 | Paper |
| Codes, lower bounds, and phase transitions in the symmetric rendezvous problem | 2017-01-05 | Paper |
| Dealing with Undependable Workers in Decentralized Network Supercomputing | 2016-12-19 | Paper |
| Lower bounds for leader election and collective coin-flipping in the perfect information model | 2016-09-29 | Paper |
| Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation | 2016-09-01 | Paper |
| A note on optical routing on trees | 2016-05-26 | Paper |
| Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups | 2015-11-27 | Paper |
| Group representations that resist random sampling | 2015-11-13 | Paper |
| Generic quantum Fourier transforms | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501376 | 2015-08-03 | Paper |
| Generic quantum Fourier transforms | 2015-08-03 | Paper |
| Optimal $\varepsilon$-Biased Sets with Just a Little Randomness | 2015-07-31 | Paper |
| Efficient probabilistically checkable proofs and applications to approximations | 2015-05-07 | Paper |
| Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups | 2015-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934717 | 2014-12-18 | Paper |
| Dealing with undependable workers in decentralized network supercomputing | 2014-12-02 | Paper |
| Limitations of quantum coset states for graph isomorphism | 2014-11-25 | Paper |
| Quantum algorithms for Simon's problem over nonabelian groups | 2014-11-18 | Paper |
| Normal subgroup reconstruction and quantum computation using group representations | 2014-09-26 | Paper |
| Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions | 2014-08-22 | Paper |
| An Entropic Proof of Chang's Inequality | 2014-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414595 | 2014-05-06 | Paper |
| A one-time stegosystem and applications to efficient covert communication | 2014-04-01 | Paper |
| Online metric tracking and smoothing | 2014-03-25 | Paper |
| Small-Bias Sets for Nonabelian Groups | 2013-10-04 | Paper |
| Distributed scheduling for disconnected cooperation | 2013-06-13 | Paper |
| The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces | 2013-01-07 | Paper |
| Approximating the permanent via nonabelian determinants | 2012-08-10 | Paper |
| A Graph Integral Formulation of the Circuit Partition Polynomial | 2011-12-08 | Paper |
| Spectral concentration of positive functions on compact groups | 2011-10-11 | Paper |
| Finding conjugate stabilizer subgroups in PSL(2; q) and related groups | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172447 | 2011-10-05 | Paper |
| McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks | 2011-08-12 | Paper |
| Limitations of quantum coset states for graph isomorphism | 2011-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3085181 | 2011-03-30 | Paper |
| On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism | 2011-01-17 | Paper |
| Regarding a Representation-Theoretic Conjecture of Wigderson | 2010-09-21 | Paper |
| Work-competitive scheduling for cooperative computing with dynamic groups | 2010-08-16 | Paper |
| Uncertainty principles for compact groups | 2010-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396621 | 2009-09-19 | Paper |
| Soft Edge Coloring | 2009-02-17 | Paper |
| Topological Neighborhoods for Spline Curves: Practice & Theory | 2009-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549653 | 2009-01-05 | Paper |
| The Symmetric Group Defies Strong Fourier Sampling | 2008-12-22 | Paper |
| How to fool an unbounded adversary with a short key | 2008-12-21 | Paper |
| Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs | 2008-11-27 | Paper |
| Modeling time and topology for animation and visualization with examples on parametric geometry | 2008-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522655 | 2008-09-03 | Paper |
| The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts | 2008-06-19 | Paper |
| Computational topology for isotopic surface reconstruction | 2006-12-07 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668735 | 2005-04-15 | Paper |
| The chilean highway problem | 2005-01-11 | Paper |
| Inapproximability results for equations over finite groups | 2004-10-27 | Paper |
| Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737146 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737240 | 2004-08-11 | Paper |
| Classical and quantum function reconstruction via character evaluation | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471331 | 2004-07-28 | Paper |
| Computational topology: Ambient isotopic approximation of 2-manifolds. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440436 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436048 | 2003-11-23 | Paper |
| The Hidden Subgroup Problem and Quantum Computation Using Group Representations | 2003-06-19 | Paper |
| The complexity of solving equations over finite groups | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152802 | 2002-12-10 | Paper |
| Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501567 | 2002-09-01 | Paper |
| Perfect information leader election in \(\log^*n+O(1)\) rounds | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766867 | 2002-06-25 | Paper |
| Alternation in interaction | 2002-06-02 | Paper |
| An Easy Reduction of an Isoperimetric Inequality on the Sphere to Extremal Set Theory | 2001-11-26 | Paper |
| Complexity bounds on general hard-core predicates. | 2001-11-07 | Paper |
| Achieving Optimal Fairness from Biased Coinflips | 2001-07-17 | Paper |
| On embedding complete graphs into hypercubes | 2000-11-02 | Paper |
| Extraction of optimally unbiased bits from a biased source | 2000-09-07 | Paper |
| Symmetric alternation captures BPP | 1999-01-03 | Paper |
| A note on the asymptotic and computational complexity of graph distinguishability | 1998-04-29 | Paper |
| The relativized relationship between probabilistically checkable debate systems, IP and PSPACE | 1997-02-28 | Paper |
| Necessary and sufficient conditions for collision-free hashing | 1995-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318713 | 1995-01-09 | Paper |
