Publications

Mikael Goldmann, Alexander Russell, Denis Thérien (2000). An Ergodic Theorem for Read-once Non-uniform Deterministic Finite Automata. Information Processing Letters.
Cite DOI
Alexander Russell (2000). An Easy Reduction of an Isoperimetric Inequality on the Sphere to Extremal Set Theory. The American Mathematical Monthly.
Cite DOI
Marcos Kiwi, Carsten Lund, Alexander Russell, Daniel Spielman, Ravi Sundaram (2000). Alternation in Interaction. Computational Complexity.
Cite DOI
Mikael Goldmann, Alexander Russell (1999). The Complexity of Solving Equations Over Finite Groups. Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity.
Cite
Alexander Russell, Michael Saks, David Zuckerman (1999). Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC).
Cite DOI
S. Ravi Kumar, Alexander Russell, Ravi Sundaram (1999). Approximating Latin Square Extensions. Algorithmica.
Cite DOI
Alexander Russell, Ravi Sundaram (1998). Symmetric Alternation Captures BPP. Computational Complexity.
Cite DOI
Michael Klugerman, Alexander Russell, Ravi Sundaram (1998). On Embedding Complete Graphs into Hypercubes. Discrete Mathematics.
Cite DOI
Alexander Russell, David Zuckerman (1998). Perfect Information Leader Election in $łog^* n + O(1)$ Rounds. Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS).
Cite
Mats Näslund, Alexander Russell (1998). Extraction of optimally unbiased bits from a biased source. Proceedings of the 1998 IEEE Information Theory Workshop.
Cite