Sublinear space graph algorithms in the continual release model
From MaRDI portal
Cites work
- A multiplicative weights mechanism for privacy-preserving data analysis
- A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs
- A two-pass (conditional) lower bound for semi-streaming maximum matching
- A unifying framework for differentially private sums under continual observation
- An auction algorithm for bipartite matching in streaming and massively parallel computation models
- Analyzing graphs with node differential privacy
- Approximating the Caro-Wei bound for independent sets in graph streams
- Boosting and differential privacy
- Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
- Counting large numbers of events in small registers
- Data Streams: Algorithms and Applications
- Densest subgraph in dynamic graph streams
- Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond
- Differential privacy and robust statistics
- Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs
- Differential privacy under continual observation
- Differentially private Continual releases of streaming frequency moment estimations
- Dynamic graph stream algorithms in \(o(n)\) space
- Estimating the number of connected components in sublinear time
- How to make your approximation algorithm private: a black-box differentially-private transformation for tunable approximation algorithms of functions with low sensitivity
- scientific article; zbMATH DE number 5485439 (Why is no real title available?)
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 7740897 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Interactive privacy via the median mechanism
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism
- Low-memory algorithms for online edge coloring
- Lower bounds in differential privacy
- On differential privacy and adaptive data analysis with bounded space
- On graph problems in a semi-streaming model
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Optimal bounds on private graph approximation
- Privately estimating graph parameters in sublinear time
- Probabilistic counting algorithms for data base applications
- Random projections, graph sparsification, and differential privacy
- Semi-streaming bipartite matching in fewer passes and optimal space
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Streaming algorithms for independent sets in sparse hypergraphs
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
- The algorithmic foundations of differential privacy
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- Theory of Cryptography
- Triangle counting with local edge differential privacy
This page was built for publication: Sublinear space graph algorithms in the continual release model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346870)
