Priority Queues and Sorting for Read-Only Data

DOI10.1007/978-3-642-38236-9_4zbMath1382.68055OpenAlexW2165056173MaRDI QIDQ4922111

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

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

Related Items

Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Depth-First Search Using $$O(n)$$ Bits ⋮ 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 ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Selection from read-only memory with limited workspace ⋮ Simple 2^f-Color Choice Dictionaries ⋮ A Survey on Priority Queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak heaps engineered
• The design of dynamic data structures
• Upper bounds for time-space trade-offs in sorting and selection
• Selection and sorting with limited storage
• Memory-constrained algorithms for simple polygons
• Wavelet Trees for All
• Black box for constant-time insertion in priority queues (note)
• Space-Time Trade-offs for Stack-Based Algorithms
• Dynamic Range Majority Data Structures
• A general Sequential Time-Space Tradeoff for Finding Unique Elements
• Selection from Read-Only Memory with Limited Workspace
• Algorithms and Computation

This page was built for publication: Priority Queues and Sorting for Read-Only Data