Publication:4228450
From MaRDI portal
zbMath0922.68057MaRDI QIDQ4228450
Mario Szegedy, Yossi Matias, Noga Alon
Publication date: 4 October 1999
68Q25: Analysis of algorithms and problem complexity
68P99: Theory of data
68W20: Randomized algorithms
Related Items
Unnamed Item, Robust and Scalable Bayes via a Median of Subset Posterior Measures, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem, Querying a Matrix Through Matrix-Vector Products., Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation, The Online Space Complexity of Probabilistic Languages, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, Approximate set union via approximate randomization, Towards Optimal Moment Estimation in Streaming and Distributed Models, Tracking the l_2 Norm with Constant Update Time, Towards Optimal Moment Estimation in Streaming and Distributed Models, Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams., Geometric median and robust estimation in Banach spaces, Streaming algorithms for language recognition problems, Optimal sampling from sliding windows, In-network estimation of frequency moments, A fast output-sensitive algorithm for Boolean matrix multiplication, Sleeping on the job: energy-efficient and robust broadcast for radio networks, Fast estimation of fractal dimension and correlation integral on stream data, On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices, The price of validity in dynamic networks, Efficient transformations for Klee's measure problem in the streaming model, Using invariants to determine change detection in dynamical system with chaos, New bounds for the CLIQUE-GAP problem using graph decomposition theory, Summarizing numeric spatial data streams by trend cluster discovery, Dynamic graph stream algorithms in \(o(n)\) space, Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries, Solvable integration problems and optimal sample size selection, Nearly optimal robust mean estimation via empirical characteristic function, Near-optimal clustering in the \(k\)-machine model, Robust and efficient mean estimation: an approach based on the properties of self-normalized sums, Property-preserving hash functions for Hamming distance from standard assumptions, Give me some slack: efficient network measurements, Robust modifications of U-statistics and applications to covariance estimation problems, Distributed statistical estimation and rates of convergence in normal approximation, Optimal confidence for Monte Carlo integration of smooth functions, Arthur-Merlin streaming complexity, Counting distinct items over update streams, Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks, Using invariants to change detection in dynamical system with chaos, Regular Programming for Quantitative Properties of Data Streams, New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory, Unnamed Item, The Cost of Fault Tolerance in Multi-Party Communication Complexity, Linked-tree: An aggregate query algorithm based on sliding window over data stream
