Nikos Leonardos

Office: Hill 414.
Phone: (732) 445-2001 X 9599.
Email:

Research

Nikos Leonardos and Michael Saks, "Lower bounds on the randomized communication complexity of read-once functions." Computational Complexity, 2009; CCC 2009.

Theory of Computing Reading Seminar

Fall 2011.
Fall 2010—Spring 2011.
Fall 2009—Spring 2010.
Spring 2009.
Spring 2008.

Links

DIMACS/CS Light Seminar.
GCS (Combinatorics Seminar).
Discrete Math Seminar.
Experimental Math Seminar.
DIMACS Workshops.
ECCC.