Ellis Hershkowitz

Ellis Hershkowitz is an Assistant Professor in the Computer Science Department at Brown University, focusing on theoretical computer science with emphasis on graph algorithms, approximation algorithms, and metric embeddings. He received his PhD from Carnegie Mellon University in 2022 and spent a postdoctoral year at ETH Zürich's Math Department, joining Brown as a faculty member afterward. A Brown alum, he completed both his master's and undergraduate degrees at Brown.

• Research Areas: Algorithms, Combinatorics, Graph Theory, Approximation Algorithms, Metric Embeddings, Online Algorithms, Distributed Algorithms
• Teaching: CSCI 1952C - Frontiers of Graph Algorithms Seminar, CSCI 2952T - An Algorithmist's Toolkit
• Grants: NSF grant CCF-2403236

His recent research includes advancements in hierarchical clustering, length-constrained graph algorithms, and robust network design. Publications span top-tier conferences like STOC, FOCS, and APPROX/RANDOM, with a focus on theoretical foundations and algorithmic efficiency. He co-organizes the Brown Theory Seminar with Richard Huang, fostering academic collaboration in the Providence/Boston area.