Selection from read-only memory with limited workspace
type: Item
instance of: scholarly article
title: Selection from read-only memory with limited workspace
zbMATH Open document ID: 1360.68379
author: Amr Elmasry
author: Daniel Dahl Juhl
author: Jyrki Katajainen
author: Srinivasa Rao Satti
published in: Theoretical Computer Science
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6351425
zbMATH Keywords: selection algorithm
zbMATH Keywords: read-only memory
zbMATH Keywords: random-access machine
zbMATH Keywords: multi-pass streaming
zbMATH Keywords: bit vector
zbMATH Keywords: wavelet stack
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.06.012
OpenAlex ID: W1828011784
cites work: Priority Queues and Sorting for Read-Only Data
cites work: A general Sequential Time-Space Tradeoff for Finding Unique Elements
cites work: Time bounds for selection
cites work: Comparison-based time-space lower bounds for selection
cites work: Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
cites work: Selection and Sorting in the “Restore” Model
cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching
cites work: Q3651735
cites work: Upper bounds for time-space trade-offs in sorting and selection
cites work: Optimal lower bounds for rank and select indexes
cites work: Q4471381
cites work: Sorting multisets stably in minimum space
cites work: Selection and sorting with limited storage
cites work: Selection from read-only memory and sorting with minimum data movement
cites work: Wavelet Trees for All
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: Q4719333
DOI: 10.1016/J.TCS.2014.06.012
description: scientific article; zbMATH DE number 6351425