On the public citation graph
Algorithms for dynamic geometric problems over data streams
0 signed · 118 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-48224-5_16openalex-snapshot
Approximating the Minimum Spanning Tree Weight in Sublinear Time
inferredcites →https://doi.org/10.1007/bf02579435openalex-snapshot
An analysis of the greedy algorithm for the submodular set covering problem
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/0304-3975(80)90061-4openalex-snapshot
Selection and sorting with limited storage
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.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1998.743488openalex-snapshot
Approximating a finite metric by a small number of tree metrics
inferredcites →https://doi.org/10.1109/sfcs.2000.892082openalex-snapshot
Stable distributions, pseudorandom generators, embeddings and data stream computation
inferredcites →https://doi.org/10.1137/s0097539702416402openalex-snapshot
Local Search Heuristics for k -Median and Facility Location Problems
inferredcites →https://doi.org/10.1145/1007352.1007386openalex-snapshot
Estimating the weight of metric minimum spanning trees in sublinear-time
inferredcites →https://doi.org/10.1145/1007352.1007400openalex-snapshot
On coresets for k-means and k-median clustering
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/276698.276877openalex-snapshot
Efficient search for approximate nearest neighbor in high dimensional spaces
inferredcites →https://doi.org/10.1145/380752.380755openalex-snapshot
Local search heuristic for k-median and facility location problems
inferredcites →https://doi.org/10.1145/509907.509965openalex-snapshot
Similarity estimation techniques from rounding algorithms
inferredcites →https://doi.org/10.1145/509907.509966openalex-snapshot
Fast, small-space algorithms for approximate histogram maintenance
inferredcites →https://doi.org/10.1145/780542.780548openalex-snapshot
Better streaming algorithms for clustering problems
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470175668.ch8openalex-snapshot
Algorithms for Data Streams
inferred← citeshttps://doi.org/10.1007/11672142_50openalex-snapshot
Memoryless Facility Location in One Pass
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_180openalex-snapshot
Geometric Stream Mining
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_13openalex-snapshot
A Survey on Streaming Algorithms for Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_180openalex-snapshot
Geometric Stream Mining
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_180-2openalex-snapshot
Geometric Stream Mining
inferred← citeshttps://doi.org/10.1007/978-3-032-38887-2_2openalex-snapshot
Data Stream Algorithms Unplugged
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_14openalex-snapshot
Stable Distributions in Streaming Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_3openalex-snapshot
Streaming Algorithms for Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_34openalex-snapshot
The Kinetic Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_46openalex-snapshot
Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
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-87744-8_55openalex-snapshot
Facility Location in Dynamic Geometric Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_68openalex-snapshot
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_42openalex-snapshot
Streaming Embeddings with Slack
inferred← citeshttps://doi.org/10.1007/978-3-642-21153-9_21openalex-snapshot
Clustering Moving Object Trajectories Using Coresets
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/s00224-009-9235-1openalex-snapshot
Small Space Representations for Metric Min-sum k-Clustering and Their Applications
inferred← citeshttps://doi.org/10.1007/s00778-007-0081-yopenalex-snapshot
Approximate voronoi cell computation on spatial data streams
inferred← citeshttps://doi.org/10.1007/s10915-020-01143-xopenalex-snapshot
No-Collision Transportation Maps
inferred← citeshttps://doi.org/10.1007/s11390-006-0284-5openalex-snapshot
Efficient Computation of k-Medians over Data Streams Under Memory Constraints
inferred← citeshttps://doi.org/10.1007/springerreference_63315openalex-snapshot
Geometric Stream Mining
inferred← citeshttps://doi.org/10.1109/access.2020.2974919openalex-snapshot
A Survey of Approximate Quantile Computation on Large-Scale Data
inferred← citeshttps://doi.org/10.1109/allerton.2010.5707127openalex-snapshot
Sparse recovery for Earth Mover Distance
inferred← citeshttps://doi.org/10.1109/focs.2009.25openalex-snapshot
Efficient Sketches for Earth-Mover Distance, with Applications
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00116openalex-snapshot
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00050openalex-snapshot
Streaming Facility Location in High Dimension via Geometric Hashing
inferred← citeshttps://doi.org/10.1109/icde.2007.368962openalex-snapshot
Conquering the Divide: Continuous Clustering of Distributed Data Streams
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00090openalex-snapshot
k-Center Clustering with Outliers in the MPC and Streaming Model
inferred← citeshttps://doi.org/10.1137/1.9781611973075.93openalex-snapshot
On the Exact Space Complexity of Sketching and Streaming Small Norms
inferred← citeshttps://doi.org/10.1137/1.9781611973099.38openalex-snapshot
Width of Points in the Streaming Model
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch24openalex-snapshot
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch95openalex-snapshot
Clustering Problems on Sliding Windows
inferred← citeshttps://doi.org/10.1137/1.9781611977073.117openalex-snapshot
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
inferred← citeshttps://doi.org/10.1137/s0097539703435297openalex-snapshot
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
inferred← citeshttps://doi.org/10.1145/1060590.1060622openalex-snapshot
Coresets in dynamic geometric data streams
inferred← citeshttps://doi.org/10.1145/1064092.1064116openalex-snapshot
Sampling in dynamic data streams and applications
inferred← citeshttps://doi.org/10.1145/1066157.1066227openalex-snapshot
Fast and approximate stream mining of quantiles and frequencies using graphics processors
inferred← citeshttps://doi.org/10.1145/1109557.1109637openalex-snapshot
Streaming and sublinear approximation of entropy and information distances
inferred← citeshttps://doi.org/10.1145/1147954.1147955openalex-snapshot
Stable distributions, pseudorandom generators, embeddings, and data stream computation
inferred← citeshttps://doi.org/10.1145/1265530.1265565openalex-snapshot
Estimating statistical aggregates on probabilistic data streams
inferred← citeshttps://doi.org/10.1145/1376916.1376928openalex-snapshot
Estimating PageRank on graph streams
inferred← citeshttps://doi.org/10.1145/1376916.1376944openalex-snapshot
Approximation algorithms for clustering uncertain data
inferred← citeshttps://doi.org/10.1145/1412331.1412338openalex-snapshot
Estimating statistical aggregates on probabilistic data streams
inferred← citeshttps://doi.org/10.1145/1559795.1559819openalex-snapshot
Space-optimal heavy hitters with strong error bounds
inferred← citeshttps://doi.org/10.1145/1559795.1559820openalex-snapshot
Optimal tracking of distributed heavy hitters and quantiles
inferred← citeshttps://doi.org/10.1145/1807085.1807094openalex-snapshot
An optimal algorithm for the distinct elements problem
inferred← citeshttps://doi.org/10.1145/1862919.1862923openalex-snapshot
Space-optimal heavy hitters with strong error bounds
inferred← citeshttps://doi.org/10.1145/1921659.1921667openalex-snapshot
Algorithms for distributed functional monitoring
inferred← citeshttps://doi.org/10.1145/1959045.1959065openalex-snapshot
Online and incremental algorithms for facility location
inferred← citeshttps://doi.org/10.1145/1970392.1970397openalex-snapshot
Estimating PageRank on graph streams
inferred← citeshttps://doi.org/10.1145/1993636.1993720openalex-snapshot
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
inferred← citeshttps://doi.org/10.1145/2000807.2000817openalex-snapshot
Memoryless facility location in one pass
inferred← citeshttps://doi.org/10.1145/2213556.2213595openalex-snapshot
Rectangle-efficient aggregation in spatial data streams
inferred← citeshttps://doi.org/10.1145/2591796.2591805openalex-snapshot
Parallel algorithms for geometric graph problems
inferred← citeshttps://doi.org/10.1145/2847259openalex-snapshot
Width of Points in the Streaming Model
inferred← citeshttps://doi.org/10.1145/3196959.3196986openalex-snapshot
Data Streams with Bounded Deletions
inferred← citeshttps://doi.org/10.1145/3519935.3519979openalex-snapshot
New streaming algorithms for high dimensional EMD and MST
inferred← citeshttps://doi.org/10.1145/3564246.3585168openalex-snapshot
Streaming Euclidean MST to a Constant Factor
inferred← citeshttps://doi.org/10.1145/3564246.3585170openalex-snapshot
Streaming Euclidean Max-Cut: Dimension vs Data Reduction
inferred← citeshttps://doi.org/10.1145/3618260.3649629openalex-snapshot
Approximate Earth Mover’s Distance in Truly-Subquadratic Time
inferred← citeshttps://doi.org/10.1145/3618260.3649666openalex-snapshot
Data-Dependent LSH for the Earth Mover’s Distance
inferred← citeshttps://doi.org/10.1145/3651145openalex-snapshot
Streaming Algorithms with Few State Changes
inferred← citeshttps://doi.org/10.1145/3663666openalex-snapshot
Streaming Algorithms for Geometric Steiner Forest
inferred← citeshttps://doi.org/10.14778/3450980.3450990openalex-snapshot
KLL ± approximate quantile sketches over dynamic datasets
inferred← citeshttps://doi.org/10.1561/0400000002openalex-snapshot
Data Streams: Algorithms and Applications
inferred← citeshttps://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferred← citeshttps://doi.org/10.17877/de290r-8506openalex-snapshot
Approximation Techniques for Facility Location and Their Applications in Metric Embeddings
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2018.19openalex-snapshot
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.350openalex-snapshot
Clustering on Sliding Windows in Polylogarithmic Space
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.428openalex-snapshot
Polynomial Fitting of Data Streams with Applications to Codeword Testing
inferred← citeshttps://doi.org/10.48550/arxiv.0812.0209openalex-snapshot
Optimal Tracking of Distributed Heavy Hitters and Quantiles
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4510openalex-snapshot
Differentially Private Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1371openalex-snapshot
On Privacy-Preserving Histograms
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5781openalex-snapshot
PROBI: A Heuristic for the probabilistic k-median problem
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0042openalex-snapshot
Parallel Algorithms for Geometric Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6287openalex-snapshot
Improved Approximation Algorithms for Earth-Mover Distance in Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05553openalex-snapshot
A Unified Approach for Clustering Problems on Sliding Windows
inferred← citeshttps://doi.org/10.48550/arxiv.1706.03887openalex-snapshot
Clustering High Dimensional Dynamic Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00459openalex-snapshot
Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data
inferred← citeshttps://doi.org/10.48550/arxiv.1803.06875openalex-snapshot
On the streaming complexity of fundamental geometric problems
inferred← citeshttps://doi.org/10.48550/arxiv.1807.03839openalex-snapshot
Online Facility Location with Deletions
inferred← citeshttps://doi.org/10.48550/arxiv.1810.10046openalex-snapshot
Approximating the Quadratic Transportation Metric in Near-Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0509074openalex-snapshot
Planar Earthmover is not in $L_1$
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612031openalex-snapshot
Estimating Aggregate Properties on Probabilistic Streams
inferred← citeshttps://doi.org/10.5281/zenodo.4586932openalex-snapshot
Fully Dynamic Consistent Facility Location
inferred← citeshttps://doi.org/10.5555/1109557.1109687openalex-snapshot
On k-Median clustering in high dimensions
inferred← citeshttps://doi.org/10.5555/2095116.2095154openalex-snapshot
Width of points in the streaming model
inferred← citeshttps://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements
inferred← citeshttps://doi.org/10.5555/2884435.2884459openalex-snapshot
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
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.