#### Filter Results:

- Full text PDF available (87)

#### Publication Year

1991

2018

- This year (10)
- Last 5 years (38)
- Last 10 years (86)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Cristopher Moore, Alexander Russell
- RANDOM
- 2002

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical… (More)

- Alexander Russell, David Zuckerman
- J. Comput. Syst. Sci.
- 1998

In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect… (More)

- Sean Hallgren, Alexander Russell, Amnon Ta-Shma
- STOC
- 2000

The Hidden Subgroup Problem is the foundation of many quantum algorithms. An eÆ ient solution is known for the problem over Abelian groups and this was used in Simon's algorithm and Shor's Fa toring… (More)

- Alexander Russell, Ravi Sundaram
- computational complexity
- 1998

We introduce the natural class ${\bf\,S}^P_2$ containing those languages that may be expressed in terms of two symmetric quantifiers. This class lies between $\Delta^P_2$ and… (More)

- Sean Hallgren, Alexander Russell, Amnon Ta-Shma
- SIAM J. Comput.
- 2003

The hidden subgroup problem is the foundation of many quantum algorithms. An efficient solution is known for the problem over abelian groups, employed by both Simon’s algorithm and Shor’s factoring… (More)

- Wei Zeng, Sudarshan Vasudevan, Xian Chen, Bing Wang, Alexander Russell, Wei Wei
- IEEE Transactions on Parallel and Distributed…
- 2011

Neighbor discovery is one of the first steps in configuring and managing a wireless network. Most existing studies on neighbor discovery assume a single-packet reception model where only a single… (More)

Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a <i>hidden subgroup problem</i>, in which a unknown subgroup <i>H</i> of a group… (More)

- Cristopher Moore, Daniel N. Rockmore, Alexander Russell
- ACM Trans. Algorithms
- 2004

The <i>quantum Fourier transform</i> (QFT) is the principal ingredient of most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the… (More)

We present “Ouroboros,” the first blockchain protocol based on proof of stake with rigorous security guarantees. We establish security properties for the protocol comparable to those achieved by the… (More)

The notion of a quantum random walk has emerged as an important element in the development of efficient quantum algorithms. In particular, it makes a dramatic appearance in the most efficient known… (More)