scientific article; zbMATH DE number 1256715
From MaRDI portal
Publication:4228450
zbMATH Open0922.68057MaRDI QIDQ4228450FDOQ4228450
Authors: Noga Alon, Y. Matias, Mario Szegedy 
Publication date: 4 October 1999
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Theory of data (68P99)
Cited In (57)
- The geometric median and applications to robust mean estimation
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Arithmetic sketching
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
- Streaming Euclidean MST to a constant factor
- Streaming algorithms for language recognition problems
- Robust modifications of U-statistics and applications to covariance estimation problems
- Fast sketch-based recovery of correlation outliers
- Linked-tree: An aggregate query algorithm based on sliding window over data stream
- In-network estimation of frequency moments
- Querying a Matrix Through Matrix-Vector Products.
- The space complexity of approximating the frequency moments
- Arthur-Merlin streaming complexity
- Solvable integration problems and optimal sample size selection
- Optimal sampling from sliding windows
- Regular Programming for Quantitative Properties of Data Streams
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices
- Dynamic graph stream algorithms in \(o(n)\) space
- Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- Using invariants to change detection in dynamical system with chaos
- Property-preserving hash functions for Hamming distance from standard assumptions
- Tracking the l_2 Norm with Constant Update Time
- Large-scale distributed algorithms for facility location with outliers
- Counting distinct items over update streams
- Title not available (Why is that?)
- Optimal confidence for Monte Carlo integration of smooth functions
- A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space
- The price of validity in dynamic networks
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Nearly optimal robust mean estimation via empirical characteristic function
- Using invariants to determine change detection in dynamical system with chaos
- Applying approximate counting for computing the frequency moments of long data streams
- Give me some slack: efficient network measurements
- Lower bounds for approximating graph parameters via communication complexity
- Uniformity of point samples in metric spaces using gap ratio
- Adversarially robust property-preserving hash functions
- Efficient transformations for Klee's measure problem in the streaming model
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Near-optimal clustering in the \(k\)-machine model
- Sleeping on the job: energy-efficient and robust broadcast for radio networks
- Tight bounds for single-pass streaming complexity of the set cover problem
- The online space complexity of probabilistic languages
- Revisiting frequency moment estimation in random order streams
- Robust and efficient mean estimation: an approach based on the properties of self-normalized sums
- Geometric median and robust estimation in Banach spaces
- On sketching the \(q\) to \(p\) norms
- The cost of fault tolerance in multi-party communication complexity
- Distributed statistical estimation and rates of convergence in normal approximation
- Fast estimation of fractal dimension and correlation integral on stream data
- Streaming low-rank matrix approximation with an application to scientific simulation
- Robust and scalable Bayes via a median of subset posterior measures
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- Summarizing numeric spatial data streams by trend cluster discovery
- Approximate set union via approximate randomization
- Towards Optimal Moment Estimation in Streaming and Distributed Models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228450)
