# Publications

Derandomized squaring of graphs.” In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM '05), 3624:436-447. Berkeley, CA: Springer Verlag, Lecture Notes in Computer Science, 2005. Publisher's VersionAbstract RANDOM2005.pdf

. “A complete problem for statistical zero knowledge.” Journal of the ACM 50, no. 2 (2003): 196-249.Abstract complete_problem_statistical_zero_knowledge.pdf

. “The power of a pebble: exploring and mapping directed graphs.” Information and Computation 176, no. 1 (2002): 1-21.Abstract power_of_pebble.pdf

. “The complexity of counting in sparse, regular, and planar graphs.” SIAM Journal on Computing 31, no. 2 (2001): 398-427.Abstract complexity_counting_sparse_regular_planar_graphs.pdf

. “ Manipulating statistical difference.” Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-270.Abstract manipulating_statistical_difference.pdf

. “Key management for multicast: Issues and architectures.” Internet RFC 2627, no. June 1999 (1999).Abstract

. “Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge.” Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98) (1998): 399-408.Abstract honest-verifier_statistical_zero-knowledge.pdf

. “