BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium - Something for almost nothing:  Advances in sub-lin
 ear time algorithms
DTSTART:20131104T161500
DTEND:20131104T173000
DTSTAMP:20260407T035438Z
UID:483e09432574a4573e8a7d34e9e6a94271da8a5251e143d36c11e118
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ronitt Rubenfeld - MIT and Tel Aviv University\nAbstract:\nLin
 ear-time algorithms have long been considered the gold standard of computa
 tional efficiency.  Indeed\, it is hard to imagine doing better than that
 \, since for a nontrivial problem\, any algorithm must consider all of the
  input in order to make a decision.  However\, as extremely large data se
 ts are pervasive\, it is natural to wonder what one can do in {\\em sub-li
 near} time. Over the past two decades\, several surprising advances have b
 een made on designing such algorithms. We will give a non-exhaustive surve
 y of this emerging area\, highlighting recent progress and directions for 
 further research.Bio:\nRonitt Rubinfeld received her Bachelor's degree at 
 the University of Michigan and PhD at the University of California\, Berke
 ley.  She held postdoctoral positions at DIMACS and the Hebrew University
  at Jerusalem.  After several years as a faculty member at Cornell Univer
 sity and a senior research scientist at NEC Research Institute\, she is cu
 rrently on the faculties of MIT and Tel Aviv University. She has been a re
 cipient of the ONR Young Investigator award\, NSF Career Award\, Sloan Fel
 lowship\, Cornell Association for Computer Science Undergraduates Faculty 
 of the Year award and a Cornell College of Engineering Teaching award. She
  was an invited speaker at the International Congress of Mathematicians in
  2006. Her research focuses on sub-linear time algorithms for big datasets
 .
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR