Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffery R. Westbrook
Person information
- affiliation: AT&T Shannon Laboratory, Florham Park, NJ, USA
- affiliation: Yale University, Department of Computer Science, New Haven, CT, USA
- affiliation: Princeton University, Department of Computer Science, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j26]Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook:
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38(4): 1533-1573 (2008)- 2005
- [j25]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) - 2003
- [j24]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On finding common neighborhoods in massive graphs. Theor. Comput. Sci. 299(1-3): 707-718 (2003) - 2002
- [j23]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. Algorithmica 32(3): 437-458 (2002) - [i1]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. CoRR cs.DS/0207061 (2002) - 2001
- [j22]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
An Approximate Determinization Algorithm for Weighted Finite-State Automata. Algorithmica 30(4): 503-526 (2001) - 2000
- [j21]Jeffery R. Westbrook:
Load Balancing for Response Time. J. Algorithms 35(1): 1-16 (2000) - [j20]Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu:
Robot Navigation with Distance Queries. SIAM J. Comput. 30(1): 110-144 (2000) - [j19]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On the Determinization of Weighted Finite Automata. SIAM J. Comput. 30(5): 1502-1531 (2000) - [c24]Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook:
Range Searching Over Tree Cross Products. ESA 2000: 120-131 - [c23]Robert D. Doverspike, Steven J. Phillips, Jeffery R. Westbrook:
Transport Network Architectures in an IP World. INFOCOM 2000: 305-314 - [c22]Todd Gormley, Nick Reingold, Eric Torng, Jeffery R. Westbrook:
Generating adversaries for request-answer games. SODA 2000: 564-565 - [c21]Adam L. Buchsbaum, Jeffery R. Westbrook:
Maintaining hierarchical graph views. SODA 2000: 566-575 - [c20]Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery R. Westbrook:
On external memory graph traversal. SODA 2000: 859-860
1990 – 1999
- 1999
- [j18]Robert D. Doverspike, Steven Phillips, Jeffery R. Westbrook:
Future transport network architectures. IEEE Commun. Mag. 37(8): 96-101 (1999) - [j17]Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan:
Competitive On-Line Algorithms for Distributed Data Management. SIAM J. Comput. 28(3): 1086-1111 (1999) - [c19]Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook:
Algorithms for Restoration Planning in a Telecommunications Network. ALENEX 1999: 194-209 - [c18]Steven J. Phillips, Jeffery R. Westbrook:
Approximation Algorithms for Restoration Capacity Planning. ESA 1999: 101-115 - [p1]Steven Phillips, Jeffery R. Westbrook:
On-line Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j16]Yefim Dinitz, Jeffery R. Westbrook:
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. Algorithmica 20(3): 242-276 (1998) - [j15]Steven J. Phillips, Jeffery R. Westbrook:
On-Line Load Balancing and Network Flow. Algorithmica 21(3): 245-261 (1998) - [j14]Johannes A. La Poutré, Jeffery R. Westbrook:
Dynamic 2-Connectivity with Backtracking. SIAM J. Comput. 28(1): 10-26 (1998) - [j13]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) - [c17]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. ESA 1998: 332-343 - [c16]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On the Determinization of Weighted Finite Automata. ICALP 1998: 482-493 - [c15]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
Shrinking language models by robust approximation. ICASSP 1998: 685-688 - [c14]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998: 279-288 - 1997
- [j12]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook:
Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997) - 1996
- [j11]Nick Reingold, Jeffery R. Westbrook:
Off-Line Algorithms for the List Update Problem. Inf. Process. Lett. 60(2): 75-80 (1996) - [c13]Susanne Albers, Jeffery R. Westbrook:
Self-Organizing Data Structures. Online Algorithms 1996: 13-51 - [c12]Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu:
Robot Navigation with Range Queries. STOC 1996: 469-478 - 1995
- [j10]Kenneth Keeler, Jeffery R. Westbrook:
Short Encodings of Planar Graphs and Maps. Discret. Appl. Math. 58(3): 239-252 (1995) - [j9]Jeffery R. Westbrook, Dicky C. K. Yan:
Linear Bounds for On-Line Steiner Problems. Inf. Process. Lett. 55(2): 59-63 (1995) - [j8]Jeffery R. Westbrook, Dicky C. K. Yan:
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems. Math. Syst. Theory 28(5): 451-468 (1995) - [c11]Jeffery R. Westbrook:
Load Balancing for Response Time. ESA 1995: 355-368 - 1994
- [j7]Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994) - [j6]Heather Booth, Jeffery R. Westbrook:
A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs. Algorithmica 11(4): 341-352 (1994) - [j5]Jeffery R. Westbrook:
Randomized Algorithms for Multiprocessor Page Migration. SIAM J. Comput. 23(5): 951-965 (1994) - [c10]Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan:
On-Line Distributed Data Management. ESA 1994: 202-214 - [c9]Jeffery R. Westbrook, Lenore D. Zuck:
Adaptive Algorithms for PASO Systems. PODC 1994: 264-273 - [c8]Johannes A. La Poutré, Jeffery R. Westbrook:
Dynamic Two-Connectivity with Backtracking. SODA 1994: 204-212 - 1993
- [j4]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) - [c7]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook:
Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415 - [c6]Steven J. Phillips, Jeffery R. Westbrook:
Online load balancing and network flow. STOC 1993: 402-411 - [c5]Jeffery R. Westbrook, Dicky C. K. Yan:
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems. WADS 1993: 622-633 - 1992
- [j3]Jeffery R. Westbrook, Robert Endre Tarjan:
Maintaining Bridge-Connected and Biconnected Components On-Line. Algorithmica 7(5&6): 433-464 (1992) - [j2]David Eppstein, Giuseppe F. Italiano
, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) - [c4]Jeffery R. Westbrook:
Fast Incremental Planarity Testing. ICALP 1992: 342-353 - 1991
- [c3]Jeffery R. Westbrook:
Randomized Algorithms for Multiprocessor Page Migration. On-Line Algorithms 1991: 135-150 - [c2]Sandy Irani, Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260 - 1990
- [c1]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11
1980 – 1989
- 1989
- [j1]Jeffery R. Westbrook, Robert Endre Tarjan:
Amortized Analysis of Algorithms for Set Union with Backtracking. SIAM J. Comput. 18(1): 1-11 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
