About the Authors
 
 Eric Blais
Simons Postdoctoral Fellow
CSAIL, MIT
Cambridge, MA
eblais[ta]csail[td]mit[td]edu
people.csail.mit.edu/eblais
Simons Postdoctoral Fellow
CSAIL, MIT
Cambridge, MA
eblais[ta]csail[td]mit[td]edu
people.csail.mit.edu/eblais
Eric Blais is a Simons Postdoctoral Fellow in the
  Theory of Computing group at
  MIT. He graduated from
  Carnegie Mellon University in 2012;
  his advisor was Ryan
    O'Donnell.  His research interests include the complexity of
  Boolean functions and sublinear algorithms.
 
  Li-Yang Tan
Ph.D. candidate
Department of Computer Science
Columbia University
New York, NY
liyang[ta]cs[td]columbia[td]edu
www.cs.columbia.edu/~liyang
Ph.D. candidate
Department of Computer Science
Columbia University
New York, NY
liyang[ta]cs[td]columbia[td]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.
