Succinct Summing over Sliding Windows

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Algorithmica

• Publication date

  2018-11-01

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1007/s00453-018-0524-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Heavy hitters in streams and sliding windows

  2016cited by this paper
• Time- and Space-Efficient Sliding Window Top-k Query Processing

  2015cited by this paper
• Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching

  2014cited by this paper
• Near-optimal approximate membership query over time-decaying windows

  2013cited by this paper
• Tight Bounds for Sliding Bloom Filters

  2013cited by this paper
• Dynamic Graphs in the Sliding-Window Model

  2013cited by this paper
• Efficiently Monitoring Top-k Pairs over Sliding Windows

  2012cited by this paper
• Tracking distributed aggregates over time-based sliding windows

  2011cited by this paper
• Counting distinct objects over sliding windows

  2010cited by this paper
• How to catch L2-heavy-hitters on sliding windows

  2010cited by this paper
• Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream

  2008cited by this paper
• Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows

  2008cited by this paper
• Polylogarithmic Independence Can Fool DNF Formulas

  2007cited by this paper
• Continuous monitoring of top-k queries over sliding windows

  2006cited by this paper
• Maintaining significant stream statistics over sliding windows

  2006cited by this paper
• A simpler and more efficient deterministic scheme for finding frequent items over sliding windows

  2006cited by this paper
• Approximate counts and quantiles over sliding windows

  2004cited by this paper
• Longest increasing subsequences in sliding windows

  2004cited by this paper
• Maintaining time-decaying stream aggregates

  2003cited by this paper
• Maintaining variance and k-medians over data stream windows

  2003cited by this paper
• Distributed Streams Algorithms for Sliding Windows

  2002influential reference
• Maintaining Stream Statistics over Sliding Windows

  2002cited by this paper
• Probabilistic computations: Toward a unified measure of complexity

  1977cited by this paper

• Approximation-First Timeseries Monitoring Query At Scale

  2025cites this paper
• Rearchitecting Approximation-First Cloud Telemetry

  2025cites this paper
• Derandomization for Sliding Window Algorithms with Strict Correctness∗

  2020cites this paper