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