Publications

Alexander Russell, Ravi Sundaram (1998). A Note on the Asymptotics and Computational Complexity of Graph Distinguishability. Electronic Journal of Combinatorics.
Cite URL
S. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram (1997). A Note on Optical Routing on Trees. Information Processing Letters.
Cite DOI
S. Ravi Kumar, Alexander Russell, Ravi Sundaram (1997). Faster Algorithms for Optical Switch Configuration. Proceedings of 1997 IEEE International Conference on Communications (ICC).
Cite DOI
S. Ravi Kumar, Alexander Russell, Ravi Sundaram (1996). Approximating Latin Square Extensions. Proceedings of the Second Annual International Conference on Computing and Combinatorics (COCOON).
Cite DOI
Alexander Russell, Ravi Sundaram (1995). The Relativized Relationship Between Probabilistically Checkable Debate Systems, IP and PSPACE. Information Processing Letters.
Cite DOI
Alexander Russell (1995). Necessary and Sufficient Conditions For Collision-Free Hashing. Journal of Cryptology.
Cite DOI
Marcos Kiwi, Carsten Lund, Alexander Russell, Daniel Spielman, Ravi Sundaram (1994). Alternation in interaction. Proceedings of the Ninth IEEE Annual Structure in Complexity Theory Conference.
Cite DOI
M. Bellare, S. Goldwasser, C. Lund, A. Russell (1994). Efficient Probabilistic Checkable Proofs and Applications to Approximation. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing.
Cite DOI URL
Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell (1993). Efficient Probabilistically Checkable Proofs and Applications to Approximations. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC).
Cite DOI
Alexander Russell (1992). Necessary and Sufficient Conditions For Collision-Free Hashing. Advances in Cryptology - CRYPTO ‘92, 12th Annual International Cryptology Conference.
Cite DOI