Robert Wilber

758 total citations
11 papers, 439 citations indexed

About

Robert Wilber is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Robert Wilber has authored 11 papers receiving a total of 439 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Artificial Intelligence, 6 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Robert Wilber's work include Algorithms and Data Compression (5 papers), Computability, Logic, AI Algorithms (4 papers) and Data Management and Algorithms (4 papers). Robert Wilber is often cited by papers focused on Algorithms and Data Compression (5 papers), Computability, Logic, AI Algorithms (4 papers) and Data Management and Algorithms (4 papers). Robert Wilber collaborates with scholars based in United States and Canada. Robert Wilber's co-authors include Maria Klawe, Peter W. Shor, Alok Aggarwal, Shlomo Moran, Lisa Hellerstein and Philip N. Klein and has published in prestigious journals such as Annals of the New York Academy of Sciences, SIAM Journal on Computing and Journal of Computer and System Sciences.

In The Last Decade

Robert Wilber

10 papers receiving 392 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Robert Wilber United States 6 168 166 124 94 82 11 439
F. Frances Yao United States 10 155 0.9× 144 0.9× 114 0.9× 173 1.8× 96 1.2× 16 460
Udi Manber Israel 4 129 0.8× 101 0.6× 190 1.5× 39 0.4× 51 0.6× 5 454
Jeffery Westbrook United States 17 223 1.3× 356 2.1× 479 3.9× 98 1.0× 71 0.9× 34 766
Tadao Takaoka New Zealand 10 162 1.0× 200 1.2× 118 1.0× 68 0.7× 60 0.7× 50 402
Funda Ergün United States 14 281 1.7× 251 1.5× 251 2.0× 39 0.4× 45 0.5× 31 565
Prabhakar Ragde Canada 17 264 1.6× 411 2.5× 259 2.1× 59 0.6× 49 0.6× 37 623
F. Dehne Canada 12 97 0.6× 75 0.5× 182 1.5× 54 0.6× 104 1.3× 36 422
Adam L. Buchsbaum United States 14 333 2.0× 202 1.2× 296 2.4× 37 0.4× 66 0.8× 41 623
Meena Mahajan India 11 196 1.2× 344 2.1× 149 1.2× 24 0.3× 47 0.6× 67 546
Graham Birtwistle Canada 12 127 0.8× 189 1.1× 190 1.5× 55 0.6× 53 0.6× 47 575

Countries citing papers authored by Robert Wilber

Since Specialization
Citations

This map shows the geographic impact of Robert Wilber'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 Robert Wilber with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Wilber more than expected).

Fields of papers citing papers by Robert Wilber

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert Wilber. 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 Robert Wilber. The network helps show where Robert Wilber may publish in the future.

Co-authorship network of co-authors of Robert Wilber

This figure shows the co-authorship network connecting the top 25 collaborators of Robert Wilber. A scholar is included among the top collaborators of Robert Wilber 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 Robert Wilber. Robert Wilber is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

11 of 11 papers shown
1.
Hellerstein, Lisa, Philip N. Klein, & Robert Wilber. (1990). On the time-space complexity of reachability queries for preprocessed graphs. Information Processing Letters. 35(5). 261–267. 3 indexed citations
2.
Wilber, Robert. (1989). Lower Bounds for Accessing Binary Search Trees with Rotations. SIAM Journal on Computing. 18(1). 56–67. 39 indexed citations
3.
Wilber, Robert. (1988). White pebbles help. Journal of Computer and System Sciences. 36(2). 108–124. 5 indexed citations
4.
Wilber, Robert. (1988). The concave least-weight subsequence problem revisited. Journal of Algorithms. 9(3). 418–425. 63 indexed citations
5.
Aggarwal, Alok, Maria Klawe, Shlomo Moran, Peter W. Shor, & Robert Wilber. (1987). Geometric applications of a matrix-searching algorithm. Algorithmica. 2(1-4). 195–208. 262 indexed citations
6.
Wilber, Robert. (1986). Lower bounds for accessing binary search trees with rotations. 3. 61–70. 3 indexed citations
7.
Aggarwal, Alok, Maria Klawe, Shlomo Moran, Peter W. Shor, & Robert Wilber. (1986). Geometric applications of a matrix searching algorithm. 285–292. 22 indexed citations
8.
Wilber, Robert. (1985). A comparison of the black and black-white pebble games (nondeterminism, straight-line program, complexity theory). Annals of the New York Academy of Sciences. 990. 591–5. 1 indexed citations
9.
Wilber, Robert. (1985). White pebbles help. 103–112. 11 indexed citations
10.
Wilber, Robert. (1983). Randomness and the density of hard problems. 335–342. 28 indexed citations
11.
Wilber, Robert, et al.. (1964). The Oregon Desert. Journal of Range Management. 17(5). 277–277. 2 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

Rankless by CCL
2026