Catenable double-ended queues

DOI10.1145/258948.258956MaRDI QIDQ5348866zbMATH OpenOpenAlexFDO

Authors Chris Okasaki

Publication date 21 August 2017

Published in Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/258948.258956

Mathematics Subject Classification ID

Theory of programming languages (68N15) Searching and sorting (68P10)

Recommendations

• Double-ended queues with impatience
• scientific article; zbMATH DE number 1003250
• Double-ended queues with non-Poisson inputs and their effective algorithms
• The cyclic queue and the tandem queue
• Mergeable double-ended priority queues
• Matched queueing systems with a double input
• Cascades of queues
• scientific article; zbMATH DE number 4147276
• On the output of tandem queues

Cited in

(6)

• Purely functional, real-time deques with catenation
• scientific article; zbMATH DE number 1263185 (Why is no real title available?)
• scientific article; zbMATH DE number 1003250 (Why is no real title available?)
• Simple Confluently Persistent Catenable Lists
• scientific article; zbMATH DE number 1857505 (Why is no real title available?)
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues

This page was built for publication: Catenable double-ended queues

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