Stacks, queues, and deques with order-statistic operations

DOI10.1007/BF01193574zbMath0769.68017MaRDI QIDQ1203596

D. S. Richards, Jeffrey S. Salowe

Publication date: 16 February 1993

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

stacksqueuesorder statistic deque

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refined complexity analysis for heap operations
• On computing all north-east nearest neighbors in the \(L_ 1\) metric
• Finding minimum area \(k\)-gons
• The shortest path and the shortest road through n points
• Fast Algorithms for Finding Nearest Common Ancestors
• Generalized Selection and Ranking: Sorted Matrices
• Efficient uses of the past
• Min-max heaps and generalized priority queues
• A unifying look at data structures
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees

This page was built for publication: Stacks, queues, and deques with order-statistic operations