Conferences in DBLP
Structure and Randomness in Combinatorics. [Citation Graph (, )][DBLP ] A Brief Look at Pairings Based Cryptography. [Citation Graph (, )][DBLP ] Spectral Graph Theory and its Applications. [Citation Graph (, )][DBLP ] Pseudorandom Bits for Polynomials. [Citation Graph (, )][DBLP ] Extractors and Rank Extractors for Polynomial Sources. [Citation Graph (, )][DBLP ] Polylogarithmic Independence Can Fool DNF Formulas. [Citation Graph (, )][DBLP ] Derandomization of Sparse Cyclotomic Integer Zero Testing. [Citation Graph (, )][DBLP ] Computing Equilibria in Anonymous Games. [Citation Graph (, )][DBLP ] Mechanism Design via Differential Privacy. [Citation Graph (, )][DBLP ] Balloon Popping With Applications to Ascending Auctions. [Citation Graph (, )][DBLP ] On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). [Citation Graph (, )][DBLP ] Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. [Citation Graph (, )][DBLP ] Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. [Citation Graph (, )][DBLP ] Parameterized Proof Complexity. [Citation Graph (, )][DBLP ] Non-Linear Index Coding Outperforming the Linear Optimum. [Citation Graph (, )][DBLP ] Can you beat treewidth? [Citation Graph (, )][DBLP ] Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. [Citation Graph (, )][DBLP ] Reconstruction for Models on Random Graphs. [Citation Graph (, )][DBLP ] Mixing Time Power Laws at Criticality. [Citation Graph (, )][DBLP ] Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. [Citation Graph (, )][DBLP ] Intrusion-Resilient Secret Sharing. [Citation Graph (, )][DBLP ] Covert Multi-Party Computation. [Citation Graph (, )][DBLP ] Cryptography from Sunspots: How to Use an Imperfect Reference String. [Citation Graph (, )][DBLP ] Planning for Fast Connectivity Updates. [Citation Graph (, )][DBLP ] Strongly History-Independent Hashing with Applications. [Citation Graph (, )][DBLP ] Smooth Histograms for Sliding Windows. [Citation Graph (, )][DBLP ] Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. [Citation Graph (, )][DBLP ] Towards Sharp Inapproximability For Any 2-CSP. [Citation Graph (, )][DBLP ] Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. [Citation Graph (, )][DBLP ] Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. [Citation Graph (, )][DBLP ] On the Optimality of Planar and Geometric Approximation Schemes. [Citation Graph (, )][DBLP ] Hardness of Reconstructing Multivariate Polynomials over Finite Fields. [Citation Graph (, )][DBLP ] Any AND-OR Formula of Size N can be Evaluated in time N^{1/2+o(1)} on a Quantum Computer. [Citation Graph (, )][DBLP ] The Power of Quantum Systems on a Line. [Citation Graph (, )][DBLP ] Simulating Quantum Correlations with Finite Communication. [Citation Graph (, )][DBLP ] Quantum Algorithms for Hidden Nonlinear Structures. [Citation Graph (, )][DBLP ] Refuting Smoothed 3CNF Formulas. [Citation Graph (, )][DBLP ] Hardness Amplification for Errorless Heuristics. [Citation Graph (, )][DBLP ] One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. [Citation Graph (, )][DBLP ] A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP ] Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. [Citation Graph (, )][DBLP ] Maximizing Non-Monotone Submodular Functions. [Citation Graph (, )][DBLP ] On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. [Citation Graph (, )][DBLP ] Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards. [Citation Graph (, )][DBLP ] Beating Simplex for Fractional Packing and Covering Linear Programs. [Citation Graph (, )][DBLP ] A Primal-Dual Randomized Algorithm for Weighted Paging. [Citation Graph (, )][DBLP ] Finding Disjoint Paths in Expanders Deterministically and Online. [Citation Graph (, )][DBLP ] Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. [Citation Graph (, )][DBLP ] Inferring Local Homology from Sampled Stratified Spaces. [Citation Graph (, )][DBLP ] Testing for Concise Representations. [Citation Graph (, )][DBLP ] Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. [Citation Graph (, )][DBLP ] Testing Expansion in Bounded-Degree Graphs. [Citation Graph (, )][DBLP ] Approximate Hypergraph Partitioning and Applications. [Citation Graph (, )][DBLP ] Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP ] Minimizing Average Flow-time : Upper and Lower Bounds. [Citation Graph (, )][DBLP ] Non-Preemptive Min-Sum Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP ] On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP ] Buy-at-Bulk Network Design with Protection. [Citation Graph (, )][DBLP ] Space-Efficient Identity Based Encryption Without Pairings. [Citation Graph (, )][DBLP ] Round Complexity of Authenticated Broadcast with a Dishonest Majority. [Citation Graph (, )][DBLP ] Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP ] Lower Bounds on Signatures From Symmetric Primitives. [Citation Graph (, )][DBLP ] Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations. [Citation Graph (, )][DBLP ] Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. [Citation Graph (, )][DBLP ] Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP ] The Computational Hardness of Estimating Edit Distance [Extended Abstract]. [Citation Graph (, )][DBLP ]