Conferences in DBLP
The Polynomial Method in Quantum and Classical Computing. [Citation Graph (, )][DBLP ] Theory of Sponsored Search Auctions. [Citation Graph (, )][DBLP ] Average-case Complexity. [Citation Graph (, )][DBLP ] Truthful Approximation Schemes for Single-Parameter Agents. [Citation Graph (, )][DBLP ] Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. [Citation Graph (, )][DBLP ] Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. [Citation Graph (, )][DBLP ] Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. [Citation Graph (, )][DBLP ] The Sign-Rank of AC^O. [Citation Graph (, )][DBLP ] Arithmetic Circuits: A Chasm at Depth Four. [Citation Graph (, )][DBLP ] Dense Subsets of Pseudorandom Sets. [Citation Graph (, )][DBLP ] Almost-Natural Proofs. [Citation Graph (, )][DBLP ] Dynamic Connectivity: Connecting to Networks and Geometry. [Citation Graph (, )][DBLP ] Algorithms for Single-Source Vertex Connectivity. [Citation Graph (, )][DBLP ] A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. [Citation Graph (, )][DBLP ] Degree Bounded Network Design with Metric Costs. [Citation Graph (, )][DBLP ] Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. [Citation Graph (, )][DBLP ] Fast Modular Composition in any Characteristic. [Citation Graph (, )][DBLP ] Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. [Citation Graph (, )][DBLP ] Worst Case to Average Case Reductions for Polynomials. [Citation Graph (, )][DBLP ] On the Union of Cylinders in Three Dimensions. [Citation Graph (, )][DBLP ] Spherical Cubes and Rounding in High Dimensions. [Citation Graph (, )][DBLP ] Near-Optimal Sparse Recovery in the L1 Norm. [Citation Graph (, )][DBLP ] On Basing Lower-Bounds for Learning on Worst-Case Assumptions. [Citation Graph (, )][DBLP ] The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). [Citation Graph (, )][DBLP ] Hardness of Minimizing and Learning DNF Expressions. [Citation Graph (, )][DBLP ] Elections Can be Manipulated Often. [Citation Graph (, )][DBLP ] On the Hardness of Being Truthful. [Citation Graph (, )][DBLP ] Multi-unit Auctions with Budget Limits. [Citation Graph (, )][DBLP ] Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. [Citation Graph (, )][DBLP ] On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. [Citation Graph (, )][DBLP ] Leakage-Resilient Cryptography. [Citation Graph (, )][DBLP ] Succincter. [Citation Graph (, )][DBLP ] Two Query PCP with Sub-Constant Error. [Citation Graph (, )][DBLP ] Constant-Time Approximation Algorithms via Local Improvements. [Citation Graph (, )][DBLP ] Some Results on Greedy Embeddings in Metric Spaces. [Citation Graph (, )][DBLP ] Set Covering with our Eyes Closed. [Citation Graph (, )][DBLP ] Minimizing Movement in Mobile Facility Location Problems. [Citation Graph (, )][DBLP ] A Counterexample to Strong Parallel Repetition. [Citation Graph (, )][DBLP ] Rounding Parallel Repetitions of Unique Games. [Citation Graph (, )][DBLP ] The Unbounded-Error Communication Complexity of Symmetric Functions. [Citation Graph (, )][DBLP ] Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. [Citation Graph (, )][DBLP ] Inapproximability for Metric Embeddings into R^d. [Citation Graph (, )][DBLP ] A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. [Citation Graph (, )][DBLP ] Hardness of Nearest Neighbor under L-infinity. [Citation Graph (, )][DBLP ] (Data) STRUCTURES. [Citation Graph (, )][DBLP ] Entangled Games are Hard to Approximate. [Citation Graph (, )][DBLP ] Unique Games with Entangled Provers are Easy. [Citation Graph (, )][DBLP ] Quantum Multi Prover Interactive Proofs with Communicating Provers. [Citation Graph (, )][DBLP ] A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. [Citation Graph (, )][DBLP ] Sketching and Streaming Entropy via Approximation Theory. [Citation Graph (, )][DBLP ] On the Value of Multiple Read/Write Streams for Approximating Frequency Moments. [Citation Graph (, )][DBLP ] Clock Synchronization with Bounded Global and Local Skew. [Citation Graph (, )][DBLP ] Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. [Citation Graph (, )][DBLP ] What Can We Learn Privately? [Citation Graph (, )][DBLP ] Learning Geometric Concepts via Gaussian Surface Area. [Citation Graph (, )][DBLP ] Isotropic PCA and Affine-Invariant Clustering. [Citation Graph (, )][DBLP ] Approximate Kernel Clustering. [Citation Graph (, )][DBLP ] Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP ] (Acyclic) JobShops are Hard to Approximate. [Citation Graph (, )][DBLP ] Linear Level Lasserre Lower Bounds for Certain k-CSPs. [Citation Graph (, )][DBLP ] The Power of Reordering for Online Minimum Makespan Scheduling. [Citation Graph (, )][DBLP ] Locally Testing Direct Product in the Low Error Range. [Citation Graph (, )][DBLP ] Kakeya Sets, New Mergers and Old Extractors. [Citation Graph (, )][DBLP ] A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. [Citation Graph (, )][DBLP ] Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. [Citation Graph (, )][DBLP ] Network Extractor Protocols. [Citation Graph (, )][DBLP ] Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time. [Citation Graph (, )][DBLP ] Computing the Tutte Polynomial in Vertex-Exponential Time. [Citation Graph (, )][DBLP ] On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. [Citation Graph (, )][DBLP ] Submodular Approximation: Sampling-based Algorithms and Lower Bounds. [Citation Graph (, )][DBLP ] Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. [Citation Graph (, )][DBLP ] Noise Tolerance of Expanders and Sublinear Expander Reconstruction. [Citation Graph (, )][DBLP ] Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier. [Citation Graph (, )][DBLP ] Size Bounds and Query Plans for Relational Joins. [Citation Graph (, )][DBLP ] Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. [Citation Graph (, )][DBLP ] Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. [Citation Graph (, )][DBLP ] A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. [Citation Graph (, )][DBLP ] Nearly Tight Low Stretch Spanning Trees. [Citation Graph (, )][DBLP ] Algorithmic Barriers from Phase Transitions. [Citation Graph (, )][DBLP ] Mixing Time of Exponential Random Graphs. [Citation Graph (, )][DBLP ] k-Wise Independent Random Graphs. [Citation Graph (, )][DBLP ] Broadcasting with Side Information. [Citation Graph (, )][DBLP ]