Ilias Diakonikolas

I am an Assistant Professor in the School of Informatics at the University of Edinburgh. I moved to Edinburgh in the Fall of 2012 after spending two years at UC Berkeley as a Simons Postdoctoral Fellow in Theoretical Computer Science. I obtained my Ph.D. in Computer Science at Columbia University, advised by Mihalis Yannakakis. Before that, I did my undergraduate studies in Greece, at the National Technical University of Athens. My research is in theoretical computer science, in particular in algorithms, computational complexity, learning and game theory. Informatics Forum, Room 5.18 University of Edinburgh 10 Crichton Street Edinburgh EH8 9AB Scotland, UK ilias.d_at_ed.ac.uk

News:

Research Publications

Learning Sums of Independent Integer Random Variables.
C. Daskalakis, I. Diakonikolas, R. O'Donnell, R. Servedio, L-Y. Tan.
Manuscript, 2013.

Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions.
A. De, I. Diakonikolas, R. Servedio.
Manuscript, 2013.

Efficient Density Estimation via Piecewise Polynomial Approximation.
S. Chan, I. Diakonikolas, R. Servedio, X. Sun.
Manuscript, 2013.

Inverse problems in approximate uniform generation.
A. De, I. Diakonikolas, R. Servedio.
Manuscript, 2012.

An Optimal Algorithm for the Efficient Approximation of Convex Pareto Curves.
I. Diakonikolas, M. Yannakakis.
Manuscript, 2012.

On the relation of total variation and Kolmogorov distance between Poisson Binomial distributions.
C. Daskalakis, I. Diakonikolas, R. Servedio.
Manuscript, 2012.

On the distribution of the Fourier spectrum of halfspaces.
I. Diakonikolas, R. Jaiswal, R. Servedio, L.-Y.Tan, A. Wan.
Manuscript, 2012.

A robust Khintchine Inequality and computing optimal constants in Fourier analysis and high-dimensional geometry.
A. De, I. Diakonikolas, R. Servedio.
ICALP 2013.

Learning Mixtures of Structured Distributions over Discrete Domains.
S. Chan, I. Diakonikolas, R. Servedio, X. Sun.
SODA 2013.

Testing k-modal Distributions: Optimal Algorithms via Reductions.
C. Daskalakis, I. Diakonikolas, R. Servedio, G. Valiant, P. Valiant.
SODA 2013.

Efficiency-Revenue Tradeoffs in Auctions.
I. Diakonikolas, C.H. Papadimitriou, G. Pierrakos, Y. Singer.
ICALP 2012.

The Inverse Shapley Value Problem.
A. De, I. Diakonikolas, R. Servedio.
ICALP 2012.

Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces.
A. De, I. Diakonikolas, V. Feldman, R. Servedio.
STOC 2012.

Learning Poisson Binomial distributions.
C. Daskalakis, I. Diakonikolas, R. Servedio.
STOC 2012.

Learning k-modal distributions via testing.
C. Daskalakis, I. Diakonikolas, R. Servedio.
SODA 2012.

Supervised Design Space Exploration by Compositional Approximation of Pareto sets.
H.-Y. Liu, I. Diakonikolas, M. Petracca, L.P. Carloni.
DAC 2011.

Disjoint-Path Facility Location: Theory and Practice.
L. Breslau, I. Diakonikolas, N. Duffield, Y.Gu, M.T. Hajiaghayi, D.S. Johnson, H. Karloff, M. Resende, S.Sen.
ALENEX 2011.

Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions.
I. Diakonikolas, R. O'Donnell, R. Servedio, Y.Wu.
SODA 2011.

Bounded Independence Fools Degree-2 Threshold Functions.
I. Diakonikolas, D. Kane, J. Nelson.
FOCS 2010.

Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions.
I. Diakonikolas, P. Raghavendra, R. Servedio. L.-Y. Tan.
STOC 2010.
(Conference version merged with this paper by Harsha, Klivans and Meka.)