A
Alexander Russell
Researcher at University of Connecticut
Publications - 248
Citations - 7248
Alexander Russell is an academic researcher from University of Connecticut. The author has contributed to research in topics: Quantum algorithm & Hidden subgroup problem. The author has an hindex of 35, co-authored 244 publications receiving 6086 citations. Previous affiliations of Alexander Russell include University of Texas at Austin & Massachusetts Institute of Technology.
Papers
More filters
Book ChapterDOI
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
TL;DR: “Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.
Book ChapterDOI
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
TL;DR: Ouroboros Praos is a proof-of-stake blockchain protocol that provides security against fully-adaptive corruption in the semi-synchronous setting and tolerates an adversarially-controlled message delivery delay unknown to protocol participants.
Proceedings ArticleDOI
Efficient probabilistically checkable proofs and applications to approximations
TL;DR: This work constructs multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size, and shows that approximating minimum set cover within any constant is NP-complete.
Journal ArticleDOI
Computational topology: ambient isotopic approximation of 2-manifolds
TL;DR: It is shown, that for any C2, compact, 2-manifold without boundary, which is embedded in R3, there exists a piecewise linear ambient isotopic approximation, which has compact support, with specific bounds upon the size of this compact neighborhood.
Book ChapterDOI
Quantum Walks on the Hypercube
TL;DR: In this article, the authors studied two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time, and they showed that the instantaneous mixing time is (π/4)n steps, faster than the Θ(n log n) steps required by the classical walk.