SuLQ

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
• Sample complexity bounds on differentially private learning via communication complexity
• Learning privately with labeled and unlabeled examples
• A generalized approach for social network integration and analysis with privacy preservation
• Simultaneous private learning of multiple concepts
• Online local learning via semidefinite programming
• Fingerprinting codes and the price of approximate differential privacy
• Turnstile streaming algorithms might as well be linear sketches
• Testing surface area with arbitrary accuracy
• Breaking the Minsky-Papert barrier for constant-depth circuits
• Answering \(n^2+o(1)\) counting queries with differential privacy is hard
• Private matchings and allocations
• Estimation of Wasserstein distances in the spiked transport model
• Differentially-private learning of low dimensional manifolds
• Principal component analysis in the local differential privacy model
• Private learning and sanitization: pure vs. approximate differential privacy
• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
• Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
• Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
• The average sensitivity of an intersection of half spaces
• On the complexity of random satisfiability problems with planted solutions
• On the existence of extractable one-way functions
• Selling privacy at auction
• Distributed approximation algorithms for weighted shortest paths
• Formulas vs. circuits for small distance connectivity
• Generalized bucketization scheme for flexible privacy settings
• Embedding and canonizing graphs of bounded genus in logspace
• Homological product codes
• The sample complexity of revenue maximization
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Smoothed analysis of tensor decompositions
• Oblivious sampling with applications to two-party \(k\)-means clustering
• Query complexity of approximate nash equilibria
• Efficient density estimation via piecewise polynomial approximation
• Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
• Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
• 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
• Fingerprinting codes and the price of approximate differential privacy
• Strong hardness of privacy from weak traitor tracing
• 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
• Order-revealing encryption and the hardness of private learning
• 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
• A characterization of locally testable affine-invariant properties via decomposition theorems
• A super-polynomial lower bound for regular arithmetic formulas
• How to delegate computations
• Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
• Economic efficiency requires interaction
• Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• A strongly polynomial algorithm for generalized flow maximization
• Analytical approach to parallel repetition
• Coin flipping of any constant bias implies one-way functions
• Constant rank bimatrix games are PPAD-hard
• \(L_p\)-testing
• 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?)
• How to use indistinguishability obfuscation
• Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
• The asymptotic \(k\)-SAT threshold
• Finite sample differentially private confidence intervals
• The complexity of differential privacy
• Constant factor approximation for balanced cut in the PIE model
• On derandomizing algorithms that err extremely rarely
• 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
• Infinite randomness expansion with a constant number of devices
• Minimum bisection is fixed parameter tractable
• Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
• Differential Privacy: A Survey of Results
• Bounds on the sample complexity for private learning and private data release
• 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
• Zig-zag sort
• Large margin multiclass Gaussian classification with differential privacy
• Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
• Optimal data-independent noise for differential privacy
• Linear time construction of compressed text indices in compact space
• Shortest paths on polyhedral surfaces and terrains
• The limits of depth reduction for arithmetic formulas
• From average case complexity to improper learning complexity
• An efficient parallel solver for SDD linear systems
• From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
• Submodular functions are noise stable
• Approximation algorithms for bipartite matching with metric and geometric costs
• Circuits resilient to additive attacks with applications to secure computation
• Rounding sum-of-squares relaxations

This page was built for software: SuLQ