J
Jeffery Westbrook
Researcher at Yale University
Publications - 39
Citations - 1703
Jeffery Westbrook is an academic researcher from Yale University. The author has contributed to research in topics: Competitive analysis & Deterministic algorithm. The author has an hindex of 22, co-authored 39 publications receiving 1653 citations. Previous affiliations of Jeffery Westbrook include Princeton University & AT&T.
Papers
More filters
Proceedings ArticleDOI
Maintenance of a minimum spanning forest in a dynamic planar graph
David Eppstein,Giuseppe F. Italiano,Roberto Tamassia,Robert E. Tarjan,Jeffery Westbrook,Moti Yung +5 more
TL;DR: The algorithms can be used to maintain the connected components of a dynamic planar graph in O(log n) time per operation.
Journal ArticleDOI
Maintaining bridge-connected and biconnected components on-line
TL;DR: A modified version of the dynamic trees of Sleator and Tarjan is developed that is suitable for efficient recursive algorithms, and used to reduce the running time of the algorithms for both problems toO(mα(m,n), where α is a functional inverse of Ackermann's function.
Journal ArticleDOI
Maintenance of a minimum spanning forest in a dynamic plane graph
TL;DR: In this paper, an edge-ordered dynamic tree (EDDT) data structure is proposed for maintaining a minimum spanning forest of a plane graph subject to on-line modifications, such as changes in the edge weights and insertion and deletion of edges and vertices which are consistent with the given embedding.
Journal ArticleDOI
Short encodings of planar graphs and maps
TL;DR: These results improve on the constants of previous schemes and can be achieved with simple encoding algorithms and are near-optimal in number of bits per edge.
Proceedings ArticleDOI
Randomized competitive algorithms for the list update problem
TL;DR: A simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani is given, and is the first randomized competitive algorithm with this property to beat the deterministic lower bound.