Amortized Constant Relaxed Rebalancing using Standard Rotations.
Kim S. Larsen.
Acta Informatica, 35(10): 859-874, 1998.
The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases during bursts of updates. This paper contains the first proof that amortized constant time rebalancing can be obtained in a relaxed binary search tree using only standard single and double rotations.

Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any): The final publication is available at

open access (149 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.

other publications
Other publications by the author.