Presentations

MCMCF: Computational Tool for Checking Whether a Network Can Support a Given Set of Requirements

Jeffrey D. Oldham. Presentation on multicommodity flow research. Workshop on Routing and Switching, Center for Telecommunications at Stanford. 1997 September 04. Slides available at http://theory.stanford.edu/~oldham/talks/MCMCF-talk.ps.

MCMCF: A Tool for Network Design

Jeffrey D. Oldham. Presentation on multicommodity flow research. Center for Telecommunications at Stanford University 1997 Annual Research Review. 1997 November 18. Slides available at http://theory.stanford.edu/~oldham/talks/MCMCF-talk-short.ps.

Pork Bellies and Orange Juice: An Introduction to Multicommodity Flows

Jeffrey D. Oldham. An informal introduction to multicommodity flows presented at AT&T Labs 1998 June. Some of the presentation used a whiteboard but some slides are available at http://theory.stanford.edu/~oldham/talks/MCMCF-talk.ps.

A Simpler Combinatorial Generalized Flow Algorithm

Jeffrey D. Oldham. Presentation at the Stanford Algorithms Seminar about a network-flow-based approach to solving generalized shortest paths problems, i.e., shortest paths problems with losses and gains. 1998 September 24.

Generalized + Shortest Paths = Binary Search + Bellman-Ford

Jeffrey D. Oldham. Presentation on a network-flow-based approach to solving generalized shortest paths problems, i.e., shortest paths problems with losses and gains. Presented at the Bonn Workshop on Discrete Optimization, Institute for Discrete Mathematics, Bonn University, 1998 October 01. Slides available at http://theory.stanford.edu/~oldham/talks/Bonn98/gsp-Bonn.ps.

Parallel Algorithms for All-Sources Generalized Shortest Paths

Jeffrey D. Oldham. Presentation on using monotonic piecewise-linear functions and the Floyd-Warshall algorithm to yield a logarithmic-time PRAM algorithm for the all-sources generalized shortest paths problem. This joint work with Vaughan Pratt was presented at the 1999 ACM Symposium on Parallel Algorithms and Architectures Revue.

Implementing Generalized Shortest Paths Algorithms

Jeffrey D. Oldham. Presentation of the running times of various implementations of generalized shortest path algorithms described in my Ph.D. thesis. Presented at Informs 1999 November conference, 1999 November 07.

Parallel VSIPL Using VSIPL++

Mark Mitchell and Jeffrey D. Oldham. Supercomputing 2002, Baltimore, MD, Nov. 2002.

VSIPL++: Intuitive Programming Using C++ Templates

Mark Mitchell and Jeffrey D. Oldham. GOMACTECH 2003, 04 Apr 2003, Tampa, FL. http://www.gomactech.net/2003/.

VSIPL++ Specification and Implementations

Jeffrey D. Oldham. Quarterly presentations at the HPEC-SI Forum meetings at MIT Lincoln Laboratory, Lexington, MA. Present serial and distributed VSIPL++ specification and implementation information, C++ expression template loop fusion technology, VSIPL++ I/O, VSIPL++ example programs, on 2002 Jun 12, 2002 Sep 27, 2002 Dec 11, 2003 Mar 12, 2003 Jun 25, 2003 Aug 27, 2003 Nov 12, 2004 Feb 25, and 2004 May 19-20. Joint work with Mark Mitchell and Nathan Sidwell. http://www.hpec-si.org/.