On the public citation graph
An efficient framework for parallel and continuous frequent item monitoring
0 signed · 59 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.1007/3-540-45749-6_33openalex-snapshot
Frequency Estimation of Internet Packet Streams with Limited Space
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_7openalex-snapshot
An Improved Data Stream Summary: The Count-Min Sketch and Its 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.comcom.2010.04.026openalex-snapshot
Parallelizing weighted frequency counting in high-speed network monitoring
inferredcites →https://doi.org/10.1016/j.ins.2015.09.003openalex-snapshot
A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
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/j.procs.2012.04.010openalex-snapshot
Frequent Items Mining Acceleration Exploiting Fast Parallel Sorting on the GPU
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1109/90.929850openalex-snapshot
Deriving traffic demands for operational IP networks: methodology and experience
inferredcites →https://doi.org/10.1109/glocom.1999.832484openalex-snapshot
Inter-AS traffic patterns and their implications
inferredcites →https://doi.org/10.1109/icccn.2000.885475openalex-snapshot
Flow identification for supporting per-flow queueing
inferredcites →https://doi.org/10.1109/icde.2009.231openalex-snapshot
CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams
inferredcites →https://doi.org/10.1109/icde.2010.5447856openalex-snapshot
FPGA acceleration for the frequent item problem
inferredcites →https://doi.org/10.1109/icnp.2001.992899openalex-snapshot
Controlling high-bandwidth flows at the congested router
inferredcites →https://doi.org/10.1109/saint.2004.1266104openalex-snapshot
On the characteristics of Internet traffic variability: spikes and elephants
inferredcites →https://doi.org/10.1109/tkde.2010.216openalex-snapshot
Frequent Item Computation on a Chip
inferredcites →https://doi.org/10.1145/1005686.1005709openalex-snapshot
Data streaming algorithms for efficient and accurate estimation of flow size distribution
inferredcites →https://doi.org/10.1145/1066157.1066227openalex-snapshot
Fast and approximate stream mining of quantiles and frequencies using graphics processors
inferredcites →https://doi.org/10.1145/1166074.1166084openalex-snapshot
An integrated efficient solution for computing frequent and top- k elements in data streams
inferredcites →https://doi.org/10.1145/1185347.1185364openalex-snapshot
High-throughput sketch update on a low-power stream processor
inferredcites →https://doi.org/10.1145/1247480.1247510openalex-snapshot
Fast data stream algorithms using associative memories
inferredcites →https://doi.org/10.1145/1457150.1457152openalex-snapshot
CAM conscious integrated answering of frequent elements and top-k queries over data streams
inferredcites →https://doi.org/10.1145/1559795.1559819openalex-snapshot
Space-optimal heavy hitters with strong error bounds
inferredcites →https://doi.org/10.1145/2339530.2339757openalex-snapshot
Efficient frequent item counting in multi-core hardware
inferredcites →https://doi.org/10.1145/633025.633055openalex-snapshot
On the characteristics and origins of internet flow rates
inferredcites →https://doi.org/10.1145/637201.637227openalex-snapshot
A pragmatic definition of elephants in internet backbone traffic
inferredcites →https://doi.org/10.1145/762471.762473openalex-snapshot
A simple algorithm for finding frequent elements in streams and bags
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/1687627.1687653openalex-snapshot
Thread cooperation in multicore architectures for frequency counting over multiple data streams
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3773openalex-snapshot
Parallel social network mining for interesting ‘following’ patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-95174-4_48openalex-snapshot
Parallel Mining of Correlated Heavy Hitters
inferred← citeshttps://doi.org/10.1007/s10618-017-0526-xopenalex-snapshot
Fast and accurate mining of correlated heavy hitters
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.11.021openalex-snapshot
Parallel mining of time-faded heavy hitters
inferred← citeshttps://doi.org/10.1016/j.future.2018.12.030openalex-snapshot
Mining frequent items in unstructured P2P networks
inferred← citeshttps://doi.org/10.1016/j.future.2019.07.031openalex-snapshot
CMSS: Sketching based reliable tracking of large network flows
inferred← citeshttps://doi.org/10.1016/j.ins.2015.09.003openalex-snapshot
A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
inferred← citeshttps://doi.org/10.1016/j.ins.2016.07.077openalex-snapshot
Mining frequent items in the time fading model
inferred← citeshttps://doi.org/10.1016/j.ins.2020.09.048openalex-snapshot
Distributed mining of time-faded heavy hitters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105134openalex-snapshot
QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements
inferred← citeshttps://doi.org/10.1109/access.2017.2757238openalex-snapshot
On Frequency Estimation and Detection of Frequent Items in Time Faded Streams
inferred← citeshttps://doi.org/10.1109/access.2019.2911573openalex-snapshot
Mining Frequent Items Over the Distributed Hierarchical Continuous Weighted Data Streams in Internet of Things
inferred← citeshttps://doi.org/10.1109/access.2022.3212393openalex-snapshot
Deterministic, Fast and Accurate Solution of the Heavy Hitters q-Tail Latencies Problem
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622201openalex-snapshot
Parallel Mining of Correlated Heavy Hitters on Distributed and Shared-Memory Architectures
inferred← citeshttps://doi.org/10.1109/hpcs.2017.108openalex-snapshot
CUDA Based Parallel Implementations of Space-Saving on a GPU
inferred← citeshttps://doi.org/10.1109/ihmsc.2016.123openalex-snapshot
A Parallel Frequent Item Counting Algorithm
inferred← citeshttps://doi.org/10.1145/2612669.2612695openalex-snapshot
Parallel streaming frequency-based aggregates
inferred← citeshttps://doi.org/10.14778/3746405.3746434openalex-snapshot
Cuckoo Heavy Keeper and the Balancing Act of Maintaining Heavy Hitters in Stream Processing
inferred← citeshttps://doi.org/10.2134/agronmonogr59.c13openalex-snapshot
Precision Conservation for Biofuel Production
inferred← citeshttps://doi.org/10.3390/fi12090158openalex-snapshot
On Frequency Estimation and Detection of Heavy Hitters in Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1611.04942openalex-snapshot
Fast and Accurate Mining of Correlated Heavy Hitters
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03004openalex-snapshot
Parallel mining of time-faded heavy hitters
inferred← citeshttps://doi.org/10.5281/zenodo.46276openalex-snapshot
Development Of Technology Of Bakery Products Supplemented With Kelp Laminaria
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.