Daniel D. Sleator

11.6k total citations · 3 hit papers
41 papers, 6.4k citations indexed

About

Daniel D. Sleator is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Daniel D. Sleator has authored 41 papers receiving a total of 6.4k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computer Networks and Communications, 24 papers in Artificial Intelligence and 16 papers in Computational Theory and Mathematics. Recurrent topics in Daniel D. Sleator's work include Algorithms and Data Compression (24 papers), Optimization and Search Problems (16 papers) and Complexity and Algorithms in Graphs (7 papers). Daniel D. Sleator is often cited by papers focused on Algorithms and Data Compression (24 papers), Optimization and Search Problems (16 papers) and Complexity and Algorithms in Graphs (7 papers). Daniel D. Sleator collaborates with scholars based in United States, Israel and Canada. Daniel D. Sleator's co-authors include Robert E. Tarjan, Lyle A. McGeoch, Mark S. Manasse, David Temperley, James R. Driscoll, Neil Sarnak, Anna R. Karlin, Larry Rudolph, Paul F. Dietz and Jon Bentley and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Daniel D. Sleator

39 papers receiving 5.7k citations

Hit Papers

Amortized efficiency of list update and paging rules 1983 2026 1997 2011 1985 1985 1983 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Amortized efficiency of list update and paging rules
    1985 1.2k citations Daniel D. Sleator, Robert E. Tarjan profile →
  2. Self-adjusting binary search trees
    1985 686 citations Daniel D. Sleator, Robert E. Tarjan profile →
  3. A data structure for dynamic trees
    1983 550 citations Daniel D. Sleator, Robert E. Tarjan Journal of Computer and System Sciences profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel D. Sleator United States 27 4.0k 2.2k 1.7k 851 691 41 6.4k
Nimrod Megiddo United States 43 2.6k 0.7× 1.7k 0.8× 2.7k 1.6× 1.0k 1.2× 1000 1.4× 150 8.5k
Shimon Even Israel 33 2.3k 0.6× 1.7k 0.8× 2.4k 1.5× 446 0.5× 601 0.9× 94 5.5k
Clifford Stein United States 30 2.8k 0.7× 1.2k 0.5× 1.2k 0.7× 343 0.4× 875 1.3× 105 5.4k
Zvi Galil United States 40 1.6k 0.4× 2.7k 1.2× 2.8k 1.7× 497 0.6× 339 0.5× 191 5.6k
Allan Borodin Canada 33 2.9k 0.7× 1.4k 0.6× 2.0k 1.2× 833 1.0× 484 0.7× 105 5.2k
Kenneth Steiglitz United States 19 1.6k 0.4× 1.2k 0.5× 1.1k 0.7× 335 0.4× 957 1.4× 45 5.2k
Baruch Awerbuch United States 49 5.9k 1.5× 1.2k 0.6× 2.1k 1.2× 813 1.0× 337 0.5× 192 7.4k
Sanjeev Khanna United States 37 2.9k 0.7× 1.2k 0.6× 1.7k 1.0× 453 0.5× 592 0.9× 180 4.8k
Kurt Mehlhorn Germany 41 1.5k 0.4× 1.7k 0.8× 1.9k 1.1× 278 0.3× 339 0.5× 273 5.6k
Charles J. Colbourn United States 41 2.5k 0.6× 2.8k 1.3× 2.3k 1.4× 549 0.6× 218 0.3× 376 9.7k

Countries citing papers authored by Daniel D. Sleator

Since Specialization
Citations

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

Fields of papers citing papers by Daniel D. Sleator

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel D. Sleator

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

All Works

20 of 20 papers shown
1.
Sleator, Daniel D., et al.. (2018). Dynamic optimality and multi-splay trees. Figshare.
2.
Black, David L. & Daniel D. Sleator. (2018). Competitive algorithms for replication and migration problems. Figshare. 6 indexed citations
3.
Sleator, Daniel D., et al.. (2006). O(log log n)-competitive dynamic binary search trees. Symposium on Discrete Algorithms. 374–383. 13 indexed citations
4.
Sleator, Daniel D., et al.. (2006). Multi-splay trees. 1 indexed citations
5.
Feldmann, Anja, et al.. (1995). Competitive Analysis of Call Admission Algorithms that Allow Delay. 8 indexed citations
6.
Sleator, Daniel D. & David Temperley. (1995). Parsing English with a Link Grammar. arXiv (Cornell University). 277–292. 427 indexed citations
7.
Sleator, Daniel D., et al.. (1992). Short Encodings of Evolving Structures. SIAM Journal on Discrete Mathematics. 5(3). 428–450. 15 indexed citations
8.
McGeoch, Lyle A. & Daniel D. Sleator. (1992). On-line Algorithms. 5 indexed citations
9.
Driscoll, James R., Daniel D. Sleator, & Robert E. Tarjan. (1991). Fully persistent lists with catenation. Symposium on Discrete Algorithms. 89–99. 6 indexed citations
10.
Manasse, Mark S., Lyle A. McGeoch, & Daniel D. Sleator. (1990). Competitive algorithms for server problems. Journal of Algorithms. 11(2). 208–230. 223 indexed citations
11.
Ginat, David, Daniel D. Sleator, & Robert E. Tarjan. (1989). A tight amortized bound for path reversal. Information Processing Letters. 31(1). 3–5. 16 indexed citations
12.
Driscoll, James R., Neil Sarnak, Daniel D. Sleator, & Robert E. Tarjan. (1989). Making data structures persistent. Journal of Computer and System Sciences. 38(1). 86–124. 254 indexed citations
13.
Sleator, Daniel D., Robert E. Tarjan, & William P. Thurston. (1988). Rotation distance, triangulations, and hyperbolic geometry. Journal of the American Mathematical Society. 1(3). 647–681. 156 indexed citations
14.
Sleator, Daniel D., Robert E. Tarjan, & William P. Thurston. (1988). Rotation Distance, Triangulations, and Hyperbolic Geometry. Journal of the American Mathematical Society. 1(3). 647–647. 40 indexed citations
15.
Driscoll, James R., Neil Sarnak, Daniel D. Sleator, & Robert E. Tarjan. (1986). Making data structures persistent. 109–121. 383 indexed citations
16.
Sleator, Daniel D., et al.. (1985). Biased Search Trees. SIAM Journal on Computing. 14(3). 545–568. 78 indexed citations
17.
Sleator, Daniel D. & Robert E. Tarjan. (1984). Amortized efficiency of list update rules. 488–492. 13 indexed citations
18.
Sleator, Daniel D. & Robert E. Tarjan. (1983). A data structure for dynamic trees. Journal of Computer and System Sciences. 26(3). 362–391. 550 indexed citations breakdown →
19.
Sleator, Daniel D. & Robert E. Tarjan. (1983). Self-adjusting binary trees. 235–245. 60 indexed citations
20.
Sleator, Daniel D.. (1980). An 0 (nm log n) algorithm for maximum network flow. 29 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

Breakdown of academic impact, for papers by Nimrod Megiddo Breakdown of academic impact, for papers by Shimon Even Breakdown of academic impact, for papers by Clifford Stein Breakdown of academic impact, for papers by Zvi Galil Breakdown of academic impact, for papers by Allan Borodin Breakdown of academic impact, for papers by Kenneth Steiglitz Breakdown of academic impact, for papers by Baruch Awerbuch Breakdown of academic impact, for papers by Sanjeev Khanna Breakdown of academic impact, for papers by Kurt Mehlhorn Breakdown of academic impact, for papers by Charles J. Colbourn
Rankless by CCL
2026