The following pages link to SuLQ (Q23301):
Displayed 50 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- A distributed protocol for privacy preserving aggregation with non-permanent participants (Q497109) (← links)
- Optimal data-independent noise for differential privacy (Q497639) (← links)
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy (Q1950328) (← links)
- Generalized bucketization scheme for flexible privacy settings (Q1991860) (← links)
- Privacy-preserving data aggregation with probabilistic range validation (Q2117046) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- Principal component analysis in the local differential privacy model (Q2290637) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Selling privacy at auction (Q2347786) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- Estimation of Wasserstein distances in the spiked transport model (Q2676937) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard (Q2805511) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Large Margin Multiclass Gaussian Classification with Differential Privacy (Q3003503) (← links)
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) (← links)
- Communication is Bounded by Root of Rank (Q3177758) (← links)
- Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807) (← links)
- Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices (Q3177810) (← links)
- The Power of Localization for Efficiently Learning Linear Separators with Noise (Q3177877) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Differential Privacy: A Survey of Results (Q3502629) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Asymptotically Optimal and Private Statistical Estimation (Q3648464) (← links)
- Fingerprinting Codes and the Price of Approximate Differential Privacy (Q4554072) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation (Q4631259) (← links)
- Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- Finite Sample Differentially Private Confidence Intervals (Q4993312) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- (Q5159461) (← links)
- (Q5214179) (← links)
- Fingerprinting codes and the price of approximate differential privacy (Q5259533) (← links)
- Analyze gauss (Q5259534) (← links)
- Private matchings and allocations (Q5259535) (← links)
- Rounding sum-of-squares relaxations (Q5259536) (← links)
- Constant factor approximation for balanced cut in the PIE model (Q5259537) (← links)
- Entropy, optimization and counting (Q5259538) (← links)