Publications

Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman (2004). The Complexity of Synchronous Iterative Do-All with Crashes. Distributed Computing.
Cite DOI
Cristopher Moore, Daniel Rockmore, Alexander Russell, Leonard J. Schulman (2004). The Power of Basis Selection in Fourier Sampling: Hidden Subgroup Problems in Affine Groups. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms.
Cite URL
Zeph Landau, Alexander Russell (2004). Random Cayley Graphs are Expanders: A Simple Proof of the Alon-Roichman Theorem. Electronic Journal of Combinatorics.
PDF Cite
Lars Engebretsen, Jonas Holmerin, Alexander Russell (2004). Inapproximability Results for Equations over Finite Groups. Theoretical Computer Science.
Cite DOI
Cristopher Moore, Daniel Rockmore, Alexander Russell (2004). Generic Quantum Fourier Transforms. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms.
Cite URL
Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman (2004). Analysis of Instant and Total Memory Access Concurrency in Robust Parallel Algorithms. Studia Informatica Universalis.
Cite
Nina Amenta, Thomas J. Peters, Alexander Russell (2003). Computational Topology: Ambient Isotopic Approximation of 2-Manifolds. Theoretical Computer Science.
Cite DOI
Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman (2003). Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing.
Cite DOI URL
Sean Hallgren, Alexander Russell, Amnon Ta-Shma (2003). The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM Journal on Computing.
Cite DOI
Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman (2003). Distributed Cooperation and Adversity: Complexity Trade-offs. Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday.
Cite DOI URL