|
|
Conferences in DBLP
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. [Citation Graph (, )][DBLP]
Internet Ad Auctions: Insights and Directions. [Citation Graph (, )][DBLP]
The Complexity of Boolean Formula Minimization. [Citation Graph (, )][DBLP]
Optimal Cryptographic Hardness of Learning Monotone Functions. [Citation Graph (, )][DBLP]
On Berge Multiplication for Monotone Boolean Dualization. [Citation Graph (, )][DBLP]
Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity. [Citation Graph (, )][DBLP]
Constructing Efficient Dictionaries in Close to Sorting Time. [Citation Graph (, )][DBLP]
On List Update with Locality of Reference. [Citation Graph (, )][DBLP]
A New Combinatorial Approach for Sparse Graph Problems. [Citation Graph (, )][DBLP]
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). [Citation Graph (, )][DBLP]
Networks Become Navigable as Nodes Move and Forget. [Citation Graph (, )][DBLP]
Fast Distributed Computation of Cuts Via Random Circulations. [Citation Graph (, )][DBLP]
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. [Citation Graph (, )][DBLP]
Function Evaluation Via Linear Programming in the Priced Information Model. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for Budgeted Allocations. [Citation Graph (, )][DBLP]
The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Treewidth Computation and Extremal Combinatorics. [Citation Graph (, )][DBLP]
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. [Citation Graph (, )][DBLP]
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. [Citation Graph (, )][DBLP]
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]
Optimal Monotone Encodings. [Citation Graph (, )][DBLP]
Polynomial-Time Construction of Linear Network Coding. [Citation Graph (, )][DBLP]
Complexity of Decoding Positive-Rate Reed-Solomon Codes. [Citation Graph (, )][DBLP]
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). [Citation Graph (, )][DBLP]
The Randomized Coloring Procedure with Symmetry-Breaking. [Citation Graph (, )][DBLP]
The Local Nature of List Colorings for Graphs of High Girth. [Citation Graph (, )][DBLP]
Approximating List-Coloring on a Fixed Surface. [Citation Graph (, )][DBLP]
Asymptotically Optimal Hitting Sets Against Polynomials. [Citation Graph (, )][DBLP]
The Smoothed Complexity of Edit Distance. [Citation Graph (, )][DBLP]
Randomized Self-assembly for Approximate Shapes. [Citation Graph (, )][DBLP]
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). [Citation Graph (, )][DBLP]
Competitive Weighted Matching in Transversal Matroids. [Citation Graph (, )][DBLP]
Scheduling for Speed Bounded Processors. [Citation Graph (, )][DBLP]
Faster Algorithms for Incremental Topological Ordering. [Citation Graph (, )][DBLP]
Dynamic Normal Forms and Dynamic Characteristic Polynomial. [Citation Graph (, )][DBLP]
Algorithms for epsilon-Approximations of Terrains. [Citation Graph (, )][DBLP]
An Approximation Algorithm for Binary Searching in Trees. [Citation Graph (, )][DBLP]
Algorithms for 2-Route Cut Problems. [Citation Graph (, )][DBLP]
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. [Citation Graph (, )][DBLP]
Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]
Testing Properties of Sets of Points in Metric Spaces. [Citation Graph (, )][DBLP]
An Expansion Tester for Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Property Testing on k-Vertex-Connectivity of Graphs. [Citation Graph (, )][DBLP]
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). [Citation Graph (, )][DBLP]
On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]
Faster Algebraic Algorithms for Path and Packing Problems. [Citation Graph (, )][DBLP]
Understanding the Complexity of Induced Subgraph Isomorphisms. [Citation Graph (, )][DBLP]
Spanners in Sparse Graphs. [Citation Graph (, )][DBLP]
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. [Citation Graph (, )][DBLP]
All-Pairs Shortest Paths with a Sublinear Additive Error. [Citation Graph (, )][DBLP]
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]
The Complexity of the Counting Constraint Satisfaction Problem. [Citation Graph (, )][DBLP]
On the Hardness of Losing Weight. [Citation Graph (, )][DBLP]
Product Theorems Via Semidefinite Programming. [Citation Graph (, )][DBLP]
Sound 3-Query PCPPs Are Long. [Citation Graph (, )][DBLP]
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. [Citation Graph (, )][DBLP]
Recursive Stochastic Games with Positive Rewards. [Citation Graph (, )][DBLP]
Complementation, Disambiguation, and Determinization of Büchi Automata Unified. [Citation Graph (, )][DBLP]
Tree Projections: Hypergraph Games and Minimality. [Citation Graph (, )][DBLP]
Explicit Non-adaptive Combinatorial Group Testing Schemes. [Citation Graph (, )][DBLP]
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. [Citation Graph (, )][DBLP]
Impossibility of a Quantum Speed-Up with a Faulty Oracle. [Citation Graph (, )][DBLP]
Superpolynomial Speedups Based on Almost Any Quantum Circuit. [Citation Graph (, )][DBLP]
The Speed of Convergence in Congestion Games under Best-Response Dynamics. [Citation Graph (, )][DBLP]
Uniform Budgets and the Envy-Free Pricing Problem. [Citation Graph (, )][DBLP]
Bayesian Combinatorial Auctions. [Citation Graph (, )][DBLP]
Truthful Unification Framework for Packing Integer Programs with Choices. [Citation Graph (, )][DBLP]
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. [Citation Graph (, )][DBLP]
Finding Optimal Flows Efficiently. [Citation Graph (, )][DBLP]
Optimal Quantum Adversary Lower Bounds for Ordered Search. [Citation Graph (, )][DBLP]
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. [Citation Graph (, )][DBLP]
|
