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." ECCC 2009, Report TR09-010.

Theory of Computing Reading Seminar

Fall 2009.
Spring 2009.
Spring 2008.

Links

DIMACS/CS Light Seminar.
GCS (Combinatorics Seminar).
DIMACS Workshops.
Theory events.
ECCC.