An Optimal Algorithm for the Efficient Approximation of Convex Pareto Curves.
I. Diakonikolas, M. Yannakakis.
Manuscript, 2011.
On the relation of total variation and Kolmogorov distance between Poisson Binomial distributions.
C. Daskalakis, I. Diakonikolas, R. Servedio.
Manuscript, 2011.
Testing k-modal Distributions: Optimal Algorithms via Reductions.
C. Daskalakis, I. Diakonikolas, R. Servedio, G. Valiant, P. Valiant.
Manuscript, 2011.
On the distribution of the Fourier spectrum of halfspaces.
I. Diakonikolas, R. Jaiswal, R. Servedio, L.-Y.Tan, A. Wan.
Manuscript, 2011.
Efficiency-Revenue Tradeoffs in Auctions.
I. Diakonikolas, C.H. Papadimitriou, G. Pierrakos, Y. Singer.
ICALP 2012, to appear.
The Inverse Shapley Value Problem.
A. De, I. Diakonikolas, R. Servedio.
ICALP 2012, to appear.
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces.
A. De, I. Diakonikolas, V. Feldman, R. Servedio.
STOC 2012, to appear.
Learning Poisson Binomial distributions.
C. Daskalakis, I. Diakonikolas, R. Servedio.
STOC 2012, to appear.
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.)
A Regularity Lemma, and Low-weight Approximators, for low-degree Polynomial Threshold Functions.
I. Diakonikolas, R. Servedio. L.-Y. Tan, A. Wan.
CCC 2010.
How Good is the Chord Algorithm?
C. Daskalakis, I. Diakonikolas, M. Yannakakis.
SODA 2010.
Bounded Independence Fools Halfspaces.
I. Diakonikolas, P. Gopalan, R. Jaiswal, R. Servedio, E. Viola.
FOCS 2009.
SIAM Journal on Computing, 39(8), 3441-3462 (2010).
Improved Approximation of Linear Threshold Functions.
I. Diakonikolas, R. Servedio.
CCC 2009.
Computational Complexity, to appear.
Efficiently Testing Sparse GF(2) Polynomials.
I. Diakonikolas, H. Lee, K. Matulef, R. Servedio, A. Wan.
ICALP 2008.
Algorithmica 61(3), 580-605 (2011).
Succinct Approximate Convex Pareto Curves.
I. Diakonikolas, M. Yannakakis.
SODA 2008.
Testing for Concise Representations.
I. Diakonikolas, H. Lee, K. Matulef, K. Onak, R. Rubinfeld, R. Servedio, A. Wan.
FOCS 2007.
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.
I. Diakonikolas, H. Lee, K. Matulef, R. Servedio, A. Wan.
APPROX 2007.
SIAM Journal on Computing, 39(4), 1340-1371 (2009).