
Conferences in DBLP
Approximation Algorithms for MulticommodityType Problems with Guarantees Independent of the Graph Size. [Citation Graph (, )][DBLP]
Faster Generation of Random Spanning Trees. [Citation Graph (, )][DBLP]
Local Graph Partitions for Approximation and Testing. [Citation Graph (, )][DBLP]
Oblivious Routing for the Lpnorm. [Citation Graph (, )][DBLP]
Linear Systems over Composite Moduli. [Citation Graph (, )][DBLP]
Multiparty Communication Complexity and Threshold Circuit Size of AC^0. [Citation Graph (, )][DBLP]
The Communication Complexity of SetDisjointness with Small Sets and 01 Intersection. [Citation Graph (, )][DBLP]
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem. [Citation Graph (, )][DBLP]
Randomized SelfAssembly for Exact Shapes. [Citation Graph (, )][DBLP]
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. [Citation Graph (, )][DBLP]
On Allocating Goods to Maximize Fairness. [Citation Graph (, )][DBLP]
Online Stochastic Matching: Beating 11/e. [Citation Graph (, )][DBLP]
InstanceOptimal Geometric Algorithms. [Citation Graph (, )][DBLP]
Delaunay Triangulations in O(sort(n)) Time and More. [Citation Graph (, )][DBLP]
Orthogonal Range Reporting in Three and Higher Dimensions. [Citation Graph (, )][DBLP]
Decomposing Coverings and the Planar Sensor Cover Problem. [Citation Graph (, )][DBLP]
Bounded Independence Fools Halfspaces. [Citation Graph (, )][DBLP]
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. [Citation Graph (, )][DBLP]
Constructing SmallBias Sets from AlgebraicGeometric Codes. [Citation Graph (, )][DBLP]
Blackbox Polynomial Identity Testing for Depth 3 Circuits. [Citation Graph (, )][DBLP]
A New Probability Inequality Using Typical Moments and Concentration Results. [Citation Graph (, )][DBLP]
A Probabilistic Inequality with Applications to Threshold DirectProduct Theorems. [Citation Graph (, )][DBLP]
ChoiceMemory Tradeoff in Allocations. [Citation Graph (, )][DBLP]
A Parallel Repetition Theorem for Any Interactive Argument. [Citation Graph (, )][DBLP]
Resolving the Simultaneous Resettability Conjecture and a New NonBlackBox Simulation Strategy. [Citation Graph (, )][DBLP]
Extracting Correlations. [Citation Graph (, )][DBLP]
Settling the Complexity of ArrowDebreu Equilibria in Markets with Additively Separable Utilities. [Citation Graph (, )][DBLP]
Reducibility among Fractional Stability Problems. [Citation Graph (, )][DBLP]
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. [Citation Graph (, )][DBLP]
Convergence to Equilibrium in Local Interaction Games. [Citation Graph (, )][DBLP]
Exact and Approximate Pattern Matching in the Streaming Model. [Citation Graph (, )][DBLP]
Efficient Sketches for EarthMover Distance, with Applications. [Citation Graph (, )][DBLP]
Models for the Compressible Web. [Citation Graph (, )][DBLP]
The Intersection of Two Halfspaces Has High Threshold Degree. [Citation Graph (, )][DBLP]
Breaking the Multicommodity Flow Barrier for O(vlog n)Approximations to Sparsest Cut. [Citation Graph (, )][DBLP]
A Complete Characterization of Statistical Query Learning with Applications to Evolvability. [Citation Graph (, )][DBLP]
Agnostic Learning of Monomials by Halfspaces Is Hard. [Citation Graph (, )][DBLP]
Learning and Smoothed Analysis. [Citation Graph (, )][DBLP]
kMeans Has Polynomial Smoothed Complexity. [Citation Graph (, )][DBLP]
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and SpiderCover Decompositions. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for PRIZECOLLECTING STEINER TREE and TSP. [Citation Graph (, )][DBLP]
An O(k^3 log n)Approximation Algorithm for VertexConnectivity Survivable Network Design. [Citation Graph (, )][DBLP]
An Oblivious O(1)Approximation for Single Source BuyatBulk. [Citation Graph (, )][DBLP]
Optimal Long Code Test with One Free Bit. [Citation Graph (, )][DBLP]
Combinatorial PCPs with Efficient Verifiers. [Citation Graph (, )][DBLP]
Composition of LowError 2Query PCPs Using Decodable PCPs. [Citation Graph (, )][DBLP]
The Complexity of Rationalizing Network Formation. [Citation Graph (, )][DBLP]
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization. [Citation Graph (, )][DBLP]
On the Power of Randomization in Algorithmic Mechanism Design. [Citation Graph (, )][DBLP]
Universal Blind Quantum Computation. [Citation Graph (, )][DBLP]
Optimal Quantum Strong Coin Flipping. [Citation Graph (, )][DBLP]
TwoMessage Quantum Interactive Proofs Are in PSPACE. [Citation Graph (, )][DBLP]
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function. [Citation Graph (, )][DBLP]
A (log n)^{Omega(1)} Integrality Gap for the Sparsest Cut SDP. [Citation Graph (, )][DBLP]
SDP Integrality Gaps with Local ell_1Embeddability. [Citation Graph (, )][DBLP]
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. [Citation Graph (, )][DBLP]
How to Round Any CSP. [Citation Graph (, )][DBLP]
Constraint Satisfaction Problems of Bounded Width. [Citation Graph (, )][DBLP]
Bit Encryption Is Complete. [Citation Graph (, )][DBLP]
2Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. [Citation Graph (, )][DBLP]
(Meta) Kernelization. [Citation Graph (, )][DBLP]
Planarity Allowing Few Error Vertices in Linear Time. [Citation Graph (, )][DBLP]
Symmetry and Approximability of Submodular Maximization Problems. [Citation Graph (, )][DBLP]
Submodular Function Minimization under Covering Constraints. [Citation Graph (, )][DBLP]
Smoothed Analysis of Multiobjective Optimization. [Citation Graph (, )][DBLP]
Fully Dynamic (2 + epsilon) Approximate AllPairs Shortest Paths with Fast Query and Close to Linear Update Time. [Citation Graph (, )][DBLP]
Distance Oracles for Sparse Graphs. [Citation Graph (, )][DBLP]
SpaceEfficient Framework for Topk String Retrieval Problems. [Citation Graph (, )][DBLP]
KKL, KruskalKatona, and Monotone Nets. [Citation Graph (, )][DBLP]
Higher Eigenvalues of Graphs. [Citation Graph (, )][DBLP]
Regularity Lemmas and Combinatorial Algorithms. [Citation Graph (, )][DBLP]
Approximability of Combinatorial Problems with Multiagent Submodular Cost Functions. [Citation Graph (, )][DBLP]
The Data Stream Space Complexity of Cascaded Norms. [Citation Graph (, )][DBLP]
