| Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985 | 3127 | 1985 |
| Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985 | 1868 | 1985 |
| A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981 | 1613 | 1981 |
| Parsing English with a link grammar DDK Sleator, D Temperley arXiv preprint cmp-lg/9508004, 1995 | 1340 | 1995 |
| Making data structures persistent JR Driscoll, N Sarnak, DD Sleator, RE Tarjan Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 1174 | 1986 |
| Competitive algorithms for on-line problems M Manasse, L McGeoch, D Sleator Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 1062 | 1988 |
| Competitive snoopy caching AR Karlin, MS Manasse, L Rudolph, DD Sleator Algorithmica 3, 79-119, 1988 | 1003 | 1988 |
| A locally adaptive data compression scheme JL Bentley, DD Sleator, RE Tarjan, VK Wei Communications of the ACM 29 (4), 320-330, 1986 | 793 | 1986 |
| Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991 | 611 | 1991 |
| Rotation distance, triangulations, and hyperbolic geometry DD Sleator, RE Tarjan, WP Thurston Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 555 | 1986 |
| Two algorithms for maintaining order in a list P Dietz, D Sleator Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 497 | 1987 |
| The pairing heap: A new form of self-adjusting heap ML Fredman, R Sedgewick, DD Sleator, RE Tarjan Algorithmica 1 (1), 111-129, 1986 | 392 | 1986 |
| A strongly competitive randomized paging algorithm LA McGeoch, DD Sleator Algorithmica 6 (1), 816-825, 1991 | 343 | 1991 |
| A robust parsing algorithm for link grammars D Grinberg, J Lafferty, D Sleator Proceedings of the fourth international workshop on Parsing Technologies …, 1995 | 259 | 1995 |
| Grammatical trigrams: A probabilistic model of link grammar J Lafferty, D Sleator, D Temperley School of Computer Science, Carnegie Mellon University, 1992 | 213 | 1992 |
| Self-adjusting heaps DD Sleator, RE Tarjan SIAM Journal on Computing 15 (1), 52-69, 1986 | 211 | 1986 |
| Biased search trees SW Bent, DD Sleator, RE Tarjan SIAM Journal on Computing 14 (3), 545-568, 1985 | 192 | 1985 |
| Modeling meter and harmony: A preference-rule approach D Temperley, D Sleator Computer Music Journal 23 (1), 10-27, 1999 | 188 | 1999 |
| A 2.5 times optimal algorithm for packing in two dimensions DD Sleator Inf. Process. Lett. 10 (1), 37-40, 1980 | 181 | 1980 |
| Competitive algorithms for replication and migration problems DL Black, DD Sleator Carnegie-Mellon University. Department of Computer Science, 1989 | 179 | 1989 |
Robert TarjanProfessor of Computer Science, Princeton UniversityEmail verificata su cs.princeton.edu
