SuLQ - MaRDI portal

swMATH11355MaRDI QIDQ23301FDOQ23301

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

PCPs and the hardness of generating synthetic data
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
Large Margin Multiclass Gaussian Classification with Differential Privacy
Homological product codes
Breaking the minsky-papert barrier for constant-depth circuits
Learning privately with labeled and unlabeled examples
On the Complexity of Random Satisfiability Problems with Planted Solutions
Fingerprinting Codes and the Price of Approximate Differential Privacy
Online local learning via semidefinite programming
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
Turnstile streaming algorithms might as well be linear sketches
Testing surface area with arbitrary accuracy
Title not available (Why is that?)
Constant rank bimatrix games are PPAD-hard
Answering \(n^2+o(1)\) counting queries with differential privacy is hard
Cluster before you hallucinate
From hierarchical partitions to hierarchical covers
Competitive algorithms from competitive equilibria
On derandomizing algorithms that err extremely rarely
Private matchings and allocations
Title not available (Why is that?)
Infinite randomness expansion with a constant number of devices
Estimation of Wasserstein distances in the spiked transport model
A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation
Differentially-private learning of low dimensional manifolds
Principal component analysis in the local differential privacy model
Zig-zag sort
From average case complexity to improper learning complexity
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
The average sensitivity of an intersection of half spaces
Fourier PCA and robust tensor decomposition
Deciding First-Order Properties of Nowhere Dense Graphs
On the existence of extractable one-way functions
Selling privacy at auction
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
Distributed approximation algorithms for weighted shortest paths
Formulas vs. circuits for small distance connectivity
Solving SDD linear systems in nearly m log ^1/2 n time
Generalized bucketization scheme for flexible privacy settings
Embedding and canonizing graphs of bounded genus in logspace
Optimal error rates for interactive coding I
The sample complexity of revenue maximization
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Smoothed analysis of tensor decompositions
L _p -testing
The Matching Polytope has Exponential Extension Complexity
Oblivious sampling with applications to two-party \(k\)-means clustering
Finite Sample Differentially Private Confidence Intervals
Query complexity of approximate nash equilibria
The Complexity of Differential Privacy
Efficient density estimation via piecewise polynomial approximation
Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
Hitting sets for multilinear read-once algebraic branching programs, in any order
Polynomial bounds for the grid-minor theorem
Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
Analyze gauss
Fingerprinting codes and the price of approximate differential privacy
Approximate distance oracles with constant query time
Privacy-preserving data aggregation with probabilistic range validation
Breaking the quadratic barrier for 3-LCC's over the reals
Communication lower bounds via critical block sensitivity
Primal beats dual on online packing LPs in the random-order model
Lower bounds for depth 4 formulas computing iterated matrix multiplication
A characterization of strong approximation resistance
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
Entropy, optimization and counting
A complete characterization of statistical query learning with applications to evolvability
New algorithms and lower bounds for circuits with linear threshold gates
A characterization of locally testable affine-invariant properties via decomposition theorems
A super-polynomial lower bound for regular arithmetic formulas
How to delegate computations
Pseudorandom generators with optimal seed length for non-boolean poly-size circuits
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
Economic efficiency requires interaction
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
A strongly polynomial algorithm for generalized flow maximization
Analytical approach to parallel repetition
Coin flipping of any constant bias implies one-way functions
The asymptotic k-SAT threshold
Optimal CUR Matrix Decompositions
Title not available (Why is that?)
Satisfiability threshold for random regular NAE-SAT
Distributed computability in Byzantine asynchronous systems
Faster all-pairs shortest paths via circuit complexity
Title not available (Why is that?)
Order-Revealing Encryption and the Hardness of Private Learning
Strong Hardness of Privacy from Weak Traitor Tracing
How to use indistinguishability obfuscation
Computing with a full memory
Non-malleable codes from additive combinatorics
The Power of Localization for Efficiently Learning Linear Separators with Noise
Constant factor approximation for balanced cut in the PIE model
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
Every list-decodable code for high noise has abundant near-optimal rate puncturings
Bandits with switching costs
Minimum bisection is fixed parameter tractable
Differential Privacy: A Survey of Results
Bounds on the sample complexity for private learning and private data release
Community detection thresholds and the weak Ramanujan property
A distributed protocol for privacy preserving aggregation with non-permanent participants

This page was built for software: SuLQ