Title: Assistant Professor
Office: MCS 135x
Education: PhD, UC Berkeley
Lorenzo Orecchia is an assistant professor in the Computer Science Department at Boston University. His research focuses on the design and analysis of algorithms that are both theoretically sound and practically applicable. His work leverages mathematical techniques from a broad spectrum of areas to break longstanding computational barriers. Lorenzo received his Ph.D. from UC Berkeley in 2011 and was an Applied Math Instructor at MIT before joining BU.
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
With Jonathan A. Kelner, YinTat Lee and Aaron Sidford.
SODA’14: Proc. Symp. on Discrete Algorithms, pp. 217–226, 2014. Co-winner of Best Paper Award.
A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time
With Jonathan A. Kelner, Aaron Sidford and Zeyuan Allen-Zhu.
STOC’13: Proc. Symp. Theory Computing, pp. 911–920, 2013.
Implementing Regularization Implicitly Via Approximate Eigenvector Computation
With Michael W. Mahoney.
ICML’11: Proc. 28th Intl. Conf. Machine Learning, pp. 121-128, 2011.