SuLQ
From MaRDI portal
Cited in
(only showing first 100 items - show all)- RAPPOR
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Generalized bucketization scheme for flexible privacy settings
- Privacy-preserving data aggregation with probabilistic range validation
- Oblivious sampling with applications to two-party k-means clustering
- PCPs and the hardness of generating synthetic data
- Learning privately with labeled and unlabeled examples
- Bounds on the sample complexity for private learning and private data release
- Principal component analysis in the local differential privacy model
- PrivateLR
- Statistical active learning algorithms for noise tolerance and differential privacy
- Selling privacy at auction
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Estimation of Wasserstein distances in the spiked transport model
- Order-revealing encryption and the hardness of private learning
- Answering n^2+o(1) counting queries with differential privacy is hard
- Large margin multiclass Gaussian classification with differential privacy
- Strong hardness of privacy from weak traitor tracing
- Bounds on the sample complexity for private learning and private data release
- LightDP
- Sample complexity bounds on differentially private learning via communication complexity
- Differential Privacy: A Survey of Results
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Asymptotically Optimal and Private Statistical Estimation
- A complete characterization of statistical query learning with applications to evolvability
- Fingerprinting codes and the price of approximate differential privacy
- On the complexity of random satisfiability problems with planted solutions
- A generalized approach for social network integration and analysis with privacy preservation
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- Optimal data-independent noise for differential privacy
- Finite sample differentially private confidence intervals
- The complexity of differential privacy
- Locally private \(k\)-means clustering
- Simultaneous private learning of multiple concepts
- Fingerprinting codes and the price of approximate differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Private matchings and allocations
- Rounding sum-of-squares relaxations
- Constant factor approximation for balanced cut in the PIE model
- Entropy, optimization and counting
- Polynomial bounds for the grid-minor theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- On derandomizing algorithms that err extremely rarely
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- The limits of depth reduction for arithmetic formulas
- A super-polynomial lower bound for regular arithmetic formulas
- A characterization of locally testable affine-invariant properties via decomposition theorems
- L_p-testing
- Turnstile streaming algorithms might as well be linear sketches
- Linear time construction of compressed text indices in compact space
- Formulas vs. circuits for small distance connectivity
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Economic efficiency requires interaction
- The sample complexity of revenue maximization
- Optimal competitive auctions
- Homological product codes
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Primal beats dual on online packing LPs in the random-order model
- Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
- Minimum bisection is fixed parameter tractable
- An efficient parallel solver for SDD linear systems
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
- Shortest paths on polyhedral surfaces and terrains
- Embedding and canonizing graphs of bounded genus in logspace
- Testing surface area with arbitrary accuracy
- Coin flipping of any constant bias implies one-way functions
- Infinite randomness expansion with a constant number of devices
- The average sensitivity of an intersection of half spaces
- From average case complexity to improper learning complexity
- Bandits with switching costs, \(T^{2/3}\) regret
- Online local learning via semidefinite programming
- How to use indistinguishability obfuscation
- How to delegate computations
- Circuits resilient to additive attacks with applications to secure computation
- On the existence of extractable one-way functions
- Black-box non-black-box zero knowledge
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- Query complexity of approximate nash equilibria
- Constant rank bimatrix games are PPAD-hard
- Approximation algorithms for bipartite matching with metric and geometric costs
- Distributed approximation algorithms for weighted shortest paths
- Parallel algorithms for geometric graph problems
- Fourier PCA and robust tensor decomposition
- Smoothed analysis of tensor decompositions
- Efficient density estimation via piecewise polynomial approximation
- Analytical approach to parallel repetition
- A characterization of strong approximation resistance
- A strongly polynomial algorithm for generalized flow maximization
- Approximate distance oracles with constant query time
- Faster all-pairs shortest paths via circuit complexity
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- Zig-zag sort
- Community detection thresholds and the weak Ramanujan property
- Distributed computability in Byzantine asynchronous systems
- Multiway cut, pairwise realizable distributions, and descending thresholds
This page was built for software: SuLQ
