Louis Theran, Ph.D.

2010 Computer Science University of Massachusetts, Amherst, Amherst, MA 
Computer Science, Mathematics
"Louis Theran"


Sign in to add mentor
Ileana Streinu grad student 2010 U Mass Amherst
 (Problems in generic combinatorial rigidity: Sparsity, sliders, and emergence of components.)
BETA: Related 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.

Theran L, Nixon A, Ross E, et al. (2015) Anchored boundary conditions for locally isostatic networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 92: 053306
Adiprasito KA, Padrol A, Theran L. (2015) Universality Theorems for Inscribed Polytopes and Delaunay Triangulations Discrete and Computational Geometry. 54: 412-431
Malestein J, Theran L. (2015) Frameworks with Forced Symmetry I: Reflections and Rotations Discrete and Computational Geometry. 54: 339-367
Király FJ, Theran L, Tomioka R. (2015) The algebraic combinatorial approach for low-rank matrix completion Journal of Machine Learning Research. 16: 1391-1436
Padrol A, Theran L. (2014) Delaunay triangulations with disconnected realization spaces Proceedings of the Annual Symposium On Computational Geometry. 163-170
Malestein J, Theran L. (2014) Frameworks with forced symmetry II: Orientation-preserving crystallographic groups Geometriae Dedicata. 170: 219-262
Malestein J, Rivin I, Theran L. (2014) Topological designs Geometriae Dedicata. 168: 221-233
Malestein J, Theran L. (2014) Generic rigidity with forced symmetry and sparse colored graphs Fields Institute Communications. 70: 227-252
Malestein J, Theran L. (2013) Generic combinatorial rigidity of periodic frameworks Advances in Mathematics. 233: 291-331
Király FJ, Theran L. (2013) Error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion Advances in Neural Information Processing Systems
See more...