SuLQ

swMATH11355MaRDI QIDQ23301

No author found.

Related Items (only showing first 100 items - show all)

Differentially-private learning of low dimensional manifolds ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Analytical approach to parallel repetition ⋮ A characterization of strong approximation resistance ⋮ A strongly polynomial algorithm for generalized flow maximization ⋮ Approximate distance oracles with constant query time ⋮ Faster all-pairs shortest paths via circuit complexity ⋮ Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs ⋮ Zig-zag sort ⋮ Community detection thresholds and the weak Ramanujan property ⋮ Distributed computability in Byzantine asynchronous systems ⋮ Multiway cut, pairwise realizable distributions, and descending thresholds ⋮ 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 ⋮ Communication lower bounds via critical block sensitivity ⋮ Computing with a full memory ⋮ Hitting sets for multilinear read-once algebraic branching programs, in any order ⋮ On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Sample Complexity Bounds on Differentially Private Learning via Communication Complexity ⋮ 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 ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ Unnamed Item ⋮ Finite Sample Differentially Private Confidence Intervals ⋮ Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Estimation of Wasserstein distances in the spiked transport model ⋮ Oblivious sampling with applications to two-party \(k\)-means clustering ⋮ Differential Privacy: A Survey of Results ⋮ Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Optimal CUR Matrix Decompositions ⋮ Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ The average sensitivity of an intersection of half spaces ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ PCPs and the hardness of generating synthetic data ⋮ Learning privately with labeled and unlabeled examples ⋮ A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Large Margin Multiclass Gaussian Classification with Differential Privacy ⋮ A distributed protocol for privacy preserving aggregation with non-permanent participants ⋮ Optimal data-independent noise for differential privacy ⋮ Deciding First-Order Properties of Nowhere Dense Graphs ⋮ The Matching Polytope has Exponential Extension Complexity ⋮ Generalized bucketization scheme for flexible privacy settings ⋮ 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 ⋮ Principal component analysis in the local differential privacy model ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ Asymptotically Optimal and Private Statistical Estimation ⋮ Bounds on the Sample Complexity for Private Learning and Private Data Release ⋮ Unnamed Item ⋮ 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

This page was built for software: SuLQ