Adaptive Structuring of Binary Search Trees Using Conditional Rotations.

@article{DBLP:journals/tkde/CheethamON93,
  author    = {Robert P. Cheetham and
               B. John Oommen and
               David T. H. Ng},
  title     = {Adaptive Structuring of Binary Search Trees Using Conditional
               Rotations},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {5},
  number    = {4},
  year      = {1993},
  pages     = {695-704},
  ee        = {db/journals/tkde/CheethamON93.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

...

[2]

Brian Allen, J. Ian Munro: Self-Organizing Binary Search Trees. J. ACM 25(4): 526-535(1978) BibTeX

[3]

...

[4]

...

[5]

James R. Bitner: Heuristics That Dynamically Organize Data Structures. SIAM J. Comput. 8(1): 82-110(1979) BibTeX

[6]

...

[7]

Gaston H. Gonnet: Balancing Binary Trees by Internal Path Reduction. Commun. ACM 26(12): 1074-1081(1983) BibTeX

[8]

Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda: Exegesis of Self-Organizing Linear Search. SIAM J. Comput. 10(3): 613-637(1981) BibTeX

[9]

James H. Hester, Daniel S. Hirschberg: Self-Organizing Linear Search. ACM Comput. Surv. 17(3): 295-311(1985) BibTeX

[10]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[11]

...

[12]

...

[13]

Kurt Mehlhorn: Nearly Optimal Binary Search Trees. Acta Inf. 5: 287-295(1975) BibTeX

[14]

Kurt Mehlhorn: Dynamic Binary Search. SIAM J. Comput. 8(2): 175-198(1979) BibTeX

[15]

Kurt Mehlhorn: Data Structures and Algorithms 1: Sorting and Searching. Monographs in Theoretical Computer Science. An EATCS Series Vol. 1 Springer 1984, ISBN 3-540-13302-X
BibTeX

[16]

B. John Oommen, E. R. Hansen: List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations. SIAM J. Comput. 16(4): 705-716(1987) BibTeX

[17]

B. John Oommen, E. R. Hansen, J. Ian Munro: Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. Theor. Comput. Sci. 74(2): 183-197(1990) BibTeX

[18]

Ronald L. Rivest: On Self-Organizing Sequential Search Heuristics. Commun. ACM 19(2): 63-67(1976) BibTeX

[19]

Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Binary Search Trees. J. ACM 32(3): 652-686(1985) BibTeX

[20]

...

Referenced by

1. Robert P. Cheetham, B. John Oommen, David T. H. Ng: On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees. ICDT 1988: 161-175