Kevin Pratt

I'm a second-year PhD student in the Computer Science Department at CMU, where I am part of the Theory Group. My advisor is Ryan O'Donnell. I am broadly interested in the use of algebraic methods in algorithms and complexity theory.

Publications and Preprints

Kevin Pratt. Waring Rank, Parameterized and Exact Algorithms. FOCS 2019. arXiv preprint

John C. Bowers, Philip L. Bowers, and Kevin Pratt. Almost all circle polyhedra are rigid. Geometriae Dedicata, 2019. arXiv preprint

John C. Bowers, Philip L. Bowers, and Kevin Pratt. Rigidity of circle polyhedra in the 2-sphere and of hyperideal polyhedra in hyperbolic 3-space. Transactions of the American Mathematical Society, 2018. arXiv preprint

Kevin Pratt. Closed-Form Expressions for the n-Queens Problem and Related Problems. International Mathematics Research Notices, 2017. arXiv preprint

Kevin Pratt, Connor Riley, and Donald R. Sheehy. Exploring Circle Packing Algorithms. SOCG: Symposium on Computational Geometry (Multimedia Session), 2016. link