Selection from read-only memory with limited workspace
From MaRDI portal
Publication:744087
DOI10.1016/J.TCS.2014.06.012zbMATH Open1360.68379OpenAlexW1828011784MaRDI QIDQ744087FDOQ744087
Jyrki Katajainen, Daniel Dahl Juhl, Amr Elmasry, Srinivasa Rao Satti
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.012
Recommendations
- Selection from read-only memory with limited workspace
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- scientific article; zbMATH DE number 1383709
- Selection from read-only memory and sorting with minimum data movement
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)
Cites Work
- Introduction to algorithms.
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Title not available (Why is that?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Time bounds for selection
- Selection and sorting with limited storage
- Optimal lower bounds for rank and select indexes
- Upper bounds for time-space trade-offs in sorting and selection
- Comparison-based time-space lower bounds for selection
- Selection from read-only memory and sorting with minimum data movement
- Title not available (Why is that?)
- A general Sequential Time-Space Tradeoff for Finding Unique Elements
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Sorting multisets stably in minimum space
- Wavelet Trees for All
- Priority Queues and Sorting for Read-Only Data
- Selection and Sorting in the “Restore” Model
Cited In (11)
- Selection from read-only memory and sorting with minimum data movement
- Space-efficient Euler partition and bipartite edge coloring
- Frameworks for designing in-place graph algorithms
- Title not available (Why is that?)
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
- Space efficient linear time algorithms for BFS, DFS and applications
- Optimal In-place Algorithms for Basic Graph Problems
- Constant work-space algorithms for facility location problems
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- A Framework for In-place Graph Algorithms
This page was built for publication: Selection from read-only memory with limited workspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744087)
