12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Lower Bounds for Accessing Binary Search Trees with Rotations

      SIAM Journal on Computing
      Society for Industrial & Applied Mathematics (SIAM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Journal
          SIAM Journal on Computing
          SIAM J. Comput.
          Society for Industrial & Applied Mathematics (SIAM)
          0097-5397
          1095-7111
          February 1989
          February 1989
          : 18
          : 1
          : 56-67
          Article
          10.1137/0218004
          f1a33473-73e5-4708-9da2-e973ea927b48
          © 1989
          History

          Comments

          Comment on this article