Person:672392

Available identifiers

zbMath Open westbrook.jeffery-rDBLP30/2017WikidataQ6175252 ScholiaQ6175252MaRDI QIDQ672392

List of research outcomes

Publication	Date of Publication	Type
Load balancing for response time	2023-05-08	Paper
Greedy algorithms for the on-line steiner tree and generalized steiner problems	2023-01-18	Paper
Fast incremental planarity testing	2019-12-04	Paper
Adaptive algorithms for PASO systems	2017-09-29	Paper
Online load balancing and network flow	2015-05-07	Paper
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems	2009-08-20	Paper
On finding common neighborhoods in massive graphs.	2003-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q4542546	2002-09-17	Paper
A functional approach to external graph algorithms	2002-05-21	Paper
https://portal.mardi4nfdi.de/entity/Q2753929	2001-11-11	Paper
An approximate determinization algorithm for weighted finite-state automata	2001-08-09	Paper
On the Determinization of Weighted Finite Automata	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4952670	2000-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q4952671	2000-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q4952710	2000-10-23	Paper
Robot Navigation with Distance Queries	2000-10-18	Paper
Load Balancing for Response Time	2000-05-09	Paper
https://portal.mardi4nfdi.de/entity/Q4252035	2000-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q4228502	1999-11-08	Paper
Competitive On-Line Algorithms for Distributed Data Management	1999-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4219042	1998-11-15	Paper
Dynamic 2-Connectivity with Backtracking	1998-09-21	Paper
Page Migration Algorithms Using Work Functions	1997-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q4335211	1997-04-23	Paper
Linear bounds for on-line Steiner problems	1997-02-28	Paper
Off-line algorithms for the list update problem	1997-02-27	Paper
Short encodings of planar graphs and maps	1996-03-11	Paper
The Performance of greedy algorithms for the on-line steiner tree and related problems	1995-11-14	Paper
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs	1994-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q3138871	1994-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q4010314	1992-09-27	Paper
Maintaining bridge-connected and biconnected components on-line	1992-06-28	Paper
Maintenance of a minimum spanning forest in a dynamic plane graph	1992-06-28	Paper
Amortized Analysis of Algorithms for Set Union with Backtracking	1989-01-01	Paper

Research outcomes over time

This page was built for person: Jeffery Westbrook