Probabilistic counters for privacy preserving data aggregation
From MaRDI portal
Cites work
- \(q\)-distributions and Markov processes
- Applying approximate counting for computing the frequency moments of long data streams
- Approximate counting via the Poisson-Laplace-Mellin method
- Approximate counting with a floating-point counter
- Approximate counting: a detailed analysis
- Counting large numbers of events in small registers
- Differential Privacy
- Differential privacy and robust statistics
- Differential privacy under continual observation
- scientific article; zbMATH DE number 5763313 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- LogLog counting of large cardinalities (extended abstract)
- On the expectation of the maximum of IID geometric random variables
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Outline of a Theory of Statistical Estimation Based on the Classical Theory of Probability
- Probabilistic counting algorithms for data base applications
- Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
- Space/time trade-offs in hash coding with allowable errors
- Stable distributions, pseudorandom generators, embeddings and data stream computation
- The algorithmic foundations of differential privacy
- The space complexity of approximating the frequency moments
- Theory of Cryptography
- Tight lower bounds for the distinct elements problem
- Yet another application of a binomial recurrence. Order statistics
This page was built for publication: Probabilistic counters for privacy preserving data aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300020)
