Priority queues and sorting for read-only data

DOI10.1007/978-3-642-38236-9_4MaRDI QIDQ4922111zbMATH OpenOpenAlexFDO

Authors Amr Elmasry, Jyrki Katajainen, Tetsuo Asano

Publication date 28 May 2013

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

Full work available at URL https://curis.ku.dk/ws/files/76544748/read_only_data.pdf

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Equivalence between priority queues and sorting
• scientific article; zbMATH DE number 2111732
• scientific article; zbMATH DE number 1303597
• scientific article; zbMATH DE number 871900
• Equivalence between priority queues and sorting in external memory

Cites work

• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 46835 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 2111732 (Why is no real title available?)
• A general Sequential Time-Space Tradeoff for Finding Unique Elements
• Algorithms and Computation
• Black box for constant-time insertion in priority queues (note)
• Comparison-based time-space lower bounds for selection
• Dynamic range majority data structures
• Memory-constrained algorithms for simple polygons
• Selection and sorting with limited storage
• Selection from read-only memory with limited workspace
• Space-time trade-offs for stack-based algorithms
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The design of dynamic data structures
• Upper bounds for time-space trade-offs in sorting and selection
• Wavelet trees for all
• Weak heaps engineered

Cited in

(15)

• scientific article; zbMATH DE number 2111732 (Why is no real title available?)
• Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
• Time-space trade-offs for triangulations and Voronoi diagrams
• Time-space trade-offs for triangulations and Voronoi diagrams
• Simple 2f-Color Choice Dictionaries
• Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
• Depth-First Search Using O(n) Bits
• Space-efficient algorithms for longest increasing subsequence
• Space-efficient algorithms for longest increasing subsequence
• Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
• Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
• Rank order filters and priority queues
• Selection from read-only memory with limited workspace
• A survey on priority queues
• Algorithms and Computation

This page was built for publication: Priority queues and sorting for read-only data

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