Streaming Algorithms Measured in Terms of the Computed Quantity
From MaRDI portal
Publication:3608859
DOI10.1007/978-3-540-73545-8_34zbMATH Open1206.68382OpenAlexW2134491124MaRDI QIDQ3608859FDOQ3608859
Authors: Shengyu Zhang
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_34
Recommendations
- Streaming algorithms via precision sampling
- Streaming Algorithms for Data in Motion
- Streaming algorithms with one-sided estimation
- Approximating hit rate curves using streaming algorithms
- Computing the throughput of probabilistic and replicated streaming applications
- scientific article; zbMATH DE number 1424324
- Time bounds for streaming problems
- Towards a theory of parameterized streaming algorithms
- Streaming Algorithms for Selection and Approximate Sorting
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Theory of data (68P99)
Cited In (8)
- Narrow big data in a stream: computational limitations and regression
- An \(\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})\) space lower bound for finding \(\epsilon \)-approximate quantiles in a data stream
- Streaming Algorithms for Data in Motion
- Unidirectional input/output streaming complexity of reversal and sorting
- Untangling the braid: finding outliers in a set of streams
- Stochastic streams: sample complexity vs. space complexity
- Data streams and applications in computer science
- Streaming algorithms with one-sided estimation
This page was built for publication: Streaming Algorithms Measured in Terms of the Computed Quantity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608859)