Next:
Education
Jeffrey D. Oldham
938 Clark Ave. #34
Mountain View, CA 94040-2244
650.968.0708
oldham@cs.stanford.edu
http://theory.stanford.edu/~oldham/
Department of Computer Science
Trinity University
715 Stadium Drive
San Antonio, TX 78712-7200
oldham@cs.trinity.edu
210.999.8139 (voice)
210.999.7477 (fax)
http://theory.stanford.edu/~oldham/
http://www.cs.trinity.edu/~joldham/ (soon)
Education
Ph.D. in Computer Science (1992-99)
M.S. in Computer Science (1992-96)
B.A. in Computer Science (1987-91)
Work and Teaching Experience
Software Engineer (June 2000-)
Assistant Professor (August 1999-May 2000)
Visiting Assistant Professor (Spring 1999)
Summer Employee (Summer 1998)
Teaching Assistant for Intensive C
+
+
Course (Summer 1997)
Instructor for Compiler Course (Summer 1996)
Instructor for Programming Languages Course (Summer 1995)
Teaching Assistant for Compiler Optimization Course (Winter 1995)
Software Consultant (Summers 1992, 1993)
Research Programmer (May 1991-May 1992)
Teaching Assistant for Introductory Computer Science Math Course (Summer and Autumn 1991)
Teaching Assistant for Introductory Programming Course (Spring 1991)
Mathematician (Summers 1989, 1990)
Tutor for Multivariate Calculus Course (Spring 1988)
Publications
Multicommodity and Generalized Flows: Theory and Practice
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flows
Combinatorial Approximation Algorithms for Generalized Flow Problems
Parallel Algorithms for the All-Sources Generalized Shortest Paths Problem
Accurate Approximations for Asian Options
How to Beat Random Sampling Every Time
Means for Searching
The Incremental Investment Problem: Determining Sustainable Withdrawal and Accumulation Rates
Managing TCP Connections Under Persistent HTTP
Experiences Using the ParaScope Editor: An Interactive Parallel Programming Tool
Presentations
MCMCF: Computational Tool for Checking Whether a Network Can Support a Given Set of Requirements
MCMCF: A Tool for Network Design
Pork Bellies and Orange Juice: An Introduction to Multicommodity Flows
A Simpler Combinatorial Generalized Flow Algorithm
Generalized + Shortest Paths = Binary Search +Bellman-Ford
Parallel Algorithms for All-Sources Generalized Shortest Paths
Implementing Generalized Shortest Paths Algorithms
Software Development
Generalized Shortest Paths Implementations (1998-99)
Multicommodity Flow Approximation Implementation (1995-97)
DNA Sequence Alignment Program (Spring 1995)
ParaScope Editor (May 1991-May 1992)
Literature Reviews
Publication Work
Technical Illustrator
Accuracy Checker, Computer Algebra System Exercise Reviewer, Exercise Answer Checker
Accuracy Checker
Accuracy Checker
Accuracy Checker
Reviewer
Manuscript Reviewer
Manuscript Reviewer
Book Proposal Reviewer
Technical Consultant
Leadership Positions
Algorithms Seminar and Theory Colloquium Coordinator (1993-95)
Graduate Resident Assistant (1993-97)
Graduate Housing Advisory Committee Chairperson (1992-94)
Rice University Interviewer (1994-1999)
Administrative Council Chairperson (1996-1999)
Lay Minister (1996-1999)
Staff-Parish Relations Committee member (1995-97)
Service Project Coordinator (1991-92)
Jeffrey David Oldham
2000-08-23