On the public citation graph
Data Streams: Algorithms and Applications
0 signed · 882 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.1002/0471448354openalex-snapshot
Exploratory Data Mining and Data Cleaning
inferredcites →https://doi.org/10.1006/jagm.2000.1131openalex-snapshot
A Small Approximately Min-Wise Independent Family of Hash Functions
inferredcites →https://doi.org/10.1007/10719839_13openalex-snapshot
Graph Structure of the Web: A Survey
inferredcites →https://doi.org/10.1007/11561071_65openalex-snapshot
Workload-Optimal Histograms on Streams
inferredcites →https://doi.org/10.1007/3-540-44853-5_10openalex-snapshot
Locating Hidden Groups in Communication Networks Using Hidden Markov Models
inferredcites →https://doi.org/10.1007/3-540-45465-9_58openalex-snapshot
Histogramming Data Streams with Fast Per-Item Processing
inferredcites →https://doi.org/10.1007/3-540-45726-7_1openalex-snapshot
Counting Distinct Elements in a Data Stream
inferredcites →https://doi.org/10.1007/3-540-45749-6_31openalex-snapshot
Estimating Rarity and Similarity over Data Stream Windows
inferredcites →https://doi.org/10.1007/3-540-46541-3_16openalex-snapshot
An Approximate L p-Difference Algorithm for Massive Data Streams
inferredcites →https://doi.org/10.1007/3-540-48224-5_40openalex-snapshot
Permutation Editing and Matching via Embeddings
inferredcites →https://doi.org/10.1007/3-540-49257-7_16openalex-snapshot
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applications
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_30openalex-snapshot
Maintenance of Multidimensional Histograms
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_1openalex-snapshot
Efficient Private Matching and Set Intersection
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_3openalex-snapshot
Secure Computation of the k th -Ranked Element
inferredcites →https://doi.org/10.1007/978-3-540-27819-1_13openalex-snapshot
Inferring Mixtures of Markov Chains
inferredcites →https://doi.org/10.1007/978-3-540-30073-1_5openalex-snapshot
Experimental Analysis of Privacy-Preserving Statistics Computation
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_3openalex-snapshot
Streaming Algorithms for Geometric Problems
inferredcites →https://doi.org/10.1007/978-3-540-30570-5_25openalex-snapshot
Optimal Workload-Based Weighted Wavelet Synopses
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-540-39658-1_16openalex-snapshot
Estimating Dominance Norms of Multiple Data Streams
inferredcites →https://doi.org/10.1007/bf01456326openalex-snapshot
Zur Theorie der orthogonalen Funktionensysteme
inferredcites →https://doi.org/10.1007/s003659900046openalex-snapshot
Best Approximation with Walsh Atoms
inferredcites →https://doi.org/10.1007/s00453-004-1105-2openalex-snapshot
Computing Diameter in the Streaming and Sliding-Window Models
inferredcites →https://doi.org/10.1007/s00778-003-0095-zopenalex-snapshot
Aurora: a new model and architecture for data stream management
inferredcites →https://doi.org/10.1007/s00778-004-0135-3openalex-snapshot
Tracking set-expression cardinalities over continuous update streams
inferredcites →https://doi.org/10.1016/0167-6423(82)90012-0openalex-snapshot
Finding repeated elements
inferredcites →https://doi.org/10.1016/b978-012722442-8/50048-3openalex-snapshot
Finding Hierarchical Heavy Hitters in Data Streams
inferredcites →https://doi.org/10.1016/b978-155860869-6/50037-8openalex-snapshot
Comparing Data Streams Using Hamming Norms (How to Zero In)
inferredcites →https://doi.org/10.1016/b978-155860869-6/50047-0openalex-snapshot
How to Summarize the Universe
inferredcites →https://doi.org/10.1016/b978-155860869-6/50077-9openalex-snapshot
Reverse Nearest Neighbor Aggregates Over Data Streams
inferredcites →https://doi.org/10.1016/j.ipl.2004.09.018openalex-snapshot
Fast estimation of fractal dimension and correlation integral on stream data
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.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1017/9781009701259.002openalex-snapshot
Geometric Approximation via Coresets
inferredcites →https://doi.org/10.1017/s0963548300000080openalex-snapshot
Three Thresholds for a Liar
inferredcites →https://doi.org/10.1023/a:1011464915332openalex-snapshot
Signature-Based Methods for Data Streams
inferredcites →https://doi.org/10.1023/a:1018900431309openalex-snapshot
The best m-term approximation and greedy algorithms
inferredcites →https://doi.org/10.1080/01621459.1976.10480344openalex-snapshot
A Method for Simulating Stable Random Variables
inferredcites →https://doi.org/10.1093/biomet/40.3-4.237openalex-snapshot
THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
inferredcites →https://doi.org/10.1109/40.988692openalex-snapshot
Maintaining statistics counters in router line cards
inferredcites →https://doi.org/10.1109/ccc.2003.1214414openalex-snapshot
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
inferredcites →https://doi.org/10.1109/icde.2005.68openalex-snapshot
Finding (Recently) Frequent Items in Distributed Data Streams
inferredcites →https://doi.org/10.1109/icde.2006.73openalex-snapshot
Fractal Modeling of IP Network Traffic at Streaming Speeds
inferredcites →https://doi.org/10.1109/infcom.2004.1354567openalex-snapshot
What's new: Finding significant differences in network data streams
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1996.548491openalex-snapshot
Efficient approximate and dynamic matching of patterns using a labeling paradigm
inferredcites →https://doi.org/10.1109/sfcs.2000.892082openalex-snapshot
Stable distributions, pseudorandom generators, embeddings and data stream computation
inferredcites →https://doi.org/10.1109/sfcs.2003.1238192openalex-snapshot
Always Good Turing: asymptotically optimal probability estimation
inferredcites →https://doi.org/10.1109/sfcs.2003.1238202openalex-snapshot
Tight lower bounds for the distinct elements problem
inferredcites →https://doi.org/10.1109/ssdbm.2004.51openalex-snapshot
Mining deviants in time series data streams
inferredcites →https://doi.org/10.1109/tit.2003.815784openalex-snapshot
Set reconciliation with nearly optimal communication complexity
inferredcites →https://doi.org/10.1109/tit.2004.834793openalex-snapshot
Greed is Good: Algorithmic Results for Sparse Approximation
inferredcites →https://doi.org/10.1109/tsmc.1979.4310078openalex-snapshot
Walsh Functions and Their Applications
inferredcites →https://doi.org/10.1117/12.615931openalex-snapshot
Improved time bounds for near-optimal sparse Fourier representations
inferredcites →https://doi.org/10.1137/1.9781611972757.5openalex-snapshot
Summarizing and Mining Skewed Data Streams
inferredcites →https://doi.org/10.1137/s0097539704442684openalex-snapshot
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
inferredcites →https://doi.org/10.1137/s0097539792240406openalex-snapshot
Sparse Approximate Solutions to Linear Systems
inferredcites →https://doi.org/10.1137/s009753979732699xopenalex-snapshot
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
inferredcites →https://doi.org/10.1145/1005686.1005699openalex-snapshot
Flow sampling under hard resource constraints
inferredcites →https://doi.org/10.1145/1007352.1007413openalex-snapshot
Algorithms for dynamic geometric problems over data streams
inferredcites →https://doi.org/10.1145/1007568.1007575openalex-snapshot
Holistic UDAFs at streaming speeds
inferredcites →https://doi.org/10.1145/1007568.1007647openalex-snapshot
Spatially-decaying aggregation over a network
inferredcites →https://doi.org/10.1145/1007568.1007701openalex-snapshot
Load management and high availability in the Medusa distributed stream processing system
inferredcites →https://doi.org/10.1145/1011767.1011791openalex-snapshot
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
inferredcites →https://doi.org/10.1145/1028788.1028802openalex-snapshot
Online identification of hierarchical heavy hitters
inferredcites →https://doi.org/10.1145/1030083.1030087openalex-snapshot
On the difficulty of scalably detecting network attacks
inferredcites →https://doi.org/10.1145/1031495.1031525openalex-snapshot
Synopsis diffusion for robust aggregation in sensor networks
inferredcites →https://doi.org/10.1145/1055558.1055582openalex-snapshot
Deterministic wavelet thresholding for maximum-error metrics
inferredcites →https://doi.org/10.1145/1055558.1055595openalex-snapshot
Adaptive sampling for geometric problems over data streams
inferredcites →https://doi.org/10.1145/1055558.1055598openalex-snapshot
Approximate counts and quantiles over sliding windows
inferredcites →https://doi.org/10.1145/1060590.1060621openalex-snapshot
Optimal approximations of the frequency moments of data streams
inferredcites →https://doi.org/10.1145/1060590.1060622openalex-snapshot
Coresets in dynamic geometric data streams
inferredcites →https://doi.org/10.1145/1060590.1060647openalex-snapshot
Undirected ST-connectivity in log-space
inferredcites →https://doi.org/10.1145/1061318.1061325openalex-snapshot
What's hot and what's not: tracking most frequent items dynamically
inferredcites →https://doi.org/10.1145/1064092.1064116openalex-snapshot
Sampling in dynamic data streams and applications
inferredcites →https://doi.org/10.1145/1064092.1064121openalex-snapshot
Multi-pass geometric algorithms
inferredcites →https://doi.org/10.1145/1065167.1065201openalex-snapshot
Space efficient mining of multigraph streams
inferredcites →https://doi.org/10.1145/1065167.1065209openalex-snapshot
Estimating arbitrary subset sums with few probes
inferredcites →https://doi.org/10.1145/1065167.1065211openalex-snapshot
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
inferredcites →https://doi.org/10.1145/1066157.1066159openalex-snapshot
Sampling algorithms in a stream operator
inferredcites →https://doi.org/10.1145/1066157.1066161openalex-snapshot
Holistic aggregates in a networked world
inferredcites →https://doi.org/10.1145/1080173.1080176openalex-snapshot
Detecting malicious network traffic using inverse distributions of packet contents
inferredcites →https://doi.org/10.1145/1081870.1081884openalex-snapshot
Wavelet synopsis for data streams
inferredcites →https://doi.org/10.1145/1081870.1081942openalex-snapshot
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
inferredcites →https://doi.org/10.1145/1132863.1132873openalex-snapshot
Approximation and streaming algorithms for histogram construction problems
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/191839.191886openalex-snapshot
Quickly generating billion-record synthetic databases
inferredcites →https://doi.org/10.1145/195058.195164openalex-snapshot
Symmetry breaking for suffix tree construction
inferredcites →https://doi.org/10.1145/229459.229469openalex-snapshot
Comparing information without leaking it
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/258533.258657openalex-snapshot
Incremental clustering and dynamic information retrieval
inferredcites →https://doi.org/10.1145/258533.258673openalex-snapshot
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
inferredcites →https://doi.org/10.1145/276304.276343openalex-snapshot
Random sampling for histogram construction
inferredcites →https://doi.org/10.1145/276698.276781openalex-snapshot
Min-wise independent permutations (extended abstract)
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/303976.303978openalex-snapshot
Tracking join and self-join sizes in limited storage
inferredcites →https://doi.org/10.1145/304181.304204openalex-snapshot
Random sampling techniques for space efficient online computation of order statistics of large datasets
inferredcites →https://doi.org/10.1145/335305.335353openalex-snapshot
Approximate nearest neighbors and sequence comparison with block operations
inferredcites →https://doi.org/10.1145/360825.360861openalex-snapshot
A linear space algorithm for computing maximal common subsequences
inferredcites →https://doi.org/10.1145/375663.375665openalex-snapshot
On computing correlated aggregates over continual data streams
inferredcites →https://doi.org/10.1145/375663.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/380752.380858openalex-snapshot
Fast computation of low rank matrix approximations
inferredcites →https://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferredcites →https://doi.org/10.1145/509907.509933openalex-snapshot
Near-optimal sparse fourier representations via sampling
inferredcites →https://doi.org/10.1145/509907.509944openalex-snapshot
Clifford algebras and approximating the permanent
inferredcites →https://doi.org/10.1145/509907.509963openalex-snapshot
Space lower bounds for distance approximation in the data stream model
inferredcites →https://doi.org/10.1145/509907.509964openalex-snapshot
Approximate counting of inversions in a data stream
inferredcites →https://doi.org/10.1145/509907.509966openalex-snapshot
Fast, small-space algorithms for approximate histogram maintenance
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564691.564719openalex-snapshot
Mining database structure; or, how to build a data quality browser
inferredcites →https://doi.org/10.1145/564691.564741openalex-snapshot
Dynamic multidimensional histograms
inferredcites →https://doi.org/10.1145/570738.570751openalex-snapshot
Wireless sensor networks for habitat monitoring
inferredcites →https://doi.org/10.1145/605397.605408openalex-snapshot
Energy-efficient computing for wildlife tracking
inferredcites →https://doi.org/10.1145/637201.637242openalex-snapshot
Observed structure of addresses in IP traffic
inferredcites →https://doi.org/10.1145/641480.641513openalex-snapshot
Application of the two-sided depth test to CSG rendering
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/772862.772865openalex-snapshot
Cryptographic techniques for privacy-preserving data mining
inferredcites →https://doi.org/10.1145/775047.775061openalex-snapshot
Bursty and hierarchical structure in streams
inferredcites →https://doi.org/10.1145/780542.780548openalex-snapshot
Better streaming algorithms for clustering problems
inferredcites →https://doi.org/10.1145/859716.859719openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/863955.863972openalex-snapshot
Automatically inferring patterns of resource consumption in network traffic
inferredcites →https://doi.org/10.1145/948205.948227openalex-snapshot
Identifying frequent items in sliding windows over on-line packet streams
inferredcites →https://doi.org/10.1145/997817.997842openalex-snapshot
Deterministic sampling and range counting in geometric data streams
inferredcites →https://doi.org/10.1145/997817.997844openalex-snapshot
Range counting over multidimensional data streams
inferredcites →https://doi.org/10.1184/r1/6609716openalex-snapshot
Space-Efficient Finger Search on Degree-Balanced Search Trees
inferredcites →https://doi.org/10.1214/06-ba112openalex-snapshot
A one-pass sequential Monte Carlo method for Bayesian analysis of massive datasets
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
inferredcites →https://doi.org/10.2307/409735openalex-snapshot
Human behavior and the principle of least effort: An introduction to human ecology. By George Kingsley Zipf. Pp. xi, 573. Cambridge, Mass.: Addison-Wesley Press, 1949.
inferredcites →https://doi.org/10.48550/arxiv.cs/0310002openalex-snapshot
The Graphics Card as a Streaming Computer
inferredcites →https://doi.org/10.5555/1070432.1070537openalex-snapshot
Graph distances in the streaming model: the value of space
inferredcites →https://doi.org/10.5555/1070432.1070550openalex-snapshot
Improved range-summable random variable construction algorithms
inferredcites →https://doi.org/10.5555/365411.365499openalex-snapshot
Sublinear time approximate clustering
inferredcites →https://doi.org/10.5555/545381.545464openalex-snapshot
Reductions in streaming algorithms, with an application to counting triangles in graphs
inferredcites →https://doi.org/10.5555/545381.545466openalex-snapshot
Maintaining stream statistics over sliding windows: (extended abstract)
inferredcites →https://doi.org/10.5555/545381.545470openalex-snapshot
The string edit distance matching problem with moves
inferredcites →https://doi.org/10.5555/644108.644147openalex-snapshot
Pass efficient algorithms for approximating large matrices
inferredcites →https://doi.org/10.5555/644108.644149openalex-snapshot
Approximation of functions over redundant dictionaries using coherence
inferredcites →https://doi.org/10.5555/982792.982815openalex-snapshot
An improved data stream algorithm for frequency moments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.3170513openalex-extracted
Compendious and Optimized Succinct Data Structures for Big Data Store
inferred← citeshttps://doi.org/10.1002/cpe.4435openalex-snapshot
Practical privacy‐preserving deep packet inspection outsourcing
inferred← citeshttps://doi.org/10.1002/dac.1211openalex-snapshot
A sliding window‐based false‐negative approach for ubiquitous data stream analysis
inferred← citeshttps://doi.org/10.1002/net.21450openalex-snapshot
Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
inferred← citeshttps://doi.org/10.1002/spe.2348openalex-snapshot
Mining hot calling contexts in small space
inferred← citeshttps://doi.org/10.1002/widm.1315openalex-snapshot
On the application of sequential pattern mining primitives to process discovery: Overview, outlook and opportunity identification
inferred← citeshttps://doi.org/10.1007/11841036_16openalex-snapshot
Estimating Entropy over Data Streams
inferred← citeshttps://doi.org/10.1007/11940128_18openalex-snapshot
On Estimating Path Aggregates over Streaming Graphs
inferred← citeshttps://doi.org/10.1007/11965893_20openalex-snapshot
Database Query Processing Using Finite Cursor Machines
inferred← citeshttps://doi.org/10.1007/3-540-73679-4_11openalex-snapshot
Tensor Analysis on Multi-aspect Streams
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_184openalex-snapshot
Graph Mining on Streams
inferred← citeshttps://doi.org/10.1007/978-1-4419-6515-8_3openalex-snapshot
Community Evolution and Change Point Detection in Time-Evolving Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_478openalex-snapshot
Weighted Random Sampling
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_613openalex-snapshot
Efficient Decodable Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-01057-7_11openalex-snapshot
Compressive Sensing Based ECG Biometric System
inferred← citeshttps://doi.org/10.1007/978-3-030-11821-1_16openalex-snapshot
Online Anomaly Detection over Big Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-030-29349-9_2openalex-snapshot
Core-Sets: Updated Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-29349-9_6openalex-snapshot
Sampling Technique for Complex Data
inferred← citeshttps://doi.org/10.1007/978-3-030-29400-7_29openalex-snapshot
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers
inferred← citeshttps://doi.org/10.1007/978-3-030-30719-6_10openalex-snapshot
Online and Scalable Adaptive Cyber Defense
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_17openalex-snapshot
Fast Identification of Heavy Hitters by Cached and Packed Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-34500-6_17openalex-snapshot
Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-43981-1_6openalex-snapshot
Data Summarization Using Sampling Algorithms: Data Stream Case Study
inferred← citeshttps://doi.org/10.1007/978-3-030-46140-9_9openalex-snapshot
An Efficient Set-Based Algorithm for Variable Streaming Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-57602-8_20openalex-snapshot
Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-79025-7_1openalex-snapshot
Fast Approximation of the Top-k Items in Data Streams Using a Reconfigurable Accelerator
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_45openalex-snapshot
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-18367-6_11openalex-snapshot
On Streaming Algorithms for Geometric Independent Set and Clique
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_3openalex-snapshot
LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_5openalex-snapshot
Distributed Coloring of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-78383-8_1openalex-snapshot
Judgment Analysis in a Streaming Setting Incurring Logarithmic Space of the Annotators
inferred← citeshttps://doi.org/10.1007/978-3-031-87995-1_10openalex-snapshot
Counting Heavy Items in Filtered Data Streams Using an HLS-Generated FPGA Kernel
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_32openalex-snapshot
Streaming Algorithms for Scheduling Jobs with Priorities
inferred← citeshttps://doi.org/10.1007/978-3-032-21524-6_18openalex-snapshot
Enabling Real-Time Crowd Monitoring with Distributed AI and Kafka: A Path Towards Digital Sovereignty in Public Safety Infrastructure
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_28openalex-snapshot
Monitoring Probabilistic Threshold SUM Query Processing in Uncertain Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_17openalex-snapshot
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_27openalex-snapshot
Triangle Counting in Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_11openalex-snapshot
Interval Selection in the Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-28865-9_9openalex-snapshot
RScam: Cloud-Based Anti-Malware via Reversible Sketch
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_9openalex-snapshot
Know When to Persist: Deriving Value from a Stream Buffer
inferred← citeshttps://doi.org/10.1007/978-3-319-41706-6_1openalex-snapshot
Online Social Networks Event Detection: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-42345-6_1openalex-snapshot
Shortest Paths on Evolving Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-48472-3_12openalex-snapshot
Online Discovery of Cooperative Structures in Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_11openalex-snapshot
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_326-1openalex-snapshot
Online Machine Learning in Big Data Streams: Overview
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_326openalex-snapshot
Online Machine Learning in Big Data Streams: Overview
inferred← citeshttps://doi.org/10.1007/978-3-319-89890-2_31openalex-snapshot
Development of an Efficient Multifidelity Non-intrusive Uncertainty Quantification Method
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_18openalex-snapshot
A Dynamic Distributed Data Structure for Top-k and k-Select Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_9openalex-snapshot
Classical and Quantum Computations with Restricted Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_1openalex-snapshot
Data Stream Management: A Brave New World
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_15openalex-snapshot
Tracking Queries over Distributed Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-69497-7_16openalex-snapshot
Efficiently Discovering Recent Frequent Items in Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_49openalex-snapshot
Finding Frequent Items in a Turnstile Data Stream
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_42openalex-snapshot
Testing Properties of Sets of Points in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_11openalex-snapshot
Finding a Duplicate and a Missing Item in a Stream
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_34openalex-snapshot
Streaming Algorithms Measured in Terms of the Computed Quantity
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_2openalex-snapshot
Approximate Range Searching: The Absolute Model
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_42openalex-snapshot
On Finding Frequent Elements in a Data Stream
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_27openalex-snapshot
Streaming Algorithms for Data in Motion
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_5openalex-snapshot
CR-precis: A Deterministic Summary Structure for Update Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-87481-2_41openalex-snapshot
Data Streaming with Affinity Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-88181-0_15openalex-snapshot
SeSaR: Security for Safety
inferred← citeshttps://doi.org/10.1007/978-3-642-01399-7_7openalex-snapshot
Counting Flows over Sliding Windows in High Speed Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_7openalex-snapshot
On the Value of Multiple Read/Write Streams for Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_15openalex-snapshot
Competitive Analysis of Aggregate Max in Windowed Streaming
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_70openalex-snapshot
Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_26openalex-snapshot
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_44openalex-snapshot
Bipartite Graph Matchings in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-10677-4_99openalex-snapshot
Exploring Early Classification Strategies of Streaming Data with Delayed Attributes
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_28openalex-snapshot
Drawing Trees in a Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_23openalex-snapshot
Grammar-Based Compression in a Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_24openalex-snapshot
Compression, Indexing, and Retrieval for Massive String Data
inferred← citeshttps://doi.org/10.1007/978-3-642-14246-8_9openalex-snapshot
Continuous Summarization of Co-evolving Data in Large Water Distribution Network
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_2openalex-snapshot
Incremental Algorithms for Effective and Efficient Query Recommendation
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_5openalex-snapshot
Sublinear-time Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-16392-0_3openalex-snapshot
Resource Aware Distributed Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-17316-5_33openalex-snapshot
Self-adaptive Change Detection in Streaming Data with Non-stationary Distribution
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_20openalex-snapshot
Computing Strongly Connected Components in the Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_22openalex-snapshot
Matching in Bipartite Graph Streams in a Small Number of Passes
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_5openalex-snapshot
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_42openalex-snapshot
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_3openalex-snapshot
Continuous Inverse Ranking Queries in Uncertain Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_27openalex-snapshot
Approximately Uniform Online Checkpointing
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_14openalex-snapshot
Periodicity and Cyclic Shifts via Linear Sketches
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_3openalex-snapshot
Sparse Recovery with Partial Support Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_37openalex-snapshot
Streaming Algorithms with One-Sided Estimation
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_38openalex-snapshot
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-23041-7_18openalex-snapshot
Privacy-Preserving Environment Monitoring in Networks of Mobile Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_57openalex-snapshot
Approximate Counting of Cycles in Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_27openalex-snapshot
Optimal Random Sampling from Distributed Streams Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_613-1openalex-snapshot
Efficient Decodable Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-29063-3_6openalex-snapshot
Live Geoinformation with Standardized Geoprocessing Services
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_9openalex-snapshot
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_30openalex-snapshot
Competitive Analysis of Maintaining Frequent Items of a Stream
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_53openalex-snapshot
Counting Arbitrary Subgraphs in Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_26openalex-snapshot
Space-Constrained Interval Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_20openalex-snapshot
Maximum Matching in Semi-streaming with Few Passes
inferred← citeshttps://doi.org/10.1007/978-3-642-32524-3_18openalex-snapshot
Data Science and Distributed Intelligence: Recent Developments and Future Insights
inferred← citeshttps://doi.org/10.1007/978-3-642-33783-3_45openalex-snapshot
Streaming Hierarchical Video Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_15openalex-snapshot
Efficient Protocols for Distributed Classification and Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_5openalex-snapshot
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_12openalex-snapshot
On the Value of Multiple Read/Write Streams for Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_56openalex-snapshot
How to Catch L 2-Heavy-Hitters on Sliding Windows
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_15openalex-snapshot
Software Streams: Big Data Challenges in Dynamic Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_45openalex-snapshot
Arthur-Merlin Streaming Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_48openalex-snapshot
On Model-Based RIP-1 Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_8openalex-snapshot
Efficient Sampling of Non-strict Turnstile Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_4openalex-snapshot
Approximating Large Frequency Moments with Pick-and-Drop Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_43openalex-snapshot
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
inferred← citeshttps://doi.org/10.1007/978-3-642-40988-2_41openalex-snapshot
Continuous Similarity Computation over Streaming Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_49openalex-snapshot
Nearly Linear-Time Model-Based Compressive Sensing
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_76openalex-snapshot
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-44980-6_11openalex-snapshot
Collecting Valuable Information from Fast Text Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_34openalex-snapshot
On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_78openalex-snapshot
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_70openalex-snapshot
Maximum Matching in Turnstile Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_2openalex-snapshot
Regular Programming for Quantitative Properties of Data Streams
inferred← citeshttps://doi.org/10.1007/978-981-95-5096-8_6openalex-snapshot
Adversary Resilient Learned Bloom Filters
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_10openalex-snapshot
Streaming Algorithms for Products of Probabilities
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_4openalex-snapshot
Sublinear Algorithms for Scheduling with Chain Precedence Constraints
inferred← citeshttps://doi.org/10.1007/s00180-026-01756-0openalex-snapshot
Efficient online estimation for nonparametric regression models with streaming data
inferred← citeshttps://doi.org/10.1007/s00224-008-9137-7openalex-snapshot
Database Query Processing Using Finite Cursor Machines
inferred← citeshttps://doi.org/10.1007/s00224-009-9235-1openalex-snapshot
Small Space Representations for Metric Min-sum k-Clustering and Their Applications
inferred← citeshttps://doi.org/10.1007/s00224-017-9841-2openalex-snapshot
Space Efficient Linear Time Algorithms for BFS, DFS and Applications
inferred← citeshttps://doi.org/10.1007/s00224-020-09966-9openalex-snapshot
Longest Increasing Subsequence under Persistent Comparison Errors
inferred← citeshttps://doi.org/10.1007/s00224-020-10011-yopenalex-snapshot
Streaming Algorithms for Bin Packing and Vector Scheduling
inferred← citeshttps://doi.org/10.1007/s00446-024-00470-8openalex-snapshot
Deterministic Near-Optimal Distributed Listing of Cliques
inferred← citeshttps://doi.org/10.1007/s00450-011-0178-9openalex-snapshot
Efficient monitoring of personalized hot news over Web 2.0 streams
inferred← citeshttps://doi.org/10.1007/s00453-011-9556-8openalex-snapshot
Bipartite Matching in the Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/s00453-013-9772-5openalex-snapshot
Approximately Uniform Online Checkpointing with Bounded Memory
inferred← citeshttps://doi.org/10.1007/s00453-014-9917-1openalex-snapshot
A General Method for Estimating Correlated Aggregates Over a Data Stream
inferred← citeshttps://doi.org/10.1007/s00453-015-0036-4openalex-snapshot
Triangle Counting in Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1007/s00453-015-0051-5openalex-snapshot
Streaming Algorithms for Independent Sets in Sparse Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0521-7openalex-snapshot
Streaming Pattern Matching with d Wildcards
inferred← citeshttps://doi.org/10.1007/s00453-019-00644-yopenalex-snapshot
On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms
inferred← citeshttps://doi.org/10.1007/s00453-022-00988-yopenalex-snapshot
Almost-Smooth Histograms and Sliding-Window Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-024-01231-6openalex-snapshot
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
inferred← citeshttps://doi.org/10.1007/s00453-024-01272-xopenalex-snapshot
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
inferred← citeshttps://doi.org/10.1007/s00454-006-1269-4openalex-snapshot
Range Counting over Multidimensional Data Streams
inferred← citeshttps://doi.org/10.1007/s00454-008-9132-4openalex-snapshot
Streaming Algorithms for Line Simplification
inferred← citeshttps://doi.org/10.1007/s00521-010-0402-8openalex-snapshot
On-line learning from streaming data with delayed attributes: a comparison of classifiers and strategies
inferred← citeshttps://doi.org/10.1007/s00521-019-04672-1openalex-snapshot
The hybrid ant colony optimization and ensemble method for solving the data stream e-mail foldering problem
inferred← citeshttps://doi.org/10.1007/s00778-009-0171-0openalex-snapshot
Sliding-window top-k queries on uncertain streams
inferred← citeshttps://doi.org/10.1007/s00778-011-0229-7openalex-snapshot
UpStream: storage-centric load management for streaming applications with update semantics
inferred← citeshttps://doi.org/10.1007/s00778-015-0380-7openalex-snapshot
Sketching distributed sliding-window data streams
inferred← citeshttps://doi.org/10.1007/s00778-019-00560-1openalex-snapshot
Fast and accurate stream processing by filtering the cold
inferred← citeshttps://doi.org/10.1007/s00778-021-00679-0openalex-snapshot
A fractional memory-efficient approach for online continuous-time influence maximization
inferred← citeshttps://doi.org/10.1007/s00778-024-00856-xopenalex-snapshot
Parallelization of butterfly counting on hierarchical memory
inferred← citeshttps://doi.org/10.1007/s10100-025-01009-3openalex-snapshot
Product relation correlation and its use in product clustering
inferred← citeshttps://doi.org/10.1007/s10107-022-01858-9openalex-snapshot
Semi-streaming algorithms for submodular matroid intersection
inferred← citeshttps://doi.org/10.1007/s10115-010-0338-4openalex-snapshot
Recommending items in pervasive scenarios: models and experimental analysis
inferred← citeshttps://doi.org/10.1007/s10115-013-0669-zopenalex-snapshot
A general streaming algorithm for pattern discovery
inferred← citeshttps://doi.org/10.1007/s10115-014-0733-3openalex-snapshot
STenSr: Spatio-temporal tensor streams for anomaly detection and pattern discovery
inferred← citeshttps://doi.org/10.1007/s10115-017-1060-2openalex-snapshot
Event stream-based process discovery using abstract representations
inferred← citeshttps://doi.org/10.1007/s10115-018-1183-0openalex-snapshot
Data summarization: a survey
inferred← citeshttps://doi.org/10.1007/s10208-009-9057-1openalex-snapshot
Combinatorial Sublinear-Time Fourier Algorithms
inferred← citeshttps://doi.org/10.1007/s10489-021-02614-wopenalex-snapshot
AFQN: approximate Qn estimation in data streams
inferred← citeshttps://doi.org/10.1007/s10586-019-03002-3openalex-snapshot
Network Reconfiguration Algorithm (NRA) for scheduling communication-intensive graphs in heterogeneous computing environment
inferred← citeshttps://doi.org/10.1007/s10619-010-7067-2openalex-snapshot
Cardinality estimation and dynamic length adaptation for Bloom filters
inferred← citeshttps://doi.org/10.1007/s10619-012-7105-3openalex-snapshot
Data-intensive architecture for scientific knowledge discovery
inferred← citeshttps://doi.org/10.1007/s10773-019-04209-1openalex-snapshot
Quantum Online Streaming Algorithms with Logarithmic Memory
inferred← citeshttps://doi.org/10.1007/s10878-021-00827-wopenalex-snapshot
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
inferred← citeshttps://doi.org/10.1007/s10898-012-9932-1openalex-snapshot
From approximate balls to approximate ellipses
inferred← citeshttps://doi.org/10.1007/s10898-019-00840-8openalex-snapshot
Non-submodular maximization on massive data streams
inferred← citeshttps://doi.org/10.1007/s10922-011-9200-6openalex-snapshot
Lightweight and Informative Traffic Metrics for Data Center Monitoring
inferred← citeshttps://doi.org/10.1007/s10958-016-3019-3openalex-snapshot
Dilemmas of Robust Analysis of Economic Data Streams*
inferred← citeshttps://doi.org/10.1007/s10994-013-5408-xopenalex-snapshot
Adaptively learning probabilistic deterministic automata from data streams
inferred← citeshttps://doi.org/10.1007/s11075-025-02101-0openalex-snapshot
Fast and low-memory compressive sensing algorithms for low tucker-rank tensor approximation from streamed measurements
inferred← citeshttps://doi.org/10.1007/s11222-011-9293-5openalex-snapshot
Statistical estimation with bounded memory
inferred← citeshttps://doi.org/10.1007/s11222-015-9608-zopenalex-snapshot
Random projections for Bayesian regression
inferred← citeshttps://doi.org/10.1007/s11280-011-0125-5openalex-snapshot
Distributed processing of continuous sliding-window k-NN queries for data stream filtering
inferred← citeshttps://doi.org/10.1007/s12065-025-01079-xopenalex-snapshot
Datastreams and beyond, from traditional approaches to quantum: a comprehensive survey
inferred← citeshttps://doi.org/10.1007/s12243-020-00808-wopenalex-snapshot
Interconnect bypass fraud detection: a case study
inferred← citeshttps://doi.org/10.1007/s12530-010-9020-zopenalex-snapshot
Finding top-k elements in a time-sliding window
inferred← citeshttps://doi.org/10.1007/s12572-013-0078-2openalex-snapshot
In-network estimation of frequency moments
inferred← citeshttps://doi.org/10.1007/s13748-011-0002-6openalex-snapshot
A survey on learning from data streams: current and future trends
showing the first 200 of 714 · page through all 714
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.