Pages that link to "Item:Q2349860"
From MaRDI portal
The following pages link to Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860):
Displaying 50 items.
- An efficient parallel solver for SDD linear systems (Q5259567) (← links)
- Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time (Q5259568) (← links)
- From hierarchical partitions to hierarchical covers (Q5259570) (← links)
- Shortest paths on polyhedral surfaces and terrains (Q5259571) (← links)
- Embedding and canonizing graphs of bounded genus in logspace (Q5259572) (← links)
- Testing surface area with arbitrary accuracy (Q5259573) (← links)
- Coin flipping of <i>any</i> constant bias implies one-way functions (Q5259574) (← links)
- Infinite randomness expansion with a constant number of devices (Q5259577) (← links)
- The average sensitivity of an intersection of half spaces (Q5259578) (← links)
- From average case complexity to improper learning complexity (Q5259579) (← links)
- Bandits with switching costs (Q5259581) (← links)
- Online local learning via semidefinite programming (Q5259582) (← links)
- How to use indistinguishability obfuscation (Q5259583) (← links)
- How to delegate computations (Q5259584) (← links)
- Circuits resilient to additive attacks with applications to secure computation (Q5259585) (← links)
- On the existence of extractable one-way functions (Q5259586) (← links)
- Black-box non-black-box zero knowledge (Q5259587) (← links)
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions (Q5259588) (← links)
- Query complexity of approximate nash equilibria (Q5259589) (← links)
- Constant rank bimatrix games are PPAD-hard (Q5259590) (← links)
- Approximation algorithms for bipartite matching with metric and geometric costs (Q5259591) (← links)
- Distributed approximation algorithms for weighted shortest paths (Q5259592) (← links)
- Parallel algorithms for geometric graph problems (Q5259593) (← links)
- Fourier PCA and robust tensor decomposition (Q5259594) (← links)
- Smoothed analysis of tensor decompositions (Q5259595) (← links)
- Efficient density estimation via piecewise polynomial approximation (Q5259596) (← links)
- Analytical approach to parallel repetition (Q5259598) (← links)
- A characterization of strong approximation resistance (Q5259599) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)
- Approximate distance oracles with constant query time (Q5259601) (← links)
- Faster all-pairs shortest paths via circuit complexity (Q5259602) (← links)
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (Q5259603) (← links)
- Zig-zag sort (Q5259604) (← links)
- Community detection thresholds and the weak Ramanujan property (Q5259605) (← links)
- Distributed computability in Byzantine asynchronous systems (Q5259606) (← links)
- Multiway cut, pairwise realizable distributions, and descending thresholds (Q5259608) (← links)
- Cluster before you hallucinate (Q5259609) (← links)
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (Q5259610) (← links)
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (Q5259611) (← links)
- Every list-decodable code for high noise has abundant near-optimal rate puncturings (Q5259612) (← links)
- Non-malleable codes from additive combinatorics (Q5259613) (← links)
- Breaking the quadratic barrier for 3-LCC's over the reals (Q5259614) (← links)
- Optimal error rates for interactive coding I (Q5259615) (← links)
- The asymptotic k-SAT threshold (Q5259616) (← links)
- Satisfiability threshold for random regular NAE-SAT (Q5259617) (← links)
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (Q5259619) (← links)
- Communication lower bounds via critical block sensitivity (Q5259621) (← links)
- Computing with a full memory (Q5259622) (← links)
- Hitting sets for multilinear read-once algebraic branching programs, in any order (Q5259623) (← links)
- Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data (Q6118081) (← links)
