Lower Bounds for Accessing Binary Search Trees with Rotations

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

Title: SIAM Journal on Computing

Abbreviated Title: SIAM J. Comput.

Publisher: Society for Industrial & Applied Mathematics (SIAM)

ISSN (Print): 0097-5397

ISSN (Electronic): 1095-7111

Publication date Created: February 1989

Publication date (Print): February 1989

Volume: 18

Issue: 1

Pages: 56-67

Article

DOI: 10.1137/0218004

SO-VID: f1a33473-73e5-4708-9da2-e973ea927b48

History

Data availability:

Comments

Comment on this article

scite_

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.