Jeffery R. Westbrook

Affiliations:
  • AT&T Shannon Laboratory, Florham Park, NJ, USA
  • Yale University, Department of Computer Science, New Haven, CT, USA
  • Princeton University, Department of Computer Science, NJ, USA


According to our database1, Jeffery R. Westbrook authored at least 46 papers between 1989 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput., 2008

2005
<i>Corrigendum: </i> a new, simpler linear-time dominators algorithm.
ACM Trans. Program. Lang. Syst., 2005

2003
On finding common neighborhoods in massive graphs.
Theor. Comput. Sci., 2003

2002
A Functional Approach to External Graph Algorithms.
Algorithmica, 2002

2001
An Approximate Determinization Algorithm for Weighted Finite-State Automata.
Algorithmica, 2001

2000
On the Determinization of Weighted Finite Automata.
SIAM J. Comput., 2000

Robot Navigation with Distance Queries.
SIAM J. Comput., 2000

Load Balancing for Response Time.
J. Algorithms, 2000

Generating adversaries for request-answer games.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Maintaining hierarchical graph views.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On external memory graph traversal.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Transport Network Architectures in an IP World.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Range Searching Over Tree Cross Products.
Proceedings of the Algorithms, 2000

1999
Competitive On-Line Algorithms for Distributed Data Management.
SIAM J. Comput., 1999

Future transport network architectures.
IEEE Commun. Mag., 1999

Approximation Algorithms for Restoration Capacity Planning.
Proceedings of the Algorithms, 1999

Algorithms for Restoration Planning in a Telecommunications Network.
Proceedings of the Algorithm Engineering and Experimentation, 1999

On-line Algorithms.
Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998
A New, Simpler Linear-Time Dominators Algorithm.
ACM Trans. Program. Lang. Syst., 1998

Dynamic 2-Connectivity with Backtracking.
SIAM J. Comput., 1998

On-Line Load Balancing and Network Flow.
Algorithmica, 1998

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.
Algorithmica, 1998

Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Shrinking language models by robust approximation.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

1997
Page Migration Algorithms Using Work Functions.
J. Algorithms, 1997

1996
Off-Line Algorithms for the List Update Problem.
Inf. Process. Lett., 1996

Robot Navigation with Range Queries.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Self-Organizing Data Structures.
Proceedings of the Online Algorithms, 1996

1995
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems.
Math. Syst. Theory, 1995

Linear Bounds for On-Line Steiner Problems.
Inf. Process. Lett., 1995

Short Encodings of Planar Graphs and Maps.
Discret. Appl. Math., 1995

1994
Randomized Algorithms for Multiprocessor Page Migration.
SIAM J. Comput., 1994

Randomized Competitive Algorithms for the List Update Problem.
Algorithmica, 1994

A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs.
Algorithmica, 1994

Dynamic Two-Connectivity with Backtracking.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Adaptive Algorithms for PASO Systems.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

On-Line Distributed Data Management.
Proceedings of the Algorithms, 1994

1993
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms, 1993

Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Online load balancing and network flow.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms, 1992

Maintaining Bridge-Connected and Biconnected Components On-Line.
Algorithmica, 1992

Fast Incremental Planarity Testing.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
Randomized Competitive Algorithms for the List Update Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Amortized Analysis of Algorithms for Set Union with Backtracking.
SIAM J. Comput., 1989


  Loading...