|
|
Conferences in DBLP
The work of Leslie Valiant. [Citation Graph (, )][DBLP]
Message passing algorithms and improved LP decoding. [Citation Graph (, )][DBLP]
List decoding tensor products and interleaved codes. [Citation Graph (, )][DBLP]
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes. [Citation Graph (, )][DBLP]
A deterministic reduction for the gap minimum distance problem: [extended abstract]. [Citation Graph (, )][DBLP]
3-query locally decodable codes of subexponential length. [Citation Graph (, )][DBLP]
Exact learning of random DNF over the uniform distribution. [Citation Graph (, )][DBLP]
Polynomial-time theory of matrix groups. [Citation Graph (, )][DBLP]
Affine dispersers from subspace polynomials. [Citation Graph (, )][DBLP]
On oblivious PTAS's for nash equilibrium. [Citation Graph (, )][DBLP]
The extended BG-simulation and the characterization of t-resiliency. [Citation Graph (, )][DBLP]
An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]
A nearly optimal oracle for avoiding failed vertices and edges. [Citation Graph (, )][DBLP]
Distributed (delta+1)-coloring in linear (in delta) time. [Citation Graph (, )][DBLP]
Near-perfect load balancing by randomized rounding. [Citation Graph (, )][DBLP]
New direct-product testers and 2-query PCPs. [Citation Graph (, )][DBLP]
On proximity oblivious testing. [Citation Graph (, )][DBLP]
Testing juntas nearly optimally. [Citation Graph (, )][DBLP]
Green's conjecture and testing linear-invariant properties. [Citation Graph (, )][DBLP]
Athena lecture: Controlling Access to Programs? [Citation Graph (, )][DBLP]
Fully homomorphic encryption using ideal lattices. [Citation Graph (, )][DBLP]
A unified framework for concurrent security: universal composability from stand-alone non-malleability. [Citation Graph (, )][DBLP]
Non-malleability amplification. [Citation Graph (, )][DBLP]
Approximating edit distance in near-linear time. [Citation Graph (, )][DBLP]
Numerical linear algebra in the streaming model. [Citation Graph (, )][DBLP]
A fast and efficient algorithm for low-rank approximation of a matrix. [Citation Graph (, )][DBLP]
An improved constant-time approximation algorithm for maximum~matchings. [Citation Graph (, )][DBLP]
Finding sparse cuts locally using evolving sets. [Citation Graph (, )][DBLP]
On the geometry of graphs with a forbidden minor. [Citation Graph (, )][DBLP]
Twice-ramanujan sparsifiers. [Citation Graph (, )][DBLP]
Max cut and the smallest eigenvalue. [Citation Graph (, )][DBLP]
Homology flows, cohomology cuts. [Citation Graph (, )][DBLP]
Integrality gaps for Sherali-Adams relaxations. [Citation Graph (, )][DBLP]
Sherali-adams relaxations of the matching polytope. [Citation Graph (, )][DBLP]
CSP gaps and reductions in the lasserre hierarchy. [Citation Graph (, )][DBLP]
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. [Citation Graph (, )][DBLP]
Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. [Citation Graph (, )][DBLP]
A constructive proof of the Lovász local lemma. [Citation Graph (, )][DBLP]
Universally utility-maximizing privacy mechanisms. [Citation Graph (, )][DBLP]
Private coresets. [Citation Graph (, )][DBLP]
Differential privacy and robust statistics. [Citation Graph (, )][DBLP]
On the complexity of differentially private data release: efficient algorithms and hardness results. [Citation Graph (, )][DBLP]
Quantum algorithms using the curvelet transform. [Citation Graph (, )][DBLP]
Short seed extractors against quantum storage. [Citation Graph (, )][DBLP]
Efficient discrete-time simulations of continuous-time quantum query algorithms. [Citation Graph (, )][DBLP]
The detectability lemma and quantum gap amplification. [Citation Graph (, )][DBLP]
Affiliation networks. [Citation Graph (, )][DBLP]
Fault-tolerant spanners for general graphs. [Citation Graph (, )][DBLP]
Hadwiger's conjecture is decidable. [Citation Graph (, )][DBLP]
Finding, minimizing, and counting weighted subgraphs. [Citation Graph (, )][DBLP]
On the complexity of communication complexity. [Citation Graph (, )][DBLP]
Bit-probe lower bounds for succinct data structures. [Citation Graph (, )][DBLP]
Randomly supported independence and resistance. [Citation Graph (, )][DBLP]
Conditional hardness for satisfiable 3-CSPs. [Citation Graph (, )][DBLP]
A new approach to auctions and resilient mechanism design. [Citation Graph (, )][DBLP]
Intrinsic robustness of the price of anarchy. [Citation Graph (, )][DBLP]
On the convergence of regret minimization dynamics in concave games. [Citation Graph (, )][DBLP]
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. [Citation Graph (, )][DBLP]
MaxMin allocation via degree lower-bounded arborescences. [Citation Graph (, )][DBLP]
How long does it take to catch a wild kangaroo? [Citation Graph (, )][DBLP]
Random walks on polytopes and an affine interior point method for linear programming. [Citation Graph (, )][DBLP]
Mixing time for the solid-on-solid model. [Citation Graph (, )][DBLP]
Reconstruction for the Potts model. [Citation Graph (, )][DBLP]
Tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP]
Non-malleable extractors and symmetric key cryptography from weak secrets. [Citation Graph (, )][DBLP]
Inaccessible entropy. [Citation Graph (, )][DBLP]
On cryptography with auxiliary input. [Citation Graph (, )][DBLP]
Every planar graph is the intersection graph of segments in the plane: extended abstract. [Citation Graph (, )][DBLP]
Small-size epsilon-nets for axis-parallel rectangles and boxes. [Citation Graph (, )][DBLP]
Explicit construction of a small epsilon-net for linear threshold functions. [Citation Graph (, )][DBLP]
A constant-factor approximation for stochastic Steiner forest. [Citation Graph (, )][DBLP]
Multiple intents re-ranking. [Citation Graph (, )][DBLP]
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. [Citation Graph (, )][DBLP]
Online and stochastic survivable network design. [Citation Graph (, )][DBLP]
An axiomatic approach to algebrization. [Citation Graph (, )][DBLP]
Random graphs and the parity quantifier. [Citation Graph (, )][DBLP]
Holant problems and counting CSP. [Citation Graph (, )][DBLP]
A new line of attack on the dichotomy conjecture. [Citation Graph (, )][DBLP]
|
