Travelled to:6 × USA
Collaborated with:R.E.Tarjan P.F.Dietz M.S.Manasse L.A.McGeoch W.P.Thurston J.R.Driscoll N.Sarnak
Talks about:algorithm (2) structur (2) tree (2) list (2) data (2) triangul (1) maintain (1) hyperbol (1) geometri (1) competit (1)
Person: Daniel Dominic Sleator
DBLP: Sleator:Daniel_Dominic
Contributed to:
198819871986198419831981Wrote 7 papers:
- STOC-1988-ManasseMS #algorithm #online #problem
- Competitive Algorithms for On-line Problems (MSM, LAM, DDS), pp. 322–333.
- STOC-1987-DietzS #algorithm #maintenance #order
- Two Algorithms for Maintaining Order in a List (PFD, DDS), pp. 365–372.
- STOC-1986-DriscollSST #data type #persistent
- Making Data Structures Persistent (JRD, NS, DDS, RET), pp. 109–121.
- STOC-1986-SleatorTT #distance #geometry
- Rotation Distance, Triangulations, and Hyperbolic Geometry (DDS, RET, WPT), pp. 122–135.
- STOC-1984-SleatorT #performance
- Amortized Efficiency of List Update Rules (DDS, RET), pp. 488–492.
- STOC-1983-SleatorT #self
- Self-Adjusting Binary Trees (DDS, RET), pp. 235–245.
- STOC-1981-SleatorT #data type
- A Data Structure for Dynamic Trees (DDS, RET), pp. 114–122.