Jeffery Westbrook

1.8k total citations
34 papers, 766 citations indexed

About

Jeffery Westbrook is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Jeffery Westbrook has authored 34 papers receiving a total of 766 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Networks and Communications, 21 papers in Computational Theory and Mathematics and 14 papers in Artificial Intelligence. Recurrent topics in Jeffery Westbrook's work include Optimization and Search Problems (16 papers), Advanced Graph Theory Research (8 papers) and Complexity and Algorithms in Graphs (8 papers). Jeffery Westbrook is often cited by papers focused on Optimization and Search Problems (16 papers), Advanced Graph Theory Research (8 papers) and Complexity and Algorithms in Graphs (8 papers). Jeffery Westbrook collaborates with scholars based in United States, Italy and Israel. Jeffery Westbrook's co-authors include Robert E. Tarjan, Adam L. Buchsbaum, Nick Reingold, Steven Phillips, Haim Kaplan, Anne Rogers, Giuseppe F. Italiano, Moti Yung, David Eppstein and Roberto Tamassia and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Jeffery Westbrook

32 papers receiving 683 citations

Peers

Jeffery Westbrook

CNC

CTM

CGCD

IME

Y. Bartal Israel

Elias Dahlhaus Germany

Satish Rao United States

Tsunehiko Kameda Canada

Roy Schwartz Israel

Julia Chuzhoy United States

Bala Kalyanasundaram United States

Fǎnicǎ Gavril Israel

Liam Roditty Israel

Linda Pagli Italy

Y. Bartal Israel

Jeffery Westbrook

654 ×1.4

CNC

354 ×1.0

CTM

179 ×0.8

93 ×0.9

CGCD

107 ×1.3

IME

Citations per year, relative to Jeffery Westbrook Jeffery Westbrook (= 1×) peers Y. Bartal

Countries citing papers authored by Jeffery Westbrook

Since Specialization

Citations

This map shows the geographic impact of Jeffery Westbrook's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jeffery Westbrook with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffery Westbrook more than expected).

Fields of papers citing papers by Jeffery Westbrook

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jeffery Westbrook. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jeffery Westbrook. The network helps show where Jeffery Westbrook may publish in the future.

Co-authorship network of co-authors of Jeffery Westbrook

This figure shows the co-authorship network connecting the top 25 collaborators of Jeffery Westbrook. A scholar is included among the top collaborators of Jeffery Westbrook based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jeffery Westbrook. Jeffery Westbrook is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Buchsbaum, Adam L., Loukas Georgiadis, Haim Kaplan, et al.. (2008). Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM Journal on Computing. 38(4). 1533–1573. 30 indexed citations

Buchsbaum, Adam L., Haim Kaplan, Anne Rogers, & Jeffery Westbrook. (2005). Corrigendum: a new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems. 27(3). 383–387. 8 indexed citations

Buchsbaum, Adam L., Raffaele Giancarlo, & Jeffery Westbrook. (2003). On finding common neighborhoods in massive graphs. Theoretical Computer Science. 299(1-3). 707–718. 13 indexed citations

Buchsbaum, Adam L., Haim Kaplan, Anne Rogers, & Jeffery Westbrook. (2002). Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. arXiv (Cornell University). 1 indexed citations

Buchsbaum, Adam L., Michael H. Goldwasser, Suresh Venkatasubramanian, & Jeffery Westbrook. (2000). On external memory graph traversal. Symposium on Discrete Algorithms. 859–860. 65 indexed citations

Gormley, Todd A., et al.. (2000). Generating adversaries for request-answer games. Symposium on Discrete Algorithms. 564–565. 31 indexed citations

Buchsbaum, Adam L., Raffaele Giancarlo, & Jeffery Westbrook. (2000). On the Determinization of Weighted Finite Automata. SIAM Journal on Computing. 30(5). 1502–1531. 28 indexed citations

Poutré, J. A. La & Jeffery Westbrook. (1998). Dynamic 2-Connectivity with Backtracking. SIAM Journal on Computing. 28(1). 10–26.

Lund, Carsten, et al.. (1998). Competitive On-Line Algorithms for Distributed Data Management. SIAM Journal on Computing. 28(3). 1086–1111. 16 indexed citations

10.

Phillips, Steven & Jeffery Westbrook. (1998). On-Line Load Balancing and Network Flow. Algorithmica. 21(3). 245–261. 9 indexed citations

11.

Chrobák, Marek, Lawrence L. Larmore, Nick Reingold, & Jeffery Westbrook. (1997). Page Migration Algorithms Using Work Functions. Journal of Algorithms. 24(1). 124–157. 15 indexed citations

12.

Reingold, Nick & Jeffery Westbrook. (1996). Off-line algorithms for the list update problem. Information Processing Letters. 60(2). 75–80. 9 indexed citations

13.

Angluin, Dana, et al.. (1996). Robot navigation with range queries. 469–478. 9 indexed citations

14.

Albers, Susanne & Jeffery Westbrook. (1996). A survey of self-organizing data structures. Max Planck Digital Library. 1 indexed citations

15.

Westbrook, Jeffery, et al.. (1995). The Performance of greedy algorithms for the on-line steiner tree and related problems. Theory of Computing Systems. 28(5). 451–468. 7 indexed citations

16.

Westbrook, Jeffery, et al.. (1995). Linear bounds for on-line Steiner problems. Information Processing Letters. 55(2). 59–63. 3 indexed citations

17.

Eppstein, David, Giuseppe F. Italiano, Roberto Tamassia, et al.. (1992). Maintenance of a minimum spanning forest in a dynamic plane graph. Journal of Algorithms. 13(1). 33–54. 72 indexed citations

18.

Eppstein, David, Giuseppe F. Italiano, Roberto Tamassia, et al.. (1990). Maintenance of a minimum spanning forest in a dynamic planar graph. Symposium on Discrete Algorithms. 13(1). 1–11. 42 indexed citations

19.

Westbrook, Jeffery & Robert E. Tarjan. (1989). Amortized Analysis of Algorithms for Set Union with Backtracking. SIAM Journal on Computing. 18(1). 1–11. 21 indexed citations

20.

Westbrook, Jeffery. (1989). Algorithms and data structures for dynamic graph problems. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact