The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Dominic Sleator: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
    Making Data Structures Persistent. [Citation Graph (13, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:86-124 [Journal]
  2. Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator
    Competitive Snoopy Caching. [Citation Graph (6, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:77-119 [Journal]
  3. Daniel Dominic Sleator, Robert Endre Tarjan
    Amortized Efficiency of List Update and Paging Rules. [Citation Graph (6, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:2, pp:202-208 [Journal]
  4. Daniel Dominic Sleator, Robert Endre Tarjan
    Self-Adjusting Binary Search Trees [Citation Graph (4, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:652-686 [Journal]
  5. James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
    Making Data Structures Persistent [Citation Graph (3, 0)][DBLP]
    STOC, 1986, pp:109-121 [Conf]
  6. Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
    Competitive Algorithms for On-line Problems [Citation Graph (3, 0)][DBLP]
    STOC, 1988, pp:322-333 [Conf]
  7. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms. [Citation Graph (3, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:685-699 [Journal]
  8. Paul F. Dietz, Daniel Dominic Sleator
    Two Algorithms for Maintaining Order in a List [Citation Graph (2, 0)][DBLP]
    STOC, 1987, pp:365-372 [Conf]
  9. Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan
    The Pairing Heap: A New Form of Self-Adjusting Heap. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:111-129 [Journal]
  10. Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei
    A Locally Adaptive Data Compression Scheme. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:4, pp:320-330 [Journal]
  11. Daniel Dominic Sleator, Robert Endre Tarjan
    Self-Adjusting Binary Trees [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:235-245 [Conf]
  12. Daniel Dominic Sleator, Robert Endre Tarjan
    Amortized Efficiency of List Update Rules [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:488-492 [Conf]
  13. Daniel Dominic Sleator, Robert Endre Tarjan
    A Data Structure for Dynamic Trees. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:3, pp:362-391 [Journal]
  14. Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan
    Biased 2-3 Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:248-254 [Conf]
  15. Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator
    Competitive Snoopy Caching [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:244-254 [Conf]
  16. Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator
    Analysis of Online Algorithms for Organ Allocation. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:458-464 [Conf]
  17. Daniel Dominic Sleator
    Data Structures and Terminating Petri Nets. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:488-497 [Conf]
  18. James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
    Fully Persistent Lists with Catenation. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:89-99 [Conf]
  19. Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator
    Randomized Competitive Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:251-260 [Conf]
  20. Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator
    O(log log n)-competitive dynamic binary search trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:374-383 [Conf]
  21. Daniel Dominic Sleator, Robert Endre Tarjan
    A Data Structure for Dynamic Trees [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:114-122 [Conf]
  22. Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
    Rotation Distance, Triangulations, and Hyperbolic Geometry [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:122-135 [Conf]
  23. Lyle A. McGeoch, Daniel Dominic Sleator
    A Strongly Competitive Randomized Paging Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:6, pp:816-825 [Journal]
  24. Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator
    Randomized Competitive Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:1, pp:15-32 [Journal]
  25. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  26. David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan
    A Tight Amortized Bound for Path Reversal. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:1, pp:3-5 [Journal]
  27. Daniel Dominic Sleator
    A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:1, pp:37-40 [Journal]
  28. James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
    Fully Persistent Lists with Catenation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:943-959 [Journal]
  29. Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
    Competitive Algorithms for Server Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:2, pp:208-230 [Journal]
  30. Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan
    Biased Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:545-568 [Journal]
  31. Daniel Dominic Sleator, Robert Endre Tarjan
    Self-Adjusting Heaps. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:52-69 [Journal]
  32. Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
    Short Encodings of Evolving Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:3, pp:428-450 [Journal]

  33. Skip-Splay: Toward Achieving the Unified Bound in the BST Model. [Citation Graph (, )][DBLP]


  34. A Robust Parsing Algorithm For Link Grammars [Citation Graph (, )][DBLP]


  35. Parsing English with a Link Grammar [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002