| Ouroboros: A provably secure proof-of-stake blockchain protocol A Kiayias, A Russell, B David, R Oliynykov Annual International Cryptology Conference, 357-388, 2017 | 742 | 2017 |
| Efficient probabilistically checkable proofs and applications to approximations M Bellare, S Goldwasser, C Lund, A Russell Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 421 | 1993 |
| Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain B David, P Gaži, A Kiayias, A Russell Annual International Conference on the Theory and Applications of …, 2018 | 227* | 2018 |
| Quantum walks on the hypercube C Moore, A Russell International Workshop on Randomization and Approximation Techniques in …, 2002 | 183 | 2002 |
| Normal subgroup reconstruction and quantum computation using group representations S Hallgren, A Russell, A Ta-Shma Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 121 | 2000 |
| Limitations of quantum coset states for graph isomorphism S Hallgren, C Moore, M Rötteler, A Russell, P Sen Journal of the ACM (JACM) 57 (6), 1-33, 2010 | 108 | 2010 |
| Quantum random walk with Rydberg atoms in an optical lattice R Côté, A Russell, EE Eyler, PL Gould New Journal of Physics 8 (8), 156, 2006 | 106 | 2006 |
| Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability C Badertscher, P Gaži, A Kiayias, A Russell, V Zikas Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 100 | 2018 |
| The complexity of solving equations over finite groups M Goldmann, A Russell Information and Computation 178 (1), 253-262, 2002 | 97 | 2002 |
| The symmetric group defies strong Fourier sampling C Moore, A Russell, LJ Schulman SIAM Journal on Computing 37 (6), 1842-1864, 2008 | 87 | 2008 |
| Computational topology: ambient isotopic approximation of 2-manifolds N Amenta, TJ Peters, AC Russell Theoretical Computer Science 305 (1-3), 3-15, 2003 | 87 | 2003 |
| The hidden subgroup problem and quantum computation using group representations S Hallgren, A Russell, A Ta-Shma SIAM Journal on Computing 32 (4), 916-934, 2003 | 84 | 2003 |
| A note on the asymptotics and computational complexity of graph distinguishability A Russell, R Sundaram the electronic journal of combinatorics, R23-R23, 1998 | 80 | 1998 |
| The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups C Moore, D Rockmore, A Russell, LJ Schulman SIAM, 2004 | 79 | 2004 |
| McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks H Dinh, C Moore, A Russell Annual Cryptology Conference, 761-779, 2011 | 77* | 2011 |
| Perfect information leader election in log* n+ O (1) rounds A Russell, D Zuckerman Journal of Computer and System Sciences 63 (4), 612-626, 2001 | 77 | 2001 |
| Symmetric alternation captures BPP A Russell, R Sundaram Computational Complexity 7 (2), 152-162, 1998 | 77 | 1998 |
| Neighbor discovery in wireless networks with multipacket reception W Zeng, S Vasudevan, X Chen, B Wang, A Russell, W Wei Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc …, 2011 | 75* | 2011 |
| Generic quantum Fourier transforms C Moore, D Rockmore, A Russell ACM Transactions on Algorithms (TALG) 2 (4), 707-723, 2006 | 75 | 2006 |
| Decoherence in quantum walks on the hypercube G Alagic, A Russell Physical Review A 72 (6), 062304, 2005 | 66 | 2005 |
Aggelos KiayiasSchool of Informatics, University of Edinburgh, University of Athens & IOHK確認したメール アドレス: ed.ac.uk
