Colloquium and Seminar Speakers

July '96 Sept. '96 Oct. '96 Nov. '96 Dec. '96
Jan. '97 Feb. '97 March '97 April 97 May 97

July 1996

Paul Plassmann, Argonne National Laboratory. BlockSolve95 ? software for the efficient parallel solution of sparse linear systems.
Paul Plassmann, Argonne National Laboratory. Parallel algorithms for adaptive refinement and quality improvement of unstructured meshes

September 1996

Paul Chew, Cornell University. Guaranteed quality Delaunay meshing in 3D.
James W. Demmel, University of California at Berkeley. Exploiting memory hierarchies in high performance computing.
Dan Huttenlocher, Cornell University. Using two-dimensional image matching to interpret the three-dimensional world.
Richard Kieburtz, NSF and Oregon Graduate Institute. Encapsulated effects.
S. Ravi Kumar, Cornell University. Efficient self-testing/self-correction of linear recurrences.
David Pearson, Cornell University. A parallel algorithm for RSA.
Justin Rattner, Server Architecture Lab, Intel Corporation. System area networks.
Fred Smith, Cornell University. Kleene algebra with tests: completeness and decidability.
Nicholas Zabaras, Cornell University. Inverse problems in materials processing.

October 1996

Fran Allen, T.J. Watson Research Center. The emerging virtual enterprise.
Ken Birman, Cornell University. The ensemble project: a research overview.
Christian Bischof, Argonne National Laboratory. Computational differentiation: going beyond ``black-box'' automatic differentiation tools.
Michael L. Brodie, GTE Laboratories Incorporated. Silver bullet shy on legacy mountain: when neat technology just doesn’t work, or, miracles to save the realm: Faustian bargains or noble pursuits.
Larry D. Brown, Cornell University. Imaging the Earth's deep interior: exploration frontiers and computational challenges.
Funda Ergun, Cornell University. Approximate checking of polynomials and functional equations.
Dexter Kozen, Cornell University. Complexity of set constraints.
Igor Pak, Harvard University. Generating random nonsingular matrices over the finite field. Or how mathematician would do it.
Fernando Pereira, AT&T Labs Research. Speech recognition by composition of weighted finite automata.
Ronitt Rubinfeld, Cornell University. Robust functional equations with applications to program testing and correcting.

November 1996

Fabian Chudak, Cornell University. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds.
Jason Hickey, Cornell University. Formal foundations for object-oriented programming.
Michael Kearns, AT&T Laboratories Research. On the boosting ability of top-down decision tree learning algorithms.
Benjamin Pierce, Indiana University. Comparing object encodings.
Lawrence A. Rowe, University of California at Berkeley. Ubiquitous digital video.
Aravind Srinivasan, Cornell University. Improving the discrepancy bound for sparse matrices: better approximation for sparse lattice approximation problems.
Leslie G. Valiant, Harvard University. The BSP approach to transportable parallel software.
Steve Wright, Argonne National Laboratory. Rapid convergence of nonlinear programming algorithms to degenerate solutions.

December 1996

Sergei Artemov, Cornell University. Operational modal logic.
Ioana Banicescu, Mississippi State University and NSF ? ERC for Computational Field Simulation. Partitioning and scheduling n-body simulations with fractiling.
Oded Goldrich, Weizmann Institute, Israel. Probabilistic proof systems.
Subrata Mukherjee, Cornell University. Two applications of shape optimization: elasto-plasticity and micro-electro-mechanical systems.
Dana Ron, MIT. Testing graph properties.

January 1997

Bruce Donald, Cornell University. Algorithmic foundations for planar force-field devices: geometric algorithms for massively-parallel distributed manipulation.
Ronitt Rubinfeld, Cornell University. Short paths in expander graphs.
Tandy Warnow, University of Pennsylvania. Inferring big divergent trees from realistic length biomolecular sequences.

February 1997

Nathan Edwards, Cornell University. Fair scheduling of high bandwidth multicasts on trees.
Robert Harper, Carnegie Mellon University. The practice of type theory: compiling modules in the TIL/ML compiler.
Jon Kleinberg, Cornell University. Nearest-neighbor search in high dimensions.
Dexter Kozen, Cornell University. Block interleavers with minimal latency.
Avi Silberschatz, Information Sciences Research Center, Bell Laboratories. On the storage and retrieval of multimedia data.
Éva Tardos, Cornell University. Allocating bandwidth for bursty connections.

Ph.D. Super-Colloquium:
March 1997

Persi Diaconis, Harvard University and Cornell University. Probability and cryptography.
Luis Gravano, Stanford University. Querying multiple sources across the Internet.
Cliff Stein, Dartmouth College. Minimum cuts: new algorithms and implementations.

April 1997

Howard C. Crabb, Interactive Computer Engineering, Inc. Product development ? 21st century ? a return to basics.
Ron Elber, Hebrew University, Israel. Computational aspects of structure and dynamics of proteins.
Cormac Flanagan, Rice University. Effective static debugging via componential set-based analysis.
Lisa Fleischer, Cornell University. Faster algorithms for the quickest transshipment problem.
Gregory Ganger, MIT Lab for Computer Science. System software support for I/O-intensive applications.
Sampath Kannan, University of Pennsylvania. Maximum likelihood reconstruction of evolutionary trees.
Tracy Kimbrel, University of Washington-Seattle. Parallel prefetching and caching for file systems.
Dan Roth, Weizmann Institute of Science, Israel. Learning to perform knowledge-intensive inferences.
Steven Rudich, Carnegie Mellon University. Gaps, isomorphisms, and stop gaps.
Bart Selman, AT&T Laboratories. Stochastic search and phase transitions: artificial intelligence meets physics.
Mona Singh, DIMACS and Princeton University. Computational methods for protein structural motif recognition.

May 1997

I. Ilkay Boduroglu, Columbia University. Scalable massively parallel simplex algorithms for block-structured LP problems.
Terry Gaasterland, University of Chicago. Automated whole genome interpretation.
Lillian Lee, Harvard University. Similarity-based approaches to natural language processing.
Michael Lesk, Information Sciences Research Laboratory, Bellcore. Practical digital libraries.

This site was last modified on 06/22/99.