scientific article; zbMATH DE number 5485574
From MaRDI portal
Publication:5302085
zbMath1231.68120arXiv1109.2229MaRDI QIDQ5302085
Katrina Ligett, Aaron Roth, Avrim L. Blum
Publication date: 5 January 2009
Full work available at URL: https://arxiv.org/abs/1109.2229
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Differential privacy: getting more for less ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Differentially-private learning of low dimensional manifolds ⋮ Privacy Aware Learning ⋮ Unnamed Item ⋮ Cluster before you hallucinate ⋮ Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing ⋮ Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements ⋮ Every list-decodable code for high noise has abundant near-optimal rate puncturings ⋮ Non-malleable codes from additive combinatorics ⋮ Breaking the quadratic barrier for 3-LCC's over the reals ⋮ Optimal error rates for interactive coding I ⋮ The asymptotic k-SAT threshold ⋮ Satisfiability threshold for random regular NAE-SAT ⋮ Efficient deterministic approximate counting for low-degree polynomial threshold functions ⋮ Communication lower bounds via critical block sensitivity ⋮ Computing with a full memory ⋮ Hitting sets for multilinear read-once algebraic branching programs, in any order ⋮ Lower bounds on the error of query sets under the differentially-private matrix mechanism ⋮ Correlated tuple data release via differential privacy ⋮ Providing access to confidential research data through synthesis and verification: an application to data on employees of the U.S. federal government ⋮ An Improved Private Mechanism for Small Databases ⋮ Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region ⋮ Communication is Bounded by Root of Rank ⋮ Are Lock-Free Concurrent Algorithms Practically Wait-Free? ⋮ Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices ⋮ The Power of Localization for Efficiently Learning Linear Separators with Noise ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ Unnamed Item ⋮ Rejoinder ⋮ Comment ⋮ Efficient and secure outsourcing of differentially private data publication ⋮ Authentication in Constrained Settings ⋮ Differential privacy based on importance weighting ⋮ Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Optimal CUR Matrix Decompositions ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ The average sensitivity of an intersection of half spaces ⋮ PCPs and the hardness of generating synthetic data ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Optimal data-independent noise for differential privacy ⋮ Deciding First-Order Properties of Nowhere Dense Graphs ⋮ The Matching Polytope has Exponential Extension Complexity ⋮ Bounds on the sample complexity for private learning and private data release ⋮ Economic efficiency requires interaction ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Minimax Optimal Procedures for Locally Private Estimation ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Bounds on the Sample Complexity for Private Learning and Private Data Release ⋮ Pufferfish ⋮ Fingerprinting codes and the price of approximate differential privacy ⋮ Analyze gauss ⋮ 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 ⋮ 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 ⋮ Breaking the minsky-papert barrier for constant-depth circuits ⋮ 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 ⋮ 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 ⋮ 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 ⋮ From average case complexity to improper learning complexity ⋮ Bandits with switching costs ⋮ 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
This page was built for publication:
