On the public citation graph
Space‐efficient tracking of persistent items in a massive data stream
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1006/jcss.2001.1813openalex-snapshot
Tracking Join and Self-Join Sizes in Limited Storage
inferredcites →https://doi.org/10.1007/11672142_15openalex-snapshot
Estimating Entropy and Entropy Norm on Data Streams
inferredcites →https://doi.org/10.1007/3-540-45465-9_59openalex-snapshot
Finding Frequent Items in Data Streams
inferredcites →https://doi.org/10.1007/978-3-540-30570-5_27openalex-snapshot
Efficient Computation of Frequent and Top-k Elements in Data Streams
inferredcites →https://doi.org/10.1007/978-3-642-04342-0_17openalex-snapshot
Exploiting Temporal Persistence to Detect Covert Botnet Channels
inferredcites →https://doi.org/10.1007/978-3-642-17502-2_12openalex-snapshot
An Analysis of the iKee.B iPhone Botnet
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1016/0167-6423(82)90012-0openalex-snapshot
Finding repeated elements
inferredcites →https://doi.org/10.1016/b978-155860869-6/50038-xopenalex-snapshot
Approximate Frequency Counts over Data Streams
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.001openalex-snapshot
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1016/s1353-4858(96)90043-4openalex-snapshot
UDP port denial-of-service attack
inferredcites →https://doi.org/10.1016/s1353-4858(96)90059-8openalex-snapshot
TCP SYN flooding and IP spoofing attacks
inferredcites →https://doi.org/10.1080/15427951.2006.10129117openalex-snapshot
Estimating Entropy and Entropy Norm on Data Streams
inferredcites →https://doi.org/10.1109/icdcs.2007.110openalex-snapshot
Fast Algorithms for Heavy Distinct Hitters using Associative Memories
inferredcites →https://doi.org/10.1109/icdcs.2008.98openalex-snapshot
Detecting Click Fraud in Pay-Per-Click Streams of Online Advertising Networks
inferredcites →https://doi.org/10.1109/infcom.2010.5462244openalex-snapshot
Tracking Long Duration Flows in Network Traffic
inferredcites →https://doi.org/10.1109/iwqos.2007.376561openalex-snapshot
Detecting Stealthy Spreaders Using Online Outdegree Histograms
inferredcites →https://doi.org/10.1109/sfcs.2003.1238202openalex-snapshot
Tight lower bounds for the distinct elements problem
inferredcites →https://doi.org/10.1145/1055558.1055598openalex-snapshot
Approximate counts and quantiles over sliding windows
inferredcites →https://doi.org/10.1145/1140103.1140295openalex-snapshot
Data streaming algorithms for estimating entropy of network traffic
inferredcites →https://doi.org/10.1145/1142351.1142393openalex-snapshot
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
inferredcites →https://doi.org/10.1145/1177080.1177086openalex-snapshot
A multifaceted approach to understanding the botnet phenomenon
inferredcites →https://doi.org/10.1145/1452520.1452538openalex-snapshot
How healthy are today's enterprise networks?
inferredcites →https://doi.org/10.1145/1452520.1452539openalex-snapshot
An empirical evaluation of entropy-based traffic anomaly detection
inferredcites →https://doi.org/10.1145/1533057.1533063openalex-snapshot
Automating analysis of large-scale botnet probing events
inferredcites →https://doi.org/10.1145/1807085.1807094openalex-snapshot
An optimal algorithm for the distinct elements problem
inferredcites →https://doi.org/10.1145/364520.364540openalex-snapshot
Algorithm 235: Random permutation
inferredcites →https://doi.org/10.1145/375663.375670openalex-snapshot
Space-efficient online computation of quantile summaries
inferredcites →https://doi.org/10.1145/376284.375670openalex-snapshot
Space-efficient online computation of quantile summaries
inferredcites →https://doi.org/10.1145/378580.378687openalex-snapshot
Estimating simple functions on the union of data streams
inferredcites →https://doi.org/10.1145/859716.859719openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.14778/1454159.1454225openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
inferredcites →https://doi.org/10.21236/ada461026openalex-snapshot
New Streaming Algorithms for Fast Detection of Superspreaders
inferredcites →https://doi.org/10.3233/jcs-2002-101-205openalex-snapshot
Practical automated detection of stealthy portscans
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00778-024-00869-6openalex-snapshot
WavingSketch: an unbiased and generic sketch for finding top-k items in data streams
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107518openalex-snapshot
Finding needles in a hay stream: On persistent item lookup in data streams
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00152openalex-snapshot
Finding Simplex Items in Data Streams
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796709openalex-snapshot
Persistent Items Tracking in Large Data Streams Based on Adaptive Sampling
inferred← citeshttps://doi.org/10.1109/iwqos57198.2023.10188743openalex-snapshot
SteadySketch: Finding Steady Flows in Data Streams
inferred← citeshttps://doi.org/10.1109/tnet.2018.2865125openalex-snapshot
Identifying and Estimating Persistent Items in Data Streams
inferred← citeshttps://doi.org/10.1109/tnet.2023.3306897openalex-snapshot
P-Sketch: A Fast and Accurate Sketch for Persistent Item Lookup
inferred← citeshttps://doi.org/10.1109/tnet.2024.3444488openalex-snapshot
SteadySketch: A High-Performance Algorithm for Finding Steady Flows in Data Streams
inferred← citeshttps://doi.org/10.1145/3394486.3403208openalex-snapshot
WavingSketch: An Unbiased and Generic Sketch for Finding Top-k Items in Data Streams
inferred← citeshttps://doi.org/10.1145/3485447.3512019openalex-snapshot
DUET: A Generic Framework for Finding Special Quadratic Elements in Data Streams
inferred← citeshttps://doi.org/10.1145/3589334.3645581openalex-snapshot
Stable-Sketch: A Versatile Sketch for Accurate, Fast, Web-Scale Data Stream Processing
inferred← citeshttps://doi.org/10.1155/2021/1864481openalex-snapshot
Detecting Persistent User Behavior Using Probabilistic Counting in Network-Wide View
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07214openalex-snapshot
A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.