CS Colloquia, Fall 1999
January
30, 2000, 14:15-15:15
Avishai
Wool
Bell Laboratories
Lucent Technologies Inc.
Tools
for Firewall Management
January
19, 2000, 10:00-11:00
Yuval
Shavitt
Bell Laboratories
Lucent Technologies Inc.
QoS
Routing: Practice and Theory
January
16, 2000, 14:15-15:15
Chris
Umans
UC Berkeley
Approximability
of Circuit Minimization Problems
January
9, 2000
Yair
Weiss
UC Berkeley
Loopy
belief propagation --- from image understanding to error correcting codes
January
2, 2000
Uriel
Feige
The Weizman Institute
Noncryptographic
Selection Protocols
December
26, 1999
Sergei Artemov
Moscow State University and Cornell University
How
to circumvent the Goedel incompleteness theorem in applications.
December
22, 1999
Dorit
Aharonov
UC Berkeley
What
is Known about Quantum Computation?
December
19, 1999
Flemming
Nielson
Aarhus University, Denmark
Flow
Logics for Mobile Ambients
December
12, 1999
Derek
Corneil
University of Toronto
The
power of Lexicographic Breadth First Search (LBFS)
November
28, 1999
Micha
Sharir
Tel Aviv University
The
k-Set Problem
November
21, 1999
Evelyn Duesterwald
Hewlett-Packard Laboratories, Cambridge, MA
DYNAMO:
The Design of a Dynamic Program Optimizer
November
14, 1999
Amnon
H. Eden
Tel Aviv University
Towards
a formal foundation for O-O software architecture
November
7, 1999
Adi Shamir
The Weizmann Institute
Factoring
Large Numbers With the TWINKLE Device
October
31, 1999
Amir Ben-Dor
University of Washington
Analyzing
gene expression data
Colloquia
of Previous Years