scientific article; zbMATH DE number 5485440
From MaRDI portal
Publication:3549600
Cited in
(only showing first 100 items - show all)- Non-malleable codes from additive combinatorics (extended abstract)
- What can we learn privately?
- Efficient deterministic approximate counting for low-degree polynomial threshold functions
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- On the existence of extractable one-way functions
- Differentially private data release via statistical election to partition sequentially
- Entropy, optimization and counting
- Confidentiality and differential privacy in the dissemination of frequency tables
- Satisfiability threshold for random regular NAE-SAT
- Parallel algorithms for geometric graph problems
- The sample complexity of revenue maximization
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- Truthful mechanisms with implicit payment computation
- 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
- Preserving differential privacy in convolutional deep belief networks
- Privacy in implementation
- Bandits with switching costs, \(T^{2/3}\) regret
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Distributed approximation algorithms for weighted shortest paths
- Formulas vs. circuits for small distance connectivity
- Distributed computability in Byzantine asynchronous systems
- The core of the participatory budgeting problem
- Pufferfish
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- An efficient parallel solver for SDD linear systems
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Smoothed analysis of tensor decompositions
- Secure sampling with sublinear communication
- Approximate distance oracles with constant query time
- 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
- Attacks on statistical databases: the highly noisy case
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- A characterization of locally testable affine-invariant properties via decomposition theorems
- Fingerprinting codes and the price of approximate differential privacy
- Optimal error rates for interactive coding. I: Adaptivity and other settings
- Processing text for privacy: an information flow perspective
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Multiway cut, pairwise realizable distributions, and descending thresholds
- Optimal competitive auctions
- Embedding and canonizing graphs of bounded genus in logspace
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Polynomial bounds for the grid-minor theorem
- The complexity of differential privacy
- Bounds on the sample complexity for private learning and private data release
- Constant factor approximation for balanced cut in the PIE model
- A survey on approximation mechanism design without money for facility games
- Query complexity of approximate nash equilibria
- Discrimination- and privacy-aware patterns
- Secure random sampling in differential privacy
- Distribution-invariant differential privacy
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Black-box non-black-box zero knowledge
- Formal verification of differential privacy for interactive systems (extended abstract)
- Breaking the quadratic barrier for 3-LCC's over the reals
- Communication lower bounds via critical block sensitivity
- A characterization of strong approximation resistance
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- A super-polynomial lower bound for regular arithmetic formulas
- How to delegate computations
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- How to use indistinguishability obfuscation
- A strongly polynomial algorithm for generalized flow maximization
- Analytical approach to parallel repetition
- Coin flipping of any constant bias implies one-way functions
- Faster all-pairs shortest paths via circuit complexity
- \(L_p\)-testing
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Minimum bisection is fixed parameter tractable
- Approximate relational Hoare logic for continuous random samplings
- Comparative study of differentially private data synthesis methods
- Economic efficiency requires interaction
- Efficient money burning in general domains
- Optimal data-independent noise for differential privacy
- Efficient density estimation via piecewise polynomial approximation
- Differentially private nearest neighbor classification
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Distributed Private Data Analysis: Simultaneously Solving How and What
- The asymptotic \(k\)-SAT threshold
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- Privacy, patience, and protection
- Community detection thresholds and the weak Ramanujan property
- Primal beats dual on online packing LPs in the random-order model
- Computing with a full memory: catalytic space
- Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition
- Gaussian differentially private robust mean estimation and inference
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
- Discrete optimization methods for group model selection in compressed sensing
- Private matchings and allocations
- Algorithmic stability for adaptive data analysis
- The backbone method for ultra-high dimensional sparse machine learning
- Perturbation paradigms of maintaining privacy-preserving monotonicity for differential privacy
- Buying data from privacy-aware individuals: the effect of negative payments
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549600)
