Streaming Algorithms Measured in Terms of the Computed Quantity

DOI10.1007/978-3-540-73545-8_34MaRDI QIDQ3608859zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Theory of data (68P99)

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

Cited in

(8)

• An \(\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})\) space lower bound for finding \(\epsilon \)-approximate quantiles in a data stream
• Streaming algorithms with one-sided estimation
• Data streams and applications in computer science
• Stochastic streams: sample complexity vs. space complexity
• Streaming Algorithms for Data in Motion
• Narrow big data in a stream: computational limitations and regression
• Unidirectional input/output streaming complexity of reversal and sorting
• Untangling the braid: finding outliers in a set of streams

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)