| A Quasi-Random Approach to Matrix Spectral Analysis. | 0 | 0.34 | 2018 |
| The Quasi-Random Perspective on Matrix Spectral Analysis with Applications | 0 | 0.34 | 2015 |
| Optimal algorithms for linear algebra by quantum inspiration. | 0 | 0.34 | 2013 |
| Simple Gradecast Based Algorithms | 5 | 0.63 | 2010 |
| A fault-resistant asynchronous clock function | 2 | 0.38 | 2010 |
| Interactive Proofs For Quantum Computations | 8 | 0.90 | 2010 |
| Brief anouncement: simple gradecast based algorithms | 2 | 0.38 | 2010 |
| Quantum Multi Prover Interactive Proofs with Communicating Provers | 4 | 0.47 | 2008 |
| The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well) | 8 | 0.78 | 2008 |
| The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings | 2 | 0.37 | 2008 |
| Fast self-stabilizing byzantine tolerant digital clock synchronization | 25 | 0.87 | 2008 |
| Fault-Tolerant Quantum Computation with Constant Error Rate | 120 | 20.40 | 2008 |
| Byzantine agreement in the full-information model in O(log n) rounds | 22 | 0.93 | 2006 |
| Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority | 29 | 1.64 | 2006 |
| Fast quantum byzantine agreement | 24 | 1.49 | 2005 |
| The universal composable security of quantum key distribution | 45 | 3.64 | 2005 |
| Non-Abelian homomorphism testing, and distributions close to their self-convolutions | 9 | 0.76 | 2004 |
| Trading Help for Interaction in Statistical Zero-Knowledge Proofs | 7 | 0.47 | 2003 |
| Resilient-optimal interactive consistency in constant time | 17 | 0.78 | 2003 |
| Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems | 4 | 0.42 | 2000 |
| A tight lower bound for randomized synchronous consensus | 24 | 2.02 | 1998 |
| BARTER: A Backbone Architecture for Trade of Electronic Content | 2 | 0.42 | 1998 |
| A Safe And Scalable Payment Infrastructure For Trade Of Electronic Content | 1 | 0.43 | 1998 |
| Fault-tolerant quantum computation with constant error | 99 | 15.94 | 1997 |
| Agreement in the presence of faults, on networks of bounded degree | 5 | 0.48 | 1996 |
| Polynomial simulations of decohered quantum computers | 12 | 6.43 | 1996 |
| Asynchronous secure computations with optimal resilience (extended abstract) | 49 | 2.05 | 1994 |
| Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) | 0 | 0.34 | 1994 |
| Asynchronous secure computation | 77 | 6.48 | 1993 |
| Computing with faulty arrays | 9 | 1.23 | 1992 |
| Asymptotically optimal PRAM emulation on faulty hypercubes (extended abstract) | 5 | 0.67 | 1991 |
| A fair protocol for signing contracts | 118 | 31.83 | 1990 |
| Simple algorithms for approximating all roots of a polynomial with real roots | 23 | 2.76 | 1990 |
| Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) | 130 | 13.60 | 1989 |
| Efficient identification schemes using two prover interactive proofs | 8 | 1.66 | 1989 |
| Choice Coordination with Limited Failure | 2 | 0.42 | 1989 |
| Collective Coin Flipping. | 0 | 0.34 | 1989 |
| Everything provable is provable in zero-knowledge | 77 | 8.23 | 1988 |
| A fast parallel algorithm for determining all roots of a polynomial with real roots | 28 | 3.07 | 1988 |
| Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) | 263 | 17.03 | 1988 |
| Multi-prover interactive proofs: how to remove intractability assumptions | 219 | 53.90 | 1988 |
| Computing algebraic formulas using a constant number of registers | 71 | 2.90 | 1988 |
| A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) | 19 | 3.48 | 1988 |
| The complexity of elementary algebra and geometry | 143 | 58.49 | 1986 |
| Choice coordination with bounded failure (a preliminary version) | 0 | 0.34 | 1985 |
| Collective coin flipping, robust voting schemes and minima of Banzhaf values | 44 | 7.56 | 1985 |
| Fast asynchronous Byzantine agreement (extended abstract) | 9 | 23.42 | 1985 |
| A Fair Protocol for Signing Contracts (Extended Abstract) | 12 | 27.36 | 1985 |
| The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) | 5 | 2.65 | 1984 |
| A theorem on probabilistic constant depth Computations | 59 | 9.73 | 1984 |
