Selection and sorting with limited storage
From MaRDI portal
Cited in
(81)- Approximation in (poly-) logarithmic space
- Finding the Median (Obliviously) with Bounded Space
- Computing a visibility polygon using few variables
- Selection from read-only memory and sorting with minimum data movement
- Best-order streaming model
- The shifting sands algorithm
- Strictly in-place algorithms for permuting and inverting permutations
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- A time-space tradeoff for sorting on non-oblivious machines
- Time-space trade-offs for triangulations and Voronoi diagrams
- Upper bounds for time-space trade-offs in sorting and selection
- Time-space trade-offs for triangulations and Voronoi diagrams
- Sorting streamed multisets
- Improved space efficient algorithms for BFS, DFS and applications
- Memory-constrained algorithms for simple polygons
- On finding common neighborhoods in massive graphs.
- Regular Programming for Quantitative Properties of Data Streams
- Distributed algorithms for selection in sets
- Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)
- Tight lower bounds for query processing on streaming and external memory data
- Learning nested concept classes with limited storage
- Frameworks for designing in-place graph algorithms
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
- Space-efficient vertex separators for treewidth
- Streaming Algorithms for Selection and Approximate Sorting
- EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
- A framework for in-place graph algorithms
- Finding median in read-only memory on integer input
- Graph connectivity in log steps using label propagation
- Space-efficient algorithms for longest increasing subsequence
- Sublinear-space approximation algorithms for Max \(r\)-SAT
- Space-efficient algorithms for longest increasing subsequence
- Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
- Joint tracking of multiple quantiles through conditional quantiles
- An improved algorithm for finding the median distributively
- Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)
- The hardness of median in the synchronized bit communication model
- Estimating extreme tail risk measures with generalized Pareto distribution
- Streaming techniques and data aggregation in networks of tiny artefacts
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Lightweight data indexing and compression in external memory
- Quantile regression under memory constraint
- A Modular CDF Approach for the Approximation of Percentiles
- Matching nuts and bolts faster
- Competitive analysis of maintaining frequent items of a stream
- Computing graph spanners in small memory: fault-tolerance and streaming
- Streaming algorithms for multitasking scheduling with shared processing
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
- Approximation in (Poly-) Logarithmic Space
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Adversarially robust property-preserving hash functions
- A nearly optimal randomized algorithm for explorable heap selection
- Space efficient linear time algorithms for BFS, DFS and applications
- Approximate sorting of data streams with limited storage
- Sleeping on the job: energy-efficient and robust broadcast for radio networks
- Space-time trade-offs for stack-based algorithms
- Priority queues and sorting for read-only data
- Asymmetric scale functions for t-digests
- Deterministic near-optimal distributed listing of cliques
- Computing (and Life) Is All about Tradeoffs
- Frugal Streaming for Estimating Quantiles
- Revisiting frequency moment estimation in random order streams
- The online space complexity of probabilistic languages
- Optimal In-place Algorithms for Basic Graph Problems
- Monitoring networked applications with incremental quantile estimation
- Constant work-space algorithms for facility location problems
- Spiking neural networks through the lens of streaming algorithms
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Geometric streaming algorithm with A sorting primitive
- Randomized algorithms for tracking distributed count, frequencies, and ranks
- Space-efficient biconnected components and recognition of outerplanar graphs
- Matching nuts and bolts faster
- The complexity of mean payoff games on graphs
- Selection from read-only memory with limited workspace
- Automata theory on sliding windows
- A survey on priority queues
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- Indexing for summary queries
- Reprint of: Memory-constrained algorithms for simple polygons
This page was built for publication: Selection and sorting with limited storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143174)
