Pages that link to "Item:Q2875203"

The following pages link to Interactive privacy via the median mechanism (Q2875203):

Displaying 50 items.

• Lower bounds on the error of query sets under the differentially-private matrix mechanism (Q269340) (← links)
• On the properties that characterize privacy (Q2173173) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• Comparative study of differentially private data synthesis methods (Q2218047) (← links)
• Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
• Concurrent composition of differential privacy (Q2697876) (← 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)
• The geometry of differential privacy: the small database and approximate cases (Q2805515) (← 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)
• What Can We Learn Privately? (Q3093624) (← 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)
• Differential perturbation mechanism for position correlation (Q3307682) (← links)
• An Improved Private Mechanism for Small Databases (Q3448856) (← 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)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• On the Power of Learning from k-Wise Queries (Q4638095) (← links)
• Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) (← links)
• The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
• Algorithmic Stability for Adaptive Data Analysis (Q4997321) (← links)
• On the measurement complexity of differentially private query answering (Q5046476) (← 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)
• Polynomial bounds for the grid-minor theorem (Q5259539) (← links)
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
• Cops, robbers, and threatening skeletons (Q5259541) (← links)
• Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (Q5259543) (← links)
• On derandomizing algorithms that err extremely rarely (Q5259544) (← links)
• Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (Q5259545) (← links)
• Lower bounds for depth 4 formulas computing iterated matrix multiplication (Q5259546) (← links)
• The limits of depth reduction for arithmetic formulas (Q5259547) (← links)
• A super-polynomial lower bound for regular arithmetic formulas (Q5259548) (← links)
• A characterization of locally testable affine-invariant properties via decomposition theorems (Q5259549) (← links)
• L _p -testing (Q5259550) (← links)
• Turnstile streaming algorithms might as well be linear sketches (Q5259551) (← links)
• Linear time construction of compressed text indices in compact space (Q5259552) (← links)