Colloquium and Seminar Speakers

July 1995

Eric Torng, Michigan State University. A Unified Analysis of Paging and Caching.

Jean Utke, Technical University of Dresden, Germany. ADOL-C: A Tool for Automatic Differentiation.

Jean Utke, Technical University of Dresden, Germany. Newton Steps Without Forming the Jacobian.

September 1995

Zvi Galil, Columbia University. Cryptographic Protocols.

Neil Immerman, University of Massachusetts-Amherst and Visitor to Cornell University. Descriptive Complexity and Dynamic Complexity.

Dexter Kozen, Cornell University. Efficient Algorithms for Optimal Transmission of Video Data.

Cleve Moler, MathWorks. Matrix - The Mother of all Data Structures.

Tom M. Mitchell, Carnegie Mellon University. Machine Learning and Filtering the Information Flood.

Eva Tardos, Cornell University. Approximations for the Disjoint Paths Problem in Densely Embedded Graphs.

Jan Arne Telle, University of Bergen, Norway. Complexity of a Class of Vertex Partitioning Problems in Graphs.

October 1995

Ben Bederson, University of New Mexico. Padd++: A Zoomable Graphical Interface.

Rod Downey, Victoria University, Wellington, New Zealand. Positive Techniques for Parametric Complexity: Automata, Courcelle's Theorem, Seese's Theorem and Possibly well-quasi-orderings.

Kousha Etessami, DIMACS Rutgers University. Tree Canonization and Transitive Closure.

Bob Frankston, Microsoft Corporation. Operating Systems: Relics of the Past?

G. R. Gao, McGill University. An Overview of the EARTH (Efficient Architecture For Running Threads) Project.

Peter W. Kopke, Cornell University. Computing Simulations on Finite and Infinite Graphs.

Vladimir Kotlyar, Cornell University. The Bernouilli Project: Restructuring Compiler Technology for Sparse Matrix Computation.

Butler Lampson, Microsoft Corporation. How to Build a Highly Available System Without a Toolkit.

Susan Landau, University of Massachusetts - Amherst and Visitor to Cornell University. Codes, Keys and Conflicts: Issues in U.S. Crypto Policy.

Kurt Mehlhorn, Max-Planck-Institute, Germany. The LEDA Platform of Combinatorial and Geometric Computing.

David L. Waltz, NEC Research Institute and Brandeis University. Memory Based Reasoning: Insights and Applications.

November 1995

Farid Alizadeh, Rutgers University. Degeneracy in Semidefinite Programming and Its Implication in Interior Point Algorithms.

Sergei N. Artemov, Moscow University and Visitor to Cornell University. Provability Operators.

Dr. Klaus Boehmmer, Marburg, Germany. Numerical Liapunov-Schmidt Methods and Numerical Classifications of Higher Determined Singularities of Operator Equations.

Jim Gray, Microsoft Research. Parallel Database Systems - the Best Example So Far of a Scaleable Application.

Harold N. Gabow, University of Colorado. Arborescence Packing: A Case Study in Algorithm Design.

Anoop Gupta, Stanford University. The Stanford FLASH Multiprocessor: Hardware and Software.

Monika Rauch Henzinger, Cornell University. Monoton Sparsification and Dynamic Algorithms for Reachability Problems in Directed Graphs.

Elias Houstis, Purdue University. Multidisciplinary Problem Solving Environments (MPSEs): The Software Landscape for Computational Science Beyond 2000.

Henry Kautz, AT&T Bell Laboratories. Knowledge Compilation by Theory Approximation.

Roldan Pozo, National Institute of Standards and Technology. Linear Algebra Libraries in C++ for High Performance Architectures.

Yuri Rabinovich, Weizmann Institute, Israel and Visitor to Cornell University. The Geometry of Graphs and Some of Its Algorithmic Application.

Mark S. Shephard, Rensselaer Polytechnic Institute. Parallel Automated Adaptive Analysis.

Eva Tardos, Cornell University. Distributed Packet Routing in Networks.

December 1995

Dexter Kozen, Cornell University. On Regularity-Preserving Functions.

January 1996

Fred Gustavson, IBM Watson Research Center. An Efficient 3D Parallel Algorithm for Matrix Multiplication.

February 1996

Dana Ballard, University of Rochester. A Model of Vision Based on Visual Routines.

Neil Immerman, University of Massachusetts-Amherst and Visitor to Cornell University. Hardness of Approximations.

David E. Keys, Old Dominion University and ICASE, NASA Langley Research Center. Newton-Krylov-Schwarz: An Implicit Solver for CFD Applications.

Daniel Jackson, Carnegie Mellon University. Nitpick: A Specification Checker.

