 | 2008 |
|---|
| 48 |       | Adam L. Buchsbaum,
Loukas Georgiadis,
Haim Kaplan,
Anne Rogers,
Robert Endre Tarjan,
Jeffery Westbrook:
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput. 38(4): 1533-1573 (2008) |
| 2005 |
|---|
| 47 | | Adam L. Buchsbaum,
Haim Kaplan,
Anne Rogers,
Jeffery Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm.
ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) |
| 2003 |
|---|
| 46 | | Adam L. Buchsbaum,
Raffaele Giancarlo,
Jeffery Westbrook:
On finding common neighborhoods in massive graphs.
Theor. Comput. Sci. 1-3(299): 707-718 (2003) |
| 2002 |
|---|
| 45 | | James Abello,
Adam L. Buchsbaum,
Jeffery Westbrook:
A Functional Approach to External Graph Algorithms.
Algorithmica 32(3): 437-458 (2002) |
| 44 | | Adam L. Buchsbaum,
Haim Kaplan,
Anne Rogers,
Jeffery Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators
CoRR cs.DS/0207061: (2002) |
| 2001 |
|---|
| 43 | | Adam L. Buchsbaum,
Raffaele Giancarlo,
Jeffery Westbrook:
An Approximate Determinization Algorithm for Weighted Finite-State Automata.
Algorithmica 30(4): 503-526 (2001) |
| 2000 |
|---|
| 42 | | Adam L. Buchsbaum,
Michael T. Goodrich,
Jeffery Westbrook:
Range Searching Over Tree Cross Products.
ESA 2000: 120-131 |
| 41 | | Robert D. Doverspike,
Steven J. Phillips,
Jeffery Westbrook:
Transport Network Architectures in an IP World.
INFOCOM 2000: 305-314 |
| 40 | | Todd Gormley,
Nick Reingold,
Eric Torng,
Jeffery Westbrook:
Generating adversaries for request-answer games.
SODA 2000: 564-565 |
| 39 | | Adam L. Buchsbaum,
Jeffery Westbrook:
Maintaining hierarchical graph views.
SODA 2000: 566-575 |
| 38 | | Adam L. Buchsbaum,
Michael H. Goldwasser,
Suresh Venkatasubramanian,
Jeffery Westbrook:
On external memory graph traversal.
SODA 2000: 859-860 |
| 37 |  | Jeffery Westbrook:
Load Balancing for Response Time.
J. Algorithms 35(1): 1-16 (2000) |
| 36 | | Dana Angluin,
Jeffery Westbrook,
Wenhong Zhu:
Robot Navigation with Distance Queries.
SIAM J. Comput. 30(1): 110-144 (2000) |
| 35 | | Adam L. Buchsbaum,
Raffaele Giancarlo,
Jeffery Westbrook:
On the Determinization of Weighted Finite Automata.
SIAM J. Comput. 30(5): 1502-1531 (2000) |
| 1999 |
|---|
| 34 | | S. Cwilich,
M. Deng,
D. F. Lynch,
S. J. Philips,
Jeffery Westbrook:
Algorithms for Restoration Planning in a Telecommunications Network.
ALENEX 1999: 194-209 |
| 33 | | Steven J. Phillips,
Jeffery Westbrook:
Approximation Algorithms for Restoration Capacity Planning.
ESA 1999: 101-115 |
| 32 | | Carsten Lund,
Nick Reingold,
Jeffery Westbrook,
Dicky C. K. Yan:
Competitive On-Line Algorithms for Distributed Data Management.
SIAM J. Comput. 28(3): 1086-1111 (1999) |
| 1998 |
|---|
| 31 | | James Abello,
Adam L. Buchsbaum,
Jeffery Westbrook:
A Functional Approach to External Graph Algorithms.
ESA 1998: 332-343 |
| 30 | | Adam L. Buchsbaum,
Raffaele Giancarlo,
Jeffery Westbrook:
On the Determinization of Weighted Finite Automata.
ICALP 1998: 482-493 |
| 29 | | Adam L. Buchsbaum,
Haim Kaplan,
Anne Rogers,
Jeffery Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
STOC 1998: 279-288 |
| 28 | | Adam L. Buchsbaum,
Haim Kaplan,
Anne Rogers,
Jeffery Westbrook:
A New, Simpler Linear-Time Dominators Algorithm.
ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) |
| 27 | | Yefim Dinitz,
Jeffery Westbrook:
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.
Algorithmica 20(3): 242-276 (1998) |
| 26 | | Steven J. Phillips,
Jeffery Westbrook:
On-Line Load Balancing and Network Flow.
Algorithmica 21(3): 245-261 (1998) |
| 25 | | Johannes A. La Poutré,
Jeffery Westbrook:
Dynamic 2-Connectivity with Backtracking.
SIAM J. Comput. 28(1): 10-26 (1998) |
| 1997 |
|---|
| 24 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
J. Algorithms 24(1): 124-157 (1997) |
| 1996 |
|---|
| 23 | | Susanne Albers,
Jeffery Westbrook:
Self-Organizing Data Structures.
Online Algorithms 1996: 13-51 |
| 22 | | Dana Angluin,
Jeffery Westbrook,
Wenhong Zhu:
Robot Navigation with Range Queries.
STOC 1996: 469-478 |
| 21 | | Nick Reingold,
Jeffery Westbrook:
Off-Line Algorithms for the List Update Problem.
Inf. Process. Lett. 60(2): 75-80 (1996) |
| 1995 |
|---|
| 20 | | Jeffery Westbrook:
Load Balancing for Response Time.
ESA 1995: 355-368 |
| 19 | | Kenneth Keeler,
Jeffery Westbrook:
Short Encodings of Planar Graphs and Maps.
Discrete Applied Mathematics 58(3): 239-252 (1995) |
| 18 | | Jeffery Westbrook,
Dicky C. K. Yan:
Linear Bounds for On-Line Steiner Problems.
Inf. Process. Lett. 55(2): 59-63 (1995) |
| 17 | | Jeffery Westbrook,
Dicky C. K. Yan:
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems.
Mathematical Systems Theory 28(5): 451-468 (1995) |
| 1994 |
|---|
| 16 | | Carsten Lund,
Nick Reingold,
Jeffery Westbrook,
Dicky C. K. Yan:
On-Line Distributed Data Management.
ESA 1994: 202-214 |
| 15 | | Jeffery Westbrook,
Lenore D. Zuck:
Adaptive Algorithms for PASO Systems.
PODC 1994: 264-273 |
| 14 | | Johannes A. La Poutré,
Jeffery Westbrook:
Dynamic Two-Connectivity with Backtracking.
SODA 1994: 204-212 |
| 13 | | Nick Reingold,
Jeffery Westbrook,
Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem.
Algorithmica 11(1): 15-32 (1994) |
| 12 | | Heather Booth,
Jeffery Westbrook:
A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs.
Algorithmica 11(4): 341-352 (1994) |
| 11 | | Jeffery Westbrook:
Randomized Algorithms for Multiprocessor Page Migration.
SIAM J. Comput. 23(5): 951-965 (1994) |
| 1993 |
|---|
| 10 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
ISAAC 1993: 406-415 |
| 9 | | Steven Phillips,
Jeffery Westbrook:
Online load balancing and network flow.
STOC 1993: 402-411 |
| 8 | | Jeffery Westbrook,
Dicky C. K. Yan:
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems.
WADS 1993: 622-633 |
| 7 | | David Eppstein,
Giuseppe F. Italiano,
Roberto Tamassia,
Robert Endre Tarjan,
Jeffery Westbrook,
Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms 15(1): 173 (1993) |
| 1992 |
|---|
| 6 | | Jeffery Westbrook:
Fast Incremental Planarity Testing.
ICALP 1992: 342-353 |
| 5 | | Jeffery Westbrook,
Robert Endre Tarjan:
Maintaining Bridge-Connected and Biconnected Components On-Line.
Algorithmica 7(5&6): 433-464 (1992) |
| 4 | | David Eppstein,
Giuseppe F. Italiano,
Roberto Tamassia,
Robert Endre Tarjan,
Jeffery Westbrook,
Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms 13(1): 33-54 (1992) |
| 1991 |
|---|
| 3 | | Sandy Irani,
Nick Reingold,
Jeffery Westbrook,
Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem.
SODA 1991: 251-260 |
| 1990 |
|---|
| 2 | | David Eppstein,
Giuseppe F. Italiano,
Roberto Tamassia,
Robert Endre Tarjan,
Jeffery Westbrook,
Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph.
SODA 1990: 1-11 |
| 1989 |
|---|
| 1 | | Jeffery Westbrook,
Robert Endre Tarjan:
Amortized Analysis of Algorithms for Set Union with Backtracking.
SIAM J. Comput. 18(1): 1-11 (1989) |
