scientific article

zbMath0966.68509arXiv1110.4428MaRDI QIDQ2721966

John Iacono

Publication date: 11 July 2001

Full work available at URL: https://arxiv.org/abs/1110.4428

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (13)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Practical distribution-sensitive point location in triangulations ⋮ On the hierarchy of distribution-sensitive properties for data structures ⋮ Proximate point searching ⋮ A priority queue with the time-finger property ⋮ Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees ⋮ Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Pairing heaps: the forward variant. ⋮ Amortized complexity verified ⋮ A History of Distribution-Sensitive Data Structures ⋮ A Survey on Priority Queues ⋮ Parameterized analysis of paging and list update algorithms

This page was built for publication: