Michael Dinitz

Assistant Professor
Department of Computer Science
Johns Hopkins University
Baltimore, MD USA

I am always looking for talented and motivated students interested in algorithms and theoretical computer science. If you are interested, please send me an email!



My research interests are in Theoretical Computer Science, with an emphasis on approximation algorithms, and applications to computer networking and distributed computing.

I am a member of Algorithms and Complexity group at JHU.

My work has been supported by various NSF grants, including a CRII grant and an AitF grant.
As a graduate student I was supported by an NSF Graduate Research Fellowship, as well as an ARCS Scholarship.

Ph.D., Carnegie Mellon University, 2010. Advised by Anupam Gupta.
A.B., Princeton University, 2005. Advised by Sanjeev Arora.

My CV.


Most of my publications

Ph.D. Thesis: Algorithms and Models for Problems in Networking


Some of my systems projects have taken on lives of their own:





Zeyu Zhang (PhD), Yasamin Nazari (PhD)

Alumni: Naomi Ephraim (2016, BS)


Program Committees:

Workshop Organization:


Desiree Tillo    Jeff Dinitz    Sue Dinitz    Amy Dinitz    Tom Dinitz

Contact Information

Email: mdinitz@cs.jhu.edu
Phone: 410-516-6251

Office: Malone 217

Mailing Address: Department of Computer Science, 160 Malone Hall, 3400 N Charles St, Baltimore, MD 21218