scientific article; zbMATH DE number 5764839

MaRDI QIDQ3579431zbMATH OpenFDO

Authors Seth Pettie

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(12)

• A study on splay trees
• Better analysis of binary search tree on decomposable sequences
• Greedy is an almost optimal deque
• Three generalizations of Davenport-Schinzel sequences
• Self-adjusting binary search trees: what makes them tick?
• Smooth heaps and a dual view of self-adjusting data structures
• Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
• scientific article; zbMATH DE number 7651167 (Why is no real title available?)
• On the zone of a circle in an arrangement of lines
• On the zone of a circle in an arrangement of lines
• scientific article; zbMATH DE number 7758335 (Why is no real title available?)
• Hardness amplification for dynamic binary search trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579431)