D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--686, 1985. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Dynamizing Static Algorithms, with Applications to.. - Acar, Blelloch.. (2003) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--686, 1985.
Space-Ecient Finger Search on Degree-Balanced Search Trees - Guy Blelloch Bruce (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652--686, 1985.
Self-Adjusting Distributed Trees - Michael Reiter Asad (2005) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652--686, 1985.
Large Alphabets and Incompressibility - Gagie (2006) (Correct)
No context found.
D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652--686, 1985.
Applied Type System with Stateful Views - Hongwei Xi Dengping (Correct)
No context found.
Sleator, D. D. and R. E. Tarjan (1985). Self-adjusting Binary Search Trees. Journal of the ACM 32(3), 652--686.
A Dynamic Lookup Scheme for Bursty Access Patterns - Funda Ergun Suvo (2001) (5 citations) (Correct)
No context found.
D. Sleator and R. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32, 1985.
Dynamic Asymmetric Communication - Travis Gagie Department (Correct)
No context found.
D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652--686, 1985.
Sorting a Low-Entropy Sequence - Gagie (2005) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652--686, 1985.
Dynamic Shannon Coding - Travis Gagie Department (2004) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652--686, 1985.
Dynamic Shannon Coding - Travis Gagie Student (2004) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan, "Self-adjusting binary search trees," Journal of the ACM, vol. 32, pp. 652--686, 1985.
Competitive Access Time via Dynamic Storage Rearrangement - Fiat, Mansour, Rosen, Waarts (1995) (7 citations) (Correct)
No context found.
D.D. Sleator and R.E. Tarjan. "Self-Adjusting Binary Search Trees". Journal of the ACM, 32:652--686, 1985.
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--86, 1985.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--86, 1985.
A 1.5-Approximation Algorithm for Sorting by Transpositions.. - Hartman, Sharan (2003) (2 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. Assoc. Comput. Mach., 32:652--686, 1985.
Optimum Binary Search Trees On The Hierarchical Memory Model - Shripad Thite University (2001) (2 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the Association for Computing Machinery, 32(3):652-686, July 1985.
Data Structures and Amortized Complexity in a Functional Setting - Schoenmakers (1992) (5 citations) (Correct)
No context found.
Sleator D.D., Tarjan R.E. Self-adjusting binary search trees. Journal of the ACM 32 (1985) 652--686.
Denial of Service via Algorithmic Complexity Attacks - Scott Crosby Dan (2003) (16 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652--686, 1985.
Reuse Distance Analysis for Scienti - Programs Yutao Zhong (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self adjusting binary search trees. Journal of the ACM, 32(3), 1985.
Dynamizing Static Algorithms, with Applications to.. - Acar, Blelloch.. (2004) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--686, 1985.
A Practical Dynamic Buffer Overflow Detector - Olatunji Ruwase Transmeta (2004) (10 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--686, 1985.
Discrete-Event Simulation on the Bulk-Synchronous Parallel Model - Marin (1998) (Correct)
No context found.
R.E. Tarjan and D.D. Sleator. "Self-adjusting binary search trees". Journal of ACM, 32(3):652--686, July 1985.
Predicting Whole-Program Locality Through Reuse Distance Analysis - Ding, Zhong (2003) (6 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self adjusting binary search trees. Journal of the ACM, 32(3), 1985.
A Simpler and Faster 1.5-Approximation Algorithm for Sorting.. - Hartman, Shamir (2004) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. Assoc. Comput. Mach., 32:652--686, 1985.
Putting Your Dictionary on a Diet - Morin (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(2):652-- 686, 1985. 6
Transparent Operating System Support for Superpages - Navarro (2002) (4 citations) (Correct)
No context found.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652--686, 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC