About Me

about achlioptas dimitris
Dimitris Achlioptas

Dimitris Achlioptas

Dimitris Achlioptas is a Professor of Computer Science at the University of California Santa Cruz and the Department of Informatics and Telecommunications of the University of Athens. Prior to that, he was with Microsoft Research, Redmond. He received his Ph.D. from the University of Toronto in 1999.

His research interests explore the role of randomness both to as an aid and as an obstacle to efficient computation. His work on this area has appeared in journals including Nature, Science, and the Annals of Mathematics. He has received an NSF CAREER award, an Alfred P. Sloan Research Fellowship, and an ERC Starting Grant.

Besides theoretical questions, he also likes to think about scalability questions and holds 18 US Patents ranging from load balancing and cache optimization to search personalization. He actively consults with a number of Bay Area companies.

A list of Dimitris Achlioptas’ publications is under section Publications.

You can find News about Dimitris Achlioptas under News sectioncontact Dimitris, read about Publications, view more Talks, etc.


Employment

  1. 2006 – Present: Professor University of California at Santa Cruz
  2. 2001–2005: Affiliate Professor University of Washington
  3. 2000–2005: Researcher Microsoft Research
  4. 1999: Postdoctoral Fellow Microsoft Research
  5. 1994-1998: Teaching Assistant University of Toronto

Education

  1. 1999: Ph.D. Computer Science, University of Toronto. Advisor: Michael Molloy.
    Thesis: Threshold Phenomena in Random Graph Colouring and Satisfiability
  2. 1995: M.Sc. Computer Science, University of Toronto. Advisor: Derek Corneil.
    Thesis: The Complexity of G-free Colorability
  3. 1993: B.Eng. Computer Engineering, University of Patras.

Professional Competence and Activity

  • NSF CAREER Award, 2005
  • Honourable mention, Governor General’s Gold Medal, University of Toronto, 1999
    The medal is awarded to the graduating student with the highest academic standing in the university
  • Best Ph.D. Thesis in Mathematical Sciences, University of Toronto, 1999
  • NSERC Postdoctoral Fellowship, Microsoft Research, 1999-2000
  • Ontario Graduate Studies Scholarship, University of Toronto, 1997-1998
  • NSERC Postgraduate Studies Scholarship, University of Toronto, 1995-1997
  • Greek Graduate Studies Scholarship, University of Toronto, 1993-1995
  • Graduates’ Academic Excellence Award, University of Patras, 1992-1993

Recent Work

  • Sufficient conditions for stochastic local search 
    should be a link and has some details if possible below each item
  • Probabilistic models of network formation (Quanta Magazine article, July 2015)
  • Applications of coding theory in machine learning

Selected Papers


Preprints

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma (with F. Iliopoulos, A. Sinclair), FOCS’19, to appear.

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1997 – 1998