Publications

Symmetry and equivalence relations in classical and geometric complexity theory.
J. A. Grochow.
Doctoral dissertation, U. Chicago, 2012. Advisors: Prof. Ketan Mulmuley and Prof. Lance Fortnow (pdf) (bibtex)

Matrix Lie algebra isomorphism. (Previously: Lie Algebra Conjugacy.)
J. A. Grochow.
Electronic Colloquium on Computational Complexity (ECCC) Technical Report TR11-168, 2011. (ECCC)
Also available as arXiv:1112.2012 [cs.CC, cs.DS, cs.SC, math.RT] (arXiv)
To appear, Conference on Computational Complexity, June 2012. (bibtex)

Complexity classes of equivalence problems revisited.
L. Fortnow and J. A. Grochow.
Information and Computation 209(4):748-763, 2011. (doi) (bibtex)
Also available as arXiv:0907.4775v2 [cs.CC], 2009. (arXiv)

Code equivalence and group isomorphism.
L. Babai, P. Codenotti, J. A. Grochow, Y. Qiao
ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011. (pdf) (bibtex)

Genomic analysis reveals a tight link between transcription factor dynamics and regulatory network architecture.
R. Jothi, S. Balaji, A. Wuster, J. A. Grochow, J. Gsponer, T. M. Przytycka, L. Aravind, and M. Madan Babu.
Molecular Systems Biology 5:294, 2009. (pdf) (doi) (bibtex)

The complexity of equivalence relations.
J. A. Grochow.
Master's thesis, U. Chicago, 2008. Advisor: Prof. László Babai (pdf) (bibtex)

Network motif discovery using subgraph enumeration and symmetry-breaking.
J. A. Grochow and M. Kellis.
In RECOMB 2007, Lecture Notes in Computer Science 4453, pp. 92-106. Springer-Verlag, 2007. (pdf) (doi) (bibtex)

On the structure and evolution of protein interaction networks.
J. A. Grochow.
Master's thesis, M. I. T., 2006. Advisor: Prof. Manolis Kellis (pdf) (bibtex)
(This thesis won the Charles and Jennifer Johnson Thesis Award.)