On the Dynamic Finger Conjecture for Splay Trees, Vol. 1: Splay Sorting Log N-Block Sequences (Classic Reprint) - Hardcover

Name: On the Dynamic Finger Conjecture for Splay Trees, Vol. 1: Splay Sorting Log N-Block Sequences (Classic Reprint)
Author: Richard Cole
ISBN: 9780656027064

Richard Cole

9780656027064: On the Dynamic Finger Conjecture for Splay Trees, Vol. 1: Splay Sorting Log N-Block Sequences (Classic Reprint)

Hardcover

ISBN 10: 0656027061 ISBN 13: 9780656027064

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

0 Used

2 New

From US$ 38.17

Discover how splay trees perform in theory, not just in practice, with clear paths to understanding their efficiency.

The book analyzes core conjectures and introduces new ideas that shape how we think about dynamic data structures.

From the basics of splay operations to the amortized analysis that underpins their performance, this work frames why splay trees matter in sorting and search tasks. It examines dynamic optimality, the dynamic finger conjecture, and related ideas, while outlining a concrete approach to the Splay Sorting problem for log n block sequences.

Readers will encounter innovative concepts such as lazy potential and the global-local insertion framework, along with a careful treatment of how multiple lazy trees interact. The discussion stays grounded in sequences and structures that sharpen intuition about why certain access patterns behave as they do.

Clear description of splay operations and their cost models
Explanations of the Dynamic Optimality and Dynamic Finger conjectures
Introduction of lazy potential and multi-layer lazy trees for amortized analysis
Specific focus on sorting log n block sequences using splay trees

Ideal for readers of theoretical computer science and data-structure enthusiasts seeking a rigorous, accessible treatment of splay trees and their sorting behavior.

"synopsis" may belong to another edition of this title.