
Conferences in DBLP
Local Search: Simple, Successful, But Sometimes Sluggish. [Citation Graph (, )][DBLP]
When Conflicting Constraints Can Be Resolved  The Lovász Local Lemma and Satisfiability. [Citation Graph (, )][DBLP]
Plane Spanners of Maximum Degree Six. [Citation Graph (, )][DBLP]
The Positive Semidefinite Grothendieck Problem with Rank Constraint. [Citation Graph (, )][DBLP]
Cycle Detection and Correction. [Citation Graph (, )][DBLP]
Decomposition Width of Matroids. [Citation Graph (, )][DBLP]
The Cooperative Game Theory Foundations of Network Bargaining Games. [Citation Graph (, )][DBLP]
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. [Citation Graph (, )][DBLP]
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions. [Citation Graph (, )][DBLP]
MeanPayoff Games and Propositional Proofs. [Citation Graph (, )][DBLP]
Online Network Design with Outliers. [Citation Graph (, )][DBLP]
Efficient Completely Nonmalleable Public Key Encryption. [Citation Graph (, )][DBLP]
PolynomialSpace Approximation of NoSignaling Provers. [Citation Graph (, )][DBLP]
From Secrecy to Soundness: Efficient Verification via Secure Computation. [Citation Graph (, )][DBLP]
Mergeable Dictionaries. [Citation Graph (, )][DBLP]
Faster Algorithms for Semimatching Problems (Extended Abstract). [Citation Graph (, )][DBLP]
Clustering with Diversity. [Citation Graph (, )][DBLP]
New Data Structures for Subgraph Connectivity. [Citation Graph (, )][DBLP]
Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]
Resource Oblivious Sorting on Multicores. [Citation Graph (, )][DBLP]
Interval Sorting. [Citation Graph (, )][DBLP]
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. [Citation Graph (, )][DBLP]
Thresholded Covering Algorithms for Robust and Maxmin Optimization. [Citation Graph (, )][DBLP]
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. [Citation Graph (, )][DBLP]
Metrical Task Systems and the kServer Problem on HSTs. [Citation Graph (, )][DBLP]
Scheduling Periodic Tasks in a Hard RealTime Environment. [Citation Graph (, )][DBLP]
Scalably Scheduling PowerHeterogeneous Processors. [Citation Graph (, )][DBLP]
Better Scalable Algorithms for Broadcast Scheduling. [Citation Graph (, )][DBLP]
Maxmin Online Allocations with a Reordering Buffer. [Citation Graph (, )][DBLP]
Orientability of Random Hypergraphs and the Power of Multiple Choices. [Citation Graph (, )][DBLP]
On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs. [Citation Graph (, )][DBLP]
Dynamic Programming for Graphs on Surfaces. [Citation Graph (, )][DBLP]
Interval Graphs: Canonical Representation in Logspace. [Citation Graph (, )][DBLP]
Approximating the Partition Function of the Ferromagnetic Potts Model. [Citation Graph (, )][DBLP]
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. [Citation Graph (, )][DBLP]
On Sums of Roots of Unity. [Citation Graph (, )][DBLP]
Exponential Time Complexity of the Permanent and the Tutte Polynomial. [Citation Graph (, )][DBLP]
On Approximate Horn Formula Minimization. [Citation Graph (, )][DBLP]
Choosing, Agreeing, and Eliminating in Communication Complexity. [Citation Graph (, )][DBLP]
Additive Spanners in Nearly Quadratic Time. [Citation Graph (, )][DBLP]
Composition Theorems in Communication Complexity. [Citation Graph (, )][DBLP]
Network Design via Core Detouring for Problems without a Core. [Citation Graph (, )][DBLP]
Weak Completeness Notions for Exponential Time. [Citation Graph (, )][DBLP]
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. [Citation Graph (, )][DBLP]
On the Complexity of Searching in Trees: AverageCase Minimization. [Citation Graph (, )][DBLP]
Finding Is as Easy as Detecting for Quantum Walks. [Citation Graph (, )][DBLP]
Improved Constructions for Nonadaptive Threshold Group Testing. [Citation Graph (, )][DBLP]
Testing Nonuniform kWise Independent Distributions over Product Spaces. [Citation Graph (, )][DBLP]
A Sublogarithmic Approximation for Highway and Tollbooth Pricing. [Citation Graph (, )][DBLP]
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LPBased Approximation Algorithm. [Citation Graph (, )][DBLP]
Cell Probe Lower Bounds and Approximations for Range Mode. [Citation Graph (, )][DBLP]
SDP Gaps for 2to1 and Other LabelCover Variants. [Citation Graph (, )][DBLP]
Data Stream Algorithms for Codeword Testing. [Citation Graph (, )][DBLP]
Streaming Algorithms for Independent Sets. [Citation Graph (, )][DBLP]
Preprocessing of Min Ones Problems: A Dichotomy. [Citation Graph (, )][DBLP]
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems. [Citation Graph (, )][DBLP]
Optimal TradeOffs for Succinct String Indexes. [Citation Graph (, )][DBLP]
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. [Citation Graph (, )][DBLP]
Concurrent Knowledge Extraction in the PublicKey Model. [Citation Graph (, )][DBLP]
On the kIndependence Required by Linear Probing and Minwise Independence. [Citation Graph (, )][DBLP]
Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]
Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs. [Citation Graph (, )][DBLP]
