Cristóbal Andrés Guzmán Paredes

Ph.D. in Algorithms, Combinatorics and Optimization, Georgia Institute of Technology, 2015. .
Profesor Asistente. Departamento de Matemática.
Oficina 149.
Teléfono 23545479.
crguzmanp@mat.puc.cl
http://www.mat.uc.cl/~crguzmanp/

Áreas de Investigación

Optimización convexa, análisis de algoritmos, congestión y equilibrio en redes


Publicaciones Seleccionadas

Feldman, V., Guzmán, C., Vempala, S. 2017. Statistical Query Algorithms For Mean Vector Estimation And Stochastic Convex Optimization. In: Soda '17 Proceedings Of The Twenty-Eighth Annual Acm-Siam Symposium On Discrete Algorithms. Society For Industrial And Applied Mathematics Philadelphia. 1265-1277.
Dostert, M., Guzmán, C., Oliveira Filho, F., Vallentin, F. 2017. New Upper Bounds For The Density Of Translative Packings Of Three-Dimensional Convex Bodies With Tetrahedral Symmetry. Discrete & Computational Geometry, 58(2):449-481.
Braun, G., Guzmán, C., Pokutta, S. 2017. Lower Bounds On The Oracle Complexity Of Nonsmooth Convex Optimization Via Information Theory. Ieee Transactions On Information Theory, 63(7):4709-4724.
Guzmán, C., Nemirovski, A. 2015. On Lower Complexity Bounds For Large-Scale Smooth Convex Optimization. Journal Of Complexity, 31(1):1-14.
Cominetti, R., Guzmán, C. 2014. Network Congestion Control With Markovian Multipath Routing. Mathematical Programming, 147(1):231-251.

Cursos Seleccionados

MAT1226 Algebra Lineal 2017 2'