An optimal RAM implementation of catenable min double-ended queues

Authors:
S. Rao Kosaraju
Affiliations:
Department of Computer Science, The Johns Hopkins University, Baltimore, Maryland
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Data structures and network algorithms

Data structures and network algorithms
Deques with heap order

Information Processing Letters
Worst-case data structures for the priority queue with attrition

Information Processing Letters
Fully persistent lists with catenation

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Confluently persistent deques via data structuaral bootstrapping

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Localized search in sorted lists

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Biased finger trees and three-dimensional layers of maxima: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Persistent lists with catenation via recursive slow-down

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Purely functional, real-time deques with catenation

Journal of the ACM (JACM)
Space-efficient finger search on degree-balanced search trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
De-amortization of Algorithms

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics

Hi-index	0.02