Some of Daniel Sleator's papers

• A 2.5 Times Optimal Algorithm for Packing in Two Dimensions
• A Locally Adaptive Data Compression Scheme
• Self-Adjusting Heaps
• A Data Structure for Dynamic Trees
• Amortized Efficiency of List Update and Paging Rules
• Pairing Heaps: A New Form of Self-Adjusting Heap
• Competitive Paging Algorithms
• Short Encodings of Evolving Structures
• Randomized Competitive Algorithms for the List Update Problem
• Two Algorithms for Maintaining Order in a List
• A Strongly Competitive Randomized Paging Algorithm
• Making Data Structures Persistent
• Competitive Algorithms for Replication and Migration Problems
• Data Structures and Cost-Bounded Petri Nets
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Self-Adjusting Binary Search Trees
• A Lower Bound Framework for Binary Search Trees with Rotations
• Competitive Algorithms for Server Problems
• Fully Persistent Lists with Catenation
• Modeling Meter and Harmony: A Preference-Rule Approach
• Who Wins Misère Hex
• Computer Analysis of Sprouts