scientific article; zbMATH DE number 5485440
From MaRDI portal
Publication:3549600
Cited in
(only showing first 100 items - show all)- Confidentiality and differential privacy in the dissemination of frequency tables
- Preserving differential privacy in convolutional deep belief networks
- Privacy in implementation
- Discrimination- and privacy-aware patterns
- Differentially private nearest neighbor classification
- Approximate relational Hoare logic for continuous random samplings
- Processing text for privacy: an information flow perspective
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Differentially private data release via statistical election to partition sequentially
- Privacy, patience, and protection
- A differentially private hybrid approach to traffic monitoring
- Federated personalized random forest for human activity recognition
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Secure random sampling in differential privacy
- Measured continuous greedy with differential privacy
- The backbone method for ultra-high dimensional sparse machine learning
- Efficient and secure outsourcing of differentially private data publication
- Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition
- Comparative study of differentially private data synthesis methods
- Learning privately with labeled and unlabeled examples
- Discrete optimization methods for group model selection in compressed sensing
- Differentially private distance learning in categorical data
- Truthful mechanisms with implicit payment computation
- Computing (and Life) Is All about Tradeoffs
- Sylvester-Gallai type theorems for approximate collinearity
- A survey on approximation mechanism design without money for facility games
- Pufferfish: a framework for mathematical privacy definitions
- Buying data from privacy-aware individuals: the effect of negative payments
- The core of the participatory budgeting problem
- What can we learn privately?
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Perturbation paradigms of maintaining privacy-preserving monotonicity for differential privacy
- Bounds on the sample complexity for private learning and private data release
- An improved private mechanism for small databases
- Sample complexity bounds on differentially private learning via communication complexity
- Privacy and truthful equilibrium selection for aggregative games
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Attacks on statistical databases: the highly noisy case
- Fingerprinting codes and the price of approximate differential privacy
- Optimal data-independent noise for differential privacy
- Algorithmic stability for adaptive data analysis
- The complexity of differential privacy
- Low rank matrix recovery with adversarial sparse noise
- scientific article; zbMATH DE number 7625208 (Why is no real title available?)
- Efficient money burning in general domains
- Differentially private learning of geometric concepts
- Simultaneous private learning of multiple concepts
- scientific article; zbMATH DE number 7164746 (Why is no real title available?)
- Fingerprinting codes and the price of approximate differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- 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: padded decomposition for minor-free graphs
- 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: an information complexity approach to the KRW composition conjecture
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Economic efficiency requires interaction
- 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: non-clairvoyant scheduling under polyhedral constraints
- 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: optimal fault-tolerant spanners for doubling metrics
- 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
- The average sensitivity of an intersection of half spaces
- From average case complexity to improper learning complexity
- Bandits with switching costs, \(T^{2/3}\) regret
- 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
- Constant rank bimatrix games are PPAD-hard
- Approximation algorithms for bipartite matching with metric and geometric costs
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)
