About the Authors
Ilias Diakonikolas
School of Informatics
University of Edinburgh
ilias.d[ta]ed.ac.uk
www.iliasdiakonikolas.org
School of Informatics
University of Edinburgh
ilias.d[ta]ed.ac.uk
www.iliasdiakonikolas.org
Ilias Diakonikolas
is an assistant professor in the
School
of Informatics at the
University of Edinburgh. He obtained his
Ph.D. from Columbia University
advised by Mihalis Yannakakis.
He is interested in algorithms, learning, statistics, and game theory.
Rocco A. Servedio
Department of Computer Science
Columbia University
rocco[ta]cs.columbia.edu
www.cs.columbia.edu/~rocco
Department of Computer Science
Columbia University
rocco[ta]cs.columbia.edu
www.cs.columbia.edu/~rocco
Rocco Servedio
is an associate professor in the
Department of Computer Science
at
Columbia University.
He graduated from
Harvard University,
where his Ph.D. was supervised by
Les Valiant.
He is interested in computational learning theory, computational
complexity, and property testing, with the study of Boolean
functions as an underlying theme tying these topics together. He
enjoys spending time with his family and hopes to share a bottle of
Cutty Sark with H.M. in the afterlife.
Li-Yang Tan
Department of Computer Science
Columbia University
liyang[ta]cs.columbia.edu
www.cs.columbia.edu/~liyang
Department of Computer Science
Columbia University
liyang[ta]cs.columbia.edu
www.cs.columbia.edu/~liyang
Li-Yang Tan is a Ph.D. student at
Columbia University
where he is fortunate to be advised by
Rocco Servedio. His
research interests lie in complexity theory, with a focus on
discrete Fourier analysis, the complexity of Boolean functions, and
computational learning theory.
Andrew Wan
Simons Institute for the Theory of Computing
University of California, Berkeley
atw12[ta]eecs.berkeley.edu
people.seas.harvard.edu/~atw12
Simons Institute for the Theory of Computing
University of California, Berkeley
atw12[ta]eecs.berkeley.edu
people.seas.harvard.edu/~atw12
Andrew Wan is currently a research fellow at the
Simons Institute
for the Theory of Computing at UC Berkeley. Before
this appointment, he was an assistant professor at
IIIS, Tsinghua University.
He received his doctorate from
Columbia University
in 2010 under the supervision of Tal Malkin and Rocco Servedio.
His interests include complexity theory, cryptography, and
computational learning theory. Before graduate school, he was a
student of philosophy at
Columbia University and enjoyed playing the
piano, the trumpet, and the accordion. Although he still enjoys
playing music, the PAC model rarely affords him the time.