Jeffrey D. Oldham

According to our database, Jeffrey D. Oldham authored at least 6 papers between 1993 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

Combinatorial Approximation Algorithms for Generalized Flow Problems.

Jeffrey D. Oldham

J. Algorithms, 2001

2000

Accurate approximations for Asian options.

Donald Aingworth, Rajeev Motwani, Jeffrey D. Oldham

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Multicommodity and generalized flow algorithms: theory and practice.

Jeffrey D. Oldham

PhD thesis, 1999

Managing TCP Connections Under Persistent HTTP.

Edith Cohen, Haim Kaplan, Jeffrey D. Oldham

Comput. Networks, 1999

1998

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.

Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1993

Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool.

Mary W. Hall, Timothy J. Harvey, Ken Kennedy, Nathaniel McIntosh, Kathryn S. McKinley, Jeffrey D. Oldham, Michael H. Paleczny, Gerald Roth

Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1993