CS Colloquium, Spring 1999
The lectures will be held at
Schreiber
Building, Room 309, on Sundays 2:15-3:15.
11.4
Avishai Wool
Bell Labs, Lucent Technologies
Topics in Restricted Multicast using Broadcast Encryption
18.4
Benny Sudakov
Tel Aviv University
On two segmentation problems
25.4
Janos Pach
Mathematical Inst. Hungarian Academy
and Courant Institute, New York
Crossroads in Flatland, I:
Crossing Numbers of Graphs
2.5
Sivan Toledo
Tel Aviv University
Locality of Reference in Sequential and Parallel Numerical Algorithms
9.5
Jacob Ziv
Electrical Engineering Department, The Technion
The Many Faces of Shannon Entropy
- postponed
16.5
Rina Dechter
Information and Computer Science Dept.,
University of California, Irvine
A method of approximating variable-elimination algorithms
23.5
Omer Reingold
The Weizmann Institute of Science
Pseudo-Random Functions, Permutations and Synthesizers
30.5
Benjamin Melamed
Faculty of Management & Center for Operations Research, Rutgers University
The Empirical TES Modeling Methodology: Theory and Applications
6.6
Sariel Har-Peled
Tel Aviv University
Approximating Minimum-Width Annuli and Shells
13.6
Shimon Even
Computer Science Department, The Technion
Some Compact Layouts of the Butterfly
24.6 (Thursday)
Alan Edelman
MIT and UC Berkeley
Next-Generation Eigensolvers
30.6 (Wedensday)
Martin Rinard
Massachusetts Institute of Technology
Pointer and Symbolic Analysis of Multithreaded Programs
Coordinated by
Yossi Matias
Previous Seminars in Previous Years