Greedy Is an Almost Optimal Deque

DOI10.1007/978-3-319-21840-3_13zbMath1444.68056arXiv1506.08319OpenAlexW1747890423MaRDI QIDQ3449813

Parinya Chalermsook, László Kozma, Thatchaphol Saranurak, Mayank Goswami, Kurt Mehlhorn

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
• Sequential access in splay trees takes linear time
• On the deque conjecture for the splay algorithm
• On the sequential access theorem and deque conjecture for splay trees
• A study of least squares and maximum likelihood for image reconstruction in positron emission tomography
• In Pursuit of the Dynamic Optimality Conjecture
• Lower Bounds for Accessing Binary Search Trees with Rotations
• On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Upper Bounds for Maximally Greedy Binary Search Trees

This page was built for publication: Greedy Is an Almost Optimal Deque