Colloquium and Seminar Speakers 1994-1995


August 1994

Walter Ludwig, University of Wisconsin. Scheduling Parallel Tasks to Minimize Average Completion Time.

September 1994

Richard Platek, Cornell University. From Theory to Practice: Transitioning Formal Methods to Industry.

David E. Shaw, D.E. Shaw & Co. Computational Finance.

David Tennenhouse, Massachusetts Institute of Technology. Second Generation Multimedia—Software Strikes Back!

Richard J. Lipton, Princeton University. Quantum Computers: How Powerful Are They?

Dexter Kozen, Cornell University. Set Constraints and Logic Programming.

Aravind Srinivasan, Institute for Advanced Studies. Computing with Very Weak Random Sources.

Sandy Irani, University of California, Irvine. On Algorithm Design for Metrical Task Systems.

October 1994

Bruce Croft, University of Massachusetts. Beyond Ranked Documents: Research Directions at the Center for Intelligent Information Retrieval.

Marc Levoy, Stanford University. A Project to Build a 3D Fax Machine.

Christos Papadimitriou, University of California, San Diego. Shortest Paths without a Map: A Survey of On-line Algorithms.

Alberto Sangiovanni-Vincentelli, University of California, Berkeley. The Design and Analysis of Embedded Controllers.

Kjartan Stefansson, Cornell University. Newtonian Graphs and Riemann Surfaces.

Monika Rauch Henzinger, Cornell University. Fully Dynamic Cycle-Equivalence—A First Step Towards Incremental Compilation.

November 1994

Alex Pentland, Massachusetts Institute of Technology. Video and Image Semantics: Advanced Tools for Telecommunications.

Guy Steele, Sun Microsystems Laboratories. Principled Design of Programming Languages.

David Harel, The Weizman Institute of Science. On Drawing Graphics Nicely.

Leszek Pacholski, University of Wroclaw, Poland. Solving Set Constraints with Projections.

Matthew Dickerson, Middlebury College. A Fast Conformal Algorithm for Greedy Triangulation.

December 1994

Albert Meyer, Massachusetts Institute of Technology. Concurrent Process Equivalences: Some Decision Problems.

January 1995

David Alberts, Free University Berlin, Germany. Average Case Analysis of Dynamic Graph Algorithms.

Ronitt Rubinfeld, Cornell University. New Directions and Applications for Learning Finite Automata.

February 1995

Marianne Winslett, University of Illinois. Data Management Techniques for Large Persistent Arrays in Scientific Computation.

Martin Abadi, Digital Equipment Corporation, Systems Research Center. Authentication in Distributed Systems: Principles and Pitfalls.

Richard Szeliski, Cambridge Research Lab, Digital Equipment Corporation. Video Mosaics and Virtual Reality Applications.

David E. Culler, University of California, Berkeley. A Case for NOW (Networks of Workstations).

Jerzy Tiuryn, Warsaw University, Poland. Bi-Coercibility for Polymorphic Types.

Serge Plotkin, Stanford University. Online Routing and Admission Control in ATM Networks.

Ran Canetti,, Weizmann Institute, Israel. On the Power of Preemption in Resource Allocation.

March 1995

Dan Suciu, University of Pennsylvania. Design and Implementation of Parallel Database Programming Languages for Collections.

Joseph Hellerstein, University of Wisconsin. Optimization and Execution of Queries with Expensive Methods.

Yoram Singer, The Hebrew University of Jerusalem. The Design and Analysis of Models and Algorithms for Human-Machine Interaction.

Gregory Morrisett, Carnegie Mellon University. Type-Based Implementations of High-Level Programming Languages.

PhD Super-Colloquium:

Bruce Hoppe, student of Eva Tardos. The Quickest Transshipment Problem.

Mary Ann Branch, student of Tom Coleman. Inexact Reflective Newton Methods for Large-Scale Optimization.

Pei-Hsin Ho, student of Tom Henzinger. Automatic Analysis of Hybrid Systems.

Dawson Dean, student of Richard Zippel. Data Storage for Compound Documents and Component Software.

Kjartan Stefansson, student of Dexter Kozen. Newtonian Graphs, Riemann Surfaces and Computation.

April 1995

Eugene Charniak, Brown University. Syntactic Disambiguation through Word Statistics and Why You Should Care about It.

James O’Toole, Massachusetts Institute of Technology. Log-Based Replicating Garbage Collection.

Daphne Koller, University of California, Berkeley. Practical Solutions to Game Theoretic Problems.

Joseph Halpern, IBM Almaden Research Center. Plausibility Measures and Default Reasoning.

Robert Blumofe, Massachusetts Institute of Technology. Executing Multithreaded Programs Efficiently.

Pei Cao, Princeton University. Application-Controlled File Caching and Prefetching.

Monika Rauch Henzinger, Cornell University. Dynamic Graph Algorithms in Polylogarithmic Time per Operation.

Dana Randall, Institute for Advanced Study. Generating Random Surfaces, Tilings and Eulerian Orientations.

Peter Kopke, Cornell University. What’s Decidable about Hybrid Automata?

Michael Luby, International Computer Science Institute and University of California-Berkeley. Resilient Video Transmission.

May 1995

David Harel, Weizmann Institute and Visiting Professor, Cornell University. How Hard Is It to Reason about Propositional Programs?

Silvio Micali, Massachusetts Institute of Technology. How to Check NP-Complete Problem Solvers.

Jon Kleinberg, Massachusetts Institute of Technology. Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.

June 1995

Jin-yi Cai, SUNY-Buffalo. The Resolution of a Hartmanis Conjecture.


Return to:
1994-1995 Annual Report Home Page
Departmental Home Page

If you have questions or comments please contact: www@cs.cornell.edu.


Last modified: 20 November 1995 by Denise Moore (denise@cs.cornell.edu).