Daniel D. Sleator
- Computer Networks and Communications top 0.2%
- Optimization and Search Problems 16
- Distributed systems and fault tolerance 5
- Caching and Content Delivery 3
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs 7
- semigroups and automata theory 6
- Advanced Graph Theory Research 4
- Hardware and Architecture top 1%
-
- Algorithms and Data Compression 24
-
- Data Management and Algorithms 5
- Co-authors
- Robert E. TarjanLyle A. McGeochMark S. ManasseDavid TemperleyJames R. DriscollNeil SarnakLarry RudolphAnna R. Karlin
- Cited by
- Computer Networks and CommunicationsComputer Graphics and Computer-Aided DesignComputational Theory and Mathematics
- Partner nations
- United StatesIsraelCanada
In The Last Decade
Daniel D. Sleator
39 papers receiving 5.7k citations
Hit Papers
Peers
Comparison fields: 5 of 108
- Computer Networks and Communications 4.0k
- Computer Graphics and Computer-Aided Design 546
- Computational Theory and Mathematics 1.7k
- Hardware and Architecture 676
- Industrial and Manufacturing Engineering 691
Countries citing papers authored by Daniel D. Sleator
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
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
The 25 scholars most cited alongside Daniel D. Sleator, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2018 | 0 | |
| 2 | 2018 | 6 | |
| 3 | 2006 | 13 | |
| 4 | Multi-splay trees | 2006 | 1 |
| 5 | Competitive Analysis of Call Admission Algorithms that Allow Delay | 1995 | 8 |
| 6 | Parsing English with a Link Grammar | 1995 | 427 |
| 7 | 1992 | 5 | |
| 8 | 1992 | 15 | |
| 9 | 1991 | 6 | |
| 10 | 1991 | 271 | |
| 11 | 1990 | 223 | |
| 12 | 1989 | 254 | |
| 13 | 1989 | 16 | |
| 14 | 1988 | 40 | |
| 15 | 1988 | 156 | |
| 16 | 1986 | 383 | |
| 17 | 1984 | 13 | |
| 18 | A data structure for dynamic treesbreakdown → | 1983 | 550 |
| 19 | 1983 | 60 | |
| 20 | An 0 (nm log n) algorithm for maximum network flow | 1980 | 29 |
About Daniel D. Sleator
Daniel D. Sleator is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence, having authored 41 papers that have together received 6.4k indexed citations. Recurring topics across this work include Algorithms and Data Compression (24 papers), Optimization and Search Problems (16 papers), Complexity and Algorithms in Graphs (7 papers), semigroups and automata theory (6 papers), Distributed systems and fault tolerance (5 papers), Data Management and Algorithms (5 papers), Advanced Graph Theory Research (4 papers) and Caching and Content Delivery (3 papers). The work is most often cited by research in Computer Networks and Communications (4.0k citations), Computer Graphics and Computer-Aided Design (546 citations) and Computational Theory and Mathematics (1.7k citations). Daniel D. Sleator has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Robert E. Tarjan, Lyle A. McGeoch, Mark S. Manasse, David Temperley, James R. Driscoll, Neil Sarnak, Larry Rudolph, Anna R. Karlin, Paul F. Dietz and Jon Bentley. Their work appears in journals such as Algorithmica, Journal of Algorithms, Journal of the ACM, SIAM Journal on Computing and Journal of Computer and System Sciences.
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.