Pages that link to "Item:Q1143174"
From MaRDI portal
The following pages link to Selection and sorting with limited storage (Q1143174):
Displaying 50 items.
- Approximate sorting of data streams with limited storage (Q346499) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Best-order streaming model (Q534570) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\) (Q1017656) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Estimating extreme tail risk measures with generalized Pareto distribution (Q1659253) (← links)
- On finding common neighborhoods in massive graphs. (Q1874417) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Quantile regression under memory constraint (Q2284373) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Monitoring networked applications with incremental quantile estimation (Q2381745) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Randomized algorithms for tracking distributed count, frequencies, and ranks (Q2414859) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 (Q2848968) (← links)
- Frugal Streaming for Estimating Quantiles (Q2848969) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