Vijaya Ramachandran, The University of Texas at Austin. The Design and Evaluation of Parallel Algorithms.

Bernd Reusch, University of Dortmund, Germany and Visitor to Cornell University. Being Crisp about Fuzzy Systems.

David Shmoys, Cornell University. Computing Near-Optimal Solutions to Combinatorial Problems.

James C. Wohlever, Cornell University. A Group Theoretic Approach to Nonlinear Bifurcation Analysis of Symmetric Structures.

PhD Super Colloquium:

Toby Driscoll, student of Lloyd N. Trefethen. Can One Hear the Shape of a Drum?

Peter Kopke, student of Thomas Henzinger. Theory of Rectangular Hybrid Automata.

Annie Liu, student of Tim Teitelbaum. Efficient Computation via Incremental Computation.

Rod Moten, student of Robert Constable. Nuprl as a Generic Theorem Prover.

Amit Singhal, student of Claire Cardie. Document Length Normalization in Information Retrieval.

Paul Stodghill, student of Keshav Pingali. Automatic Generation of Sparse Scientific Codes.

Scott Stoller, student of Fred Schneider. Tools for Evaluating Fault-tolerance in Systems.

Sam Weber, student of Bard Bloom. A Practical Methodology for Specification and Verification.

March 1996

Klaus Boehmer, Fachbereich Mathematik der Philipps-Universitaet, Germany. Numerical Liapunov-Schmidt-Methods for Operator Equations and Hybrid Tools.

Michael Dahlin, University of California at Berkeley. Serverless Network File Systems.

Joseph E. Flaherty, Rensselaer Polytechnic Institute. Adaptive and Parallel Computational Techniques for Partial Differential Equations.

Leonidas Kontothanassis, University of Rochester. Architectural and Operating System Support for Inexpensive, Efficient and Shared Memory.

Steven McCanne, Lawrence Berkeley National Laboratory and University of California at Berkeley. Scalable Multicast Video Transmission for the Internet.

Lewis McCarthy, University of Massachusetts-Amherst and Visitor to Cornell University. A P-time Approximation for Planar TSP.

Yuri Rabinovich, Weizmann Institute, Israel and Visitor to Cornell University. Approximation Algorithms for k-MST Problem.

Steven K. Reinhardt, University of Wisconsin-Madison. Mechanisms for Distributed Shared Memory.

April 1996

John Chapin, Stanford University. Hive: Fault Containment for Shared-Memory Multiprocessors.

Michael Feeley, University of Washington. Implementing Global Memory Management in a Workstation Cluster.

Seth Goldstein, University of California at Berkeley. Lazy Threads: Compiler and Runtime Foundations for Multi-Threading or Threads on the Cheap.

Barbara Grosz, Harvard University. Modeling Collaborative Plans for Group Activities.

Kathleen Fisher, Stanford University. Directions in Object-Oriented Programming Languages: Type Systems and Language Development.

Neil Immerman, University of Massachusetts-Amherst and Visitor to Cornell University. Transitive Closure Logic and Model Checking.

Jon Kleinberg, Massachusetts Institute of Technology. A Reconstruction Algorithm for Analyzing Molecular Structure.

Jon Kleinberg, Massachusetts Institute of Technology. Network Flow and Approximation.

Yannis Papakonstatinou, Stanford University. Query Processing in Heterogeneous Information Systems.

Praveen Seshadri, University of Wisconsin. Sequence Data Management.

Barry Smith, Argonne National Laboratory. The Use of PETSc for the Parallel Solution of PDEs.

Patrick Sobalvarro, Massachusetts Institute of Technology. Demand-based Coscheduling of Parallel Jobs on a Network of Workstations.

Jan Arne Telle. University of Bergen, Norway and Visitor to Cornell University. Approximation Algorithms for Independent Set and Graph Coloring (results of Ravi Boppana and Magnus Halldorsson).

May 1996

Brad Adelberg, Stanford University. STRIP: A Soft Real-Time Database for Open Systems.

Gal Berkooz, BEAM Technologies, Inc. PDESolve: A Framework for PDE Simulation.

Fabian Chudak, Cornell University. The Goemans and Williamson 2-Approximation Algorithm for the Feedback Vertex Set Problem.

Michael Godfrey, University of Toronto. A Framework for Visual System Configuration.

Uriel Feige, Weizmann Institute, Israel. Randomized Graph Products, Chromatic Numbers, and the Lovasz Theta Function.

S. Keshav, AT&T Research. A Perspective on End-to-End Quality of Service.

Go to:
Department Computing Facilities

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

If you have questions or comments please contact: