Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jeffrey D. Oldham

dblp:04/5687 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-authorSystems, architecture and hardware · 1Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Graph algorithms and graph theory · 46% Mathematical optimization · 31% Approximation and online algorithms · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 87% Program analysis · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational finance and economics
option pricing
0.012000
Accurate approximations for Asian options · SODA 2000
Approximation and online algorithms › approximation algorithms
combinatorial approximation algorithms
0.011999
Combinatorial Approximation Algorithms for Generalized Flow Problems · SODA 1999
Mathematical optimization
combinatorial optimization
0.011999
Combinatorial Approximation Algorithms for Generalized Flow Problems · SODA 1999
Graph algorithms and graph theory › graph algorithms › network flow
generalized flow
0.011999
Combinatorial Approximation Algorithms for Generalized Flow Problems · SODA 1999
Graph algorithms and graph theory › graph algorithms
network flow
0.011999
Combinatorial Approximation Algorithms for Generalized Flow Problems · SODA 1999
Compilers and program optimization
dependence analysis
0.011993
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool · PPoPP 1993
Compilers and program optimization
parallelizing compiler
0.011993
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool · PPoPP 1993
Parallel and multicore computing
parallel programming environment
0.011993
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool · PPoPP 1993

Methods — techniques the papers use, named apart from their topics

asymptotic approximation · 0.1combinatorial approximation · 0.0
YearPublicationVenuePosition
2000 Accurate approximations for Asian options
Donald Aingworth, Rajeev Motwani 0001, Jeffrey D. Oldham
SODA3
1999 Combinatorial Approximation Algorithms for Generalized Flow Problems
Jeffrey D. Oldham
SODA1
1999 Managing TCP Connections Under Persistent HTTP
Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
Comput. Networks3
1998 An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein 0001
IPCO2
1993 Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool
abstract
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses, provides a set of powerful interactive transformations, and supports program editing. This paper summarizes experiences of scientific programmers and tool designers using the ParaScope Editor. We evaluate existing features and describe enhancements in three key areas: user interface, analysis, and transformation. many existing features prove crucial to successful program parallelization. They include interprocedural array side-effect analysis and program and dependence view filtering. Desirable functionality includes improved program navigation based on performance estimation, incorporating user assertions in analysis and more guidance in selecting transformations. These results offer insights for the authors of a variety of programming tools and parallelizing compilers.
Mary W. Hall, Timothy J. Harvey, Ken Kennedy, Nathaniel McIntosh, Kathryn S. McKinley, Jeffrey D. Oldham, Michael H. Paleczny, Gerald Roth
PPoPP6