tau_logo
cs.tau.ac.il
google

CS Colloquium 2009-2010 - Fall Semester:

Coordinator: Dr. Julia Kempe
Place: Schreiber 006
Time: 11:00 gathering, cookies and coffee
11:15-12:15 colloquium talk
twitterFollow us on twitter

Date Speaker Title

October 18
11:15-12:15

Ran Canetti
School of CS, Tel Aviv University

Program Obfuscation: A Cryptographic Viewpoint

October 25
11:15-12:15

Naftali Tishby
School of CSE, Hebrew University

The information-dynamics of autonomous agents in stochastic environments

November 1
11:15-12:15

Joe Halpern
Sackler Fellow of the Mortimer and Raymond Sackler Institute of Advanced Studies and Cornell University

video  

Robustness and Optimization of Scrip Systems

November 8
11:15-12:15

Alon Rosen
IDC Herzliya

video  

Cryptographic Elections - Challenges and Opportunities

November 11
* special date and time 10:30-11:30

Prabhakar Rhaghavan
Yahoo! Research Silicon Valley

video  

Heavy tails and models for the Web and social networks

November 15
11:15-12:15

Noam Nisan
School of CSE, Hebrew University and Google RD, Israel

video  

Google's Auction for TV ads

November 22
11:15-12:15

Eyal Even-Dar
Google Inc

video  

Learning with Global Cost Functions

November 29
11:15-12:15

Orr Dunkelman
Weizmann Institute

video  

Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds

December 6
11:15-12:15

Avinatan Hassidim
MIT

video  

Phylogenetic Tree Reconstruction with Insertions and Deletions

December 13

Chanukah

December 20
11:15-12:15

Andrei Sharf
UC Davis

video  

Recent results in geometric modeling and point processing

December 27
11:15-12:15

Shalom Lappin
King's College, London

video  

How Hard is Language Acquisition?: Characterizing the Grammar Induction Task within Computational Learning Theory

January 3
11:15-12:15

Alon Orlitsky
ECE and CSE, UCSD

video  

Foreseeing the Unseen: Probability Estimation over Large Alphabets

January 10
11:15-12:15

Scott Aaronson
MIT

video  

New Evidence that Quantum Mechanics is Hard to Simulate on Classical Computers

January 17
11:15-12:15

Michael Shapira
Yale University and UC Berkeley

video  

Internet Routing: Foundations, Challenges and Future Directions

CS Colloquium 2009-2010 - Spring Semester:

Date Guest Title
February 21
11:15-12:15
Ofer Dekel
Microsoft Research, Redmont
  video Learning from Multiple Teachers
February 28 Purim      
March 7
11:15-12:15
Yaacov Choueka
CS, Bar Ilan University
  video Computerizing the Cairo Genizah Vision, Challenges, Research and Achievements
March 14
11:15-12:15
Shafi Goldwasser
Weizmann and MIT
Proving Security Against Side Channel Attacks: Models and Theorems
March 21
11:15-12:15
Piotr Indyk
MIT
Sketching Earth-Mover Distance, with applications
April 11
11:15-12:15
Ehud Lehrer
TAU
  video Approachability and it applications
April 18
11:15-12:15
Moshe Y. Vardi
Rice University
  video From Philosophical to Industrial Logics
Apr 21
* special date and time 15:00-16:00
Ron Rivest
Computer Science, MIT
Security of Voting Systems
April 25
11:15-12:15
Shai Ben-David
Waterloo
  video Which clustering algorithm should I use? Towards principled guidelines
May 2
11:15-12:15
Zvi Galil
TAU
  video Return of the Jedi
May 9
11:15-12:15
Anat Bremler-Barr
IDC
  video Advanced Networking: Algorithms for Utilizing New Memory Models
May 16
11:15-12:15
Andrew V.Goldberg
Microsoft Research - Silicon Valley
  video Highway Dimension and Provably Efficient Shortest Path Algorithms
May 23
11:15-12:00
Raimund Seidel
Saarland University
  video Issues in Geometric Rounding
May 30
11:15-12:15
Robert Krauthgamer
Weizmann Institute
  video Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
Jun 6
11:15-12:15
Eran Halperin
TAU
  video Deciphering the genetic components of human diseases
Jun 13
11:15-12:15
Lior Shapira
TAU
  video On the making of pretty pictures, estimating the volume of a camel (well, not only) and some actual science (ooh)
Jun 20
11:15-12:15
*Schreiber 309
Dorit Hochbaum
UC Berkeley
  video Replacing spectral techniques for expander ratio, normalized cut and conductance by combinatorial flow algorithms

 

 

CS Colloquium, 2009 - 2010
CS Colloquium, 2008 - 2009
CS Colloquium, 2007 - 2008
CS Colloquium, 2006 - 2007
CS Colloquium, 2005 - 2006


Valid HTML 4.01 Transitional

© Copyright 2008 Tel Aviv University All rights reserved.

 
tau.ac.il cs.tau.ac.ilcs.tau.ac.il