Experiences with the design and implementation of space-efficient deques

DOI10.1007/3-540-44688-5_4MaRDI QIDQ4788553zbMATH OpenFDO

Authors Jyrki Katajainen, Bjarke Buur Mortensen

Publication date 29 January 2003

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

Full work available at URL https://doi.org/10.1007/3-540-44688-5_4

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2185599
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
• Catenable double-ended queues
• scientific article; zbMATH DE number 437540
• Diamond deque: A simple data structure for priority deques

Cited in

(4)

• Regular numeral systems for data structures
• scientific article; zbMATH DE number 2185599 (Why is no real title available?)
• Fast dynamic arrays
• Diamond deque: A simple data structure for priority deques

Describes a project that uses

Uses Software

• STL

This page was built for publication: Experiences with the design and implementation of space-efficient deques

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