1998 - 1999 CS Annual Report   Speakers
choices.gif (4488 bytes)

Colloquium and Seminar Speakers

September 1997

  • Alan Demers, Oracle. Choosing a Minimum Set of Indices for Materialized View Maintenance.
  • Brian Kernighan, Bell Labs. Research for Fun and (Maybe) Profit: Designing Wireless Communications Systems.
  • Thorsten von Eicken, Computer Science, Cornell University. Implementing Multiple Protection Domains in Java.
  • Sandya Dwarkadas, Computer Science, University of Rochester. Transparent Shared Memory on Clusters of SMPs Using Remote-Write Networks.

October 1998

  • Moshe Vardi, Computer Science, Rice University. Automated Verification = Graphs, Automata, and Logic.
  • Avrim Blum, Computer Science, CMU. On-Line Algorithms for Fun and Profit (Adaptive Algorithms for Online Games and Portfolio Selections).
  • John Hennessy, Computer Science, Stanford University. Convergence Architectures and the Stanford FLASH Machine.
  • Anna Karlin, Computer Science, University of Washington, Seattle. On Some Current Research Directions in the Competitive Analysis of Online Algorithms.

November 1998

  • Daniel Weise, Microsoft Research. Programming Tools, Technology, and Teaching the Masses to Fish.
  • Hui Zhang, Computer Science, CMU. QoS Control and Resource Management in the Internet: Too Much or Too Little?
  • Marjory S. Blumenthal, CS and Telecom Board, National Research Council. The Politics and Policies of Information Systems Trustworthiness: The Issues and the Implications for Educating Computer Scientists.

December 1998

  • William Arms, Corporation for National Research Initiatives. Digital Libraries as Heterogeneous Distributed Systems.

January 1999

  • Fritz Henglein, DIKU, University of Copenhagen and Hafnium ApS. AnnoDomini: From Type Theory to Year 2000 Conversion Tool.
  • Kathy McKeown, Computer Science, Columbia University. Generating Natural Language Summaries: What is Possible Now?

February 1999

  • Eric Horwitz, Microsoft. Probability, Preferences, and Human-Computer Interaction.
  • Demetri Terzopoulos, Computer Science, Electrical and Computer Engineering, University of Toronto. Artificial Animals: Biomechanics, Locomotion, Perception, Behavior, Learning, and Cognition in Simulated Physical Worlds.
  • Clifford Lynch, Executive Director of the Coalition for Networked Information. Research Challenges from Digital Libraries and Networked Information: A Survey of Open Issues.
  • Kevin Sullivan, Computer Science, University of Virginia. Component Integration Architectures.

March 1999

  • Jack Snoeyink, Computer Science, UBC, Vancouver. How to Move a Mountain.
  • Andrea Arpaci-Dusseau, Computer Science, University of Wisconsin, Madison. Implicit Co scheduling: Coordinated Scheduling with Implicit Information in Distributed Systems.
  • Deb Roy, MIT Media Lab. Sensory-Grounded Language Learning.
  • George Varghese, Computer Science, Washington University. From Fast IP Lookups to Efficient Memory Allocators. 

April 1999

  • Adam Ferrari, Computer Science, University of Virginia. Process State Capture and Recovery in Metacomputing Environments.
  • Johannes Gehrke, Computer Science, University of Wisconsin, Madison. Scalable Decision Tree Construction.
  • Ran Canetti, IBM Almaden Research Center. New Directions in Cryptology.
  • Jignesh Patel, NCR and University of Wisconsin, Madison. Efficient Database Support for Spatial Applications.
  • Geoff Voelker, Computer Science, University of Washington, Seattle. Cooperative Caching in Local-Area and Wide-Area Networks.
  • Daniele Micciancio, Laboratory for Computer Science, MIT. The Complexity of Lattice and Coding Problems and Their Cryptographic Applications.
  • Warren Greiff, Computer Science, University of Massachusetts, Amherst. Empirical Methods, Probabilistic Modeling and Information Retrieval.

May 1999

  • Vivek Pai, Computer Science, Rice University. Cache Management in Scalable Network Servers.
  • Alan Demers, Oracle. Parallel Propagation of Updates in Oracle 8 Data Replication.

June 1999

  • Joxan Jaffar, Computer Science, National University of Singapore. Open Constraint Programming.