Daniel Sleator's AcademicInfluence.com Rankings Daniel Sleator's Degrees Similar Degrees You Can Earn Why Is Daniel Sleator Influential? (Suggest an Edit or Addition)
According to Wikipedia , Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award for the splay tree data structure.
(See a Problem?) Daniel Sleator's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
1970 1980 1990 2000 2010 0 250 500 750 1000 1250 1500 1750 2000 2250 2500 2750 3000 3250 3500 3750 4000 Published Works Amortized efficiency of list update and paging rules (1985) Self-adjusting binary search trees (1985) A data structure for dynamic trees (1981) Parsing English with a Link Grammar (1995) (1045)Making data structures persistent (1986) Competitive snoopy caching (1986) A locally adaptive data compression scheme (1986) Competitive Paging Algorithms (1991) Competitive Algorithms for Server Problems (1990) Rotation distance, triangulations, and hyperbolic geometry (1986) Competitive algorithms for on-line problems (1988) Two algorithms for maintaining order in a list (1987) A Robust Parsing Algorithm for Link Grammars (1995) (200)Grammatical Trigrams: A Probabilistic Model of Link Grammar (1992) The pairing heap: A new form of self-adjusting heap (2005) A strongly competitive randomized paging algorithm (1991) Self-Adjusting Heaps (1986) Biased Search Trees (1985) Self-adjusting binary trees (1983) Competitive algorithms for replication and migration problems (1989) (129)Modeling Meter and Harmony: A Preference-Rule Approach (1999) A 2.5 Times Optimal Algorithm for Packing in Two Dimensions (1980) Randomized competitive algorithms for the list update problem (1991) O(log log n)-competitive dynamic binary search trees (2006) An 0 (nm log n) algorithm for maximum network flow (1980) (64)Short Encodings of Evolving Structures (1992) A Tight Amortized Bound for Path Reversal (1989) Fully persistent lists with catenation (1991) On ~ competitive algorithms for paging problems (1991) (34)Amortized efficiency of list update rules (1984) Competitive Analysis of Call Admission Algorithms that Allow Delay. (1995) (28)A Lower Bound Framework for Binary Search Trees with Rotations (2005) (25)Biased 2-3 trees (1980) Skip-Splay: Toward Achieving the Unified Bound in the BST Model (2009) Computer analysis of Sprouts (1999) (20)Impartial Redistricting: A Markov Chain Approach (2015) (13)Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads (1992) (10)Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors (2008) (10)On-Line Algorithms (1992) Multi-splay trees (2006) (8)Link Grammar Parser (2000) (7)Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity (2017) Offline Dynamic Higher Connectivity (2017) (5)Dynamic optimality and multi-splay trees (2004) (5)Data Structures and Terminating Petri Nets (1992) Extraction of Protein Interaction Information from Unstructured Text Using a Link Grammar Parser (2007) (3)Analysis of Online Algorithms for Organ Allocation (1992) Properties of Multi-Splay Trees (2009) (2)Techniques and Amortized Efficiency Of List Ellis Horowitz Update and Paging Rules (1985) (1)Comparative Analysis of Dynamic Graph Techniques and Data Structure (2019) (1)A (4k+1)-Competitive Algorithm for the K-Server With Fixed Cost Excursion Problem (1996) (1)Subtraction games with FES sets of size 3 (2012) (1)On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 (1992) (1)Information Retrieval and Information Theory (1999) (0)ANDREW W. APPEL AND GUY J. JACOBSON (1988) (0)Dynamic Optimality and Multi-Splay Trees 1 (2006) (0)A Tribute to a Mathemagician (2004) (0)BFS Parallel and Sequential Data Structures and Algorithms , 15-210 ( Fall 2013 ) (2013) (0)Lecture 22-23 — Dynamic Programming Parallel and Sequential Data Structures and Algorithms , 15-210 ( Fall 2013 ) (2013) (0)PCFORT: a Fortran-to-Pcode translator (1979) (0)Simulating musical instruments using their impulse responses (1985) Myths and Counterexamples in Special Forms of Mathematical Programming (2010) (0)Computer Science and Engineering Research Review 1989-1990 (1990) (0)Stability , Adaptivity , and Dynamic Algorithms Thesis Proposal (0)RESEARCH CONTRlBllTlONS Algorithms and Data Structures Data Compression with Finite (1999) (0)Table 1: Costs with Diierent Clustering Techniques 5 Minimum Height Mappings for Dag Structures 4.4 Weight Minimization 4.3 Average Path Length Minimization 4.1 Static Height Minimization 4 Tree Structures Clustering Techniques for Minimizing External Path Length (1996) (0)Competitive Dynamic Bsts .. Two Cost Models (0)Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA (1994) (0)Training of the Carnegie Mellon Teams for the ACM Programming Competition (2009) (0)Data Structures A Locally Adaptive Data (1986) (0)NSF Science and Technology Center for Scalable Algorithms (0)SPLAY TREES : Self-Adjusting Binary Search Trees In 1983 (0)Amortized Analysis of a Pebble Game (1990) (0)Algorithms : From Theory to Application (0)Keyword-driven Suffix Arrays for On-line Keyword Searching from Documents in Chinese (2012) (0)Update and Paging Rules (1985) (0)Programming Data Structures Techniques and Amortized Efficiency Of List (2002) (0)3.1 Two Cost Models 3.2 Wilber's Interleave Bound (0)More Papers This paper list is powered by the following services:
Other Resources About Daniel Sleator What Schools Are Affiliated With Daniel Sleator? Daniel Sleator is affiliated with the following schools:
