Paolo Codenotti, Ph.D.
Affiliations: | 2011 | Computer Science | University of Chicago, Chicago, IL |
Area:
Computer ScienceGoogle:
"Paolo Codenotti"Parents
Sign in to add mentor| Laszlo Babai | grad student | 2011 | Chicago | |
| (Testing isomorphism of combinatorial and algebraic structures.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Baird W, Beveridge A, Bonato A, et al. (2014) On the minimum order of $k$-cop win graphs Contributions to Discrete Mathematics. 9 |
| Baird W, Beveridge A, Bonato A, et al. (2014) On the minimum order of k-cop-win graphs Contributions to Discrete Mathematics. 9: 70-84 |
| Babai L, Codenotti P, Qiao Y. (2012) Polynomial-time isomorphism test for groups with no abelian normal subgroups (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 51-62 |
| Babai L, Codenotti P, Grochow JA, et al. (2011) Code equivalence and group isomorphism Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1395-1408 |
| Babai L, Codenotti P. (2008) Isomorphism of hypergraphs of low rank in moderately exponential time Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 667-676 |