| Publication | Date of Publication | Type |
|---|
Taming iterative grinding attacks on blockchain beacons
| 2026-03-31 | Paper |
Practical settlement bounds for longest-chain consensus
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Approximating latin square extensions
Lecture Notes in Computer Science | 2024-01-29 | Paper |
A composable security treatment of ECVRF and batch verifications
Computer Security – ESORICS 2022 | 2023-07-28 | Paper |
Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
Advances in Cryptology – CRYPTO 2022 | 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
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The complexity of synchronous iterative do-all with crashes
Distributed Computing | 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
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Parallel Processing Letters | 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
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Cliptography: clipping the power of kleptographic attacks
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
Random Structures & Algorithms | 2017-01-05 | Paper |
Dealing with undependable workers in decentralized network supercomputing
Distributed Computing and Networking | 2016-12-19 | Paper |
Lower bounds for leader election and collective coin-flipping in the perfect information model
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
A note on optical routing on trees
Information Processing Letters | 2016-05-26 | Paper |
Approximate representations, approximate homomorphisms, and low-dimensional embeddings of groups
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Group representations that resist random sampling
Random Structures & Algorithms | 2015-11-13 | Paper |
Generic quantum Fourier transforms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
| 2015-08-03 | Paper |
Generic quantum Fourier transforms
| 2015-08-03 | Paper |
Optimal \(\varepsilon\)-biased sets with just a little randomness
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Efficient probabilistically checkable proofs and applications to approximations
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups
Communications in Mathematical Physics | 2015-03-02 | Paper |
Quantum algorithms for Simon's problem over general groups
| 2014-12-18 | Paper |
Dealing with undependable workers in decentralized network supercomputing
Theoretical Computer Science | 2014-12-02 | Paper |
Limitations of quantum coset states for graph isomorphism
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Normal subgroup reconstruction and quantum computation using group representations
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 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
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
The one-way communication complexity of subgroup membership
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
A one-time stegosystem and applications to efficient covert communication
Journal of Cryptology | 2014-04-01 | Paper |
Online metric tracking and smoothing
Algorithmica | 2014-03-25 | Paper |
Small-Bias Sets for Nonabelian Groups
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Distributed scheduling for disconnected cooperation
Distributed Computing | 2013-06-13 | Paper |
The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research | 2013-01-07 | Paper |
Approximating the permanent via nonabelian determinants
SIAM Journal on Computing | 2012-08-10 | Paper |
A graph integral formulation of the circuit partition polynomial
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
Spectral concentration of positive functions on compact groups
The Journal of Fourier Analysis and Applications | 2011-10-11 | Paper |
Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
| 2011-10-05 | Paper |
Quantum and randomized lower bounds for local search on vertex-transitive graphs
| 2011-10-05 | Paper |
McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Limitations of quantum coset states for graph isomorphism
Journal of the ACM | 2011-05-16 | Paper |
scientific article; zbMATH DE number 5872422 (Why is no real title available?)
| 2011-03-30 | Paper |
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
SIAM Journal on Computing | 2011-01-17 | Paper |
Regarding a Representation-Theoretic Conjecture of Wigderson
| 2010-09-21 | Paper |
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Uncertainty principles for compact groups
Illinois Journal of Mathematics | 2010-01-20 | Paper |
scientific article; zbMATH DE number 5605123 (Why is no real title available?)
| 2009-09-19 | Paper |
Soft Edge Coloring
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Topological Neighborhoods for Spline Curves: Practice & Theory
Reliable Implementation of Real Number Algorithms: Theory and Practice | 2009-01-13 | Paper |
scientific article; zbMATH DE number 5485489 (Why is no real title available?)
| 2009-01-05 | Paper |
The Symmetric Group Defies Strong Fourier Sampling
SIAM Journal on Computing | 2008-12-22 | Paper |
How to fool an unbounded adversary with a short key
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Modeling time and topology for animation and visualization with examples on parametric geometry
Theoretical Computer Science | 2008-10-21 | Paper |
For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets
| 2008-09-03 | Paper |
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
SIAM Journal on Computing | 2008-06-19 | Paper |
Computational topology for isotopic surface reconstruction
Theoretical Computer Science | 2006-12-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
SIAM Journal on Computing | 2005-09-16 | Paper |
scientific article; zbMATH DE number 2156277 (Why is no real title available?)
| 2005-04-15 | Paper |
The chilean highway problem
Theoretical Computer Science | 2005-01-11 | Paper |
Inapproximability results for equations over finite groups
Theoretical Computer Science | 2004-10-27 | Paper |
Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
scientific article; zbMATH DE number 2086612 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086703 (Why is no real title available?)
| 2004-08-11 | Paper |
Classical and quantum function reconstruction via character evaluation
Journal of Complexity | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2079372 (Why is no real title available?)
| 2004-07-28 | Paper |
Computational topology: Ambient isotopic approximation of 2-manifolds.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2019633 (Why is no real title available?)
| 2003-12-17 | Paper |
scientific article; zbMATH DE number 2006650 (Why is no real title available?)
| 2003-11-23 | Paper |
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
SIAM Journal on Computing | 2003-06-19 | Paper |
The complexity of solving equations over finite groups
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1820019 (Why is no real title available?)
| 2002-12-10 | Paper |
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
SIAM Journal on Computing | 2002-09-29 | Paper |
scientific article; zbMATH DE number 1500548 (Why is no real title available?)
| 2002-09-01 | Paper |
Perfect information leader election in \(\log^*n+O(1)\) rounds
Journal of Computer and System Sciences | 2002-07-04 | Paper |
scientific article; zbMATH DE number 1696670 (Why is no real title available?)
| 2002-06-25 | Paper |
Alternation in interaction
Computational Complexity | 2002-06-02 | Paper |
An Easy Reduction of an Isoperimetric Inequality on the Sphere to Extremal Set Theory
American Mathematical Monthly | 2001-11-26 | Paper |
Complexity bounds on general hard-core predicates.
Journal of Cryptology | 2001-11-07 | Paper |
Achieving Optimal Fairness from Biased Coinflips
Cryptography and Computational Number Theory | 2001-07-17 | Paper |
On embedding complete graphs into hypercubes
Discrete Mathematics | 2000-11-02 | Paper |
Extraction of optimally unbiased bits from a biased source
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Symmetric alternation captures BPP
Computational Complexity | 1999-01-03 | Paper |
A note on the asymptotic and computational complexity of graph distinguishability
The Electronic Journal of Combinatorics | 1998-04-29 | Paper |
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters | 1997-02-28 | Paper |
Necessary and sufficient conditions for collision-free hashing
Journal of Cryptology | 1995-07-27 | Paper |
scientific article; zbMATH DE number 708822 (Why is no real title available?)
| 1995-01-09 | Paper |
