|
|
Conferences in DBLP
Assigning Papers to Referees. [Citation Graph (, )][DBLP]
Algorithmic Game Theory: A Snapshot. [Citation Graph (, )][DBLP]
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. [Citation Graph (, )][DBLP]
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. [Citation Graph (, )][DBLP]
Sorting and Selection with Imprecise Comparisons. [Citation Graph (, )][DBLP]
Fast FAST. [Citation Graph (, )][DBLP]
Bounds on the Size of Small Depth Circuits for Approximating Majority. [Citation Graph (, )][DBLP]
Counting Subgraphs via Homomorphisms. [Citation Graph (, )][DBLP]
External Sampling. [Citation Graph (, )][DBLP]
Functional Monitoring without Monotonicity. [Citation Graph (, )][DBLP]
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. [Citation Graph (, )][DBLP]
Towards a Study of Low-Complexity Graphs. [Citation Graph (, )][DBLP]
Decidability of Conjugacy of Tree-Shifts of Finite Type. [Citation Graph (, )][DBLP]
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. [Citation Graph (, )][DBLP]
Competitive Analysis of Aggregate Max in Windowed Streaming. [Citation Graph (, )][DBLP]
Faster Regular Expression Matching. [Citation Graph (, )][DBLP]
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. [Citation Graph (, )][DBLP]
Unconditional Lower Bounds against Advice. [Citation Graph (, )][DBLP]
Approximating Decision Trees with Multiway Branches. [Citation Graph (, )][DBLP]
Annotations in Data Streams. [Citation Graph (, )][DBLP]
The Tile Complexity of Linear Assemblies. [Citation Graph (, )][DBLP]
A Graph Reduction Step Preserving Element-Connectivity and Applications. [Citation Graph (, )][DBLP]
Approximating Matches Made in Heaven. [Citation Graph (, )][DBLP]
Strong and Pareto Price of Anarchy in Congestion Games. [Citation Graph (, )][DBLP]
A Better Algorithm for Random k-SAT. [Citation Graph (, )][DBLP]
Exact and Approximate Bandwidth. [Citation Graph (, )][DBLP]
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. [Citation Graph (, )][DBLP]
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. [Citation Graph (, )][DBLP]
On Cartesian Trees and Range Minimum Queries. [Citation Graph (, )][DBLP]
Applications of a Splitting Trick. [Citation Graph (, )][DBLP]
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. [Citation Graph (, )][DBLP]
Incompressibility through Colors and IDs. [Citation Graph (, )][DBLP]
Partition Arguments in Multiparty Communication Complexity. [Citation Graph (, )][DBLP]
High Complexity Tilings with Sparse Errors. [Citation Graph (, )][DBLP]
Tight Bounds for the Cover Time of Multiple Random Walks. [Citation Graph (, )][DBLP]
Online Computation with Advice. [Citation Graph (, )][DBLP]
Dynamic Succinct Ordered Trees. [Citation Graph (, )][DBLP]
Universal Succinct Representations of Trees? [Citation Graph (, )][DBLP]
Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]
Towards Optimal Range Medians. [Citation Graph (, )][DBLP]
B-Treaps: A Uniquely Represented Alternative to B-Trees. [Citation Graph (, )][DBLP]
Testing Fourier Dimensionality and Sparsity. [Citation Graph (, )][DBLP]
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams. [Citation Graph (, )][DBLP]
Wireless Communication Is in APX. [Citation Graph (, )][DBLP]
The Ehrenfeucht-Silberger Problem. [Citation Graph (, )][DBLP]
Applications of Effective Probability Theory to Martin-Löf Randomness. [Citation Graph (, )][DBLP]
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. [Citation Graph (, )][DBLP]
Popular Mixed Matchings. [Citation Graph (, )][DBLP]
Factoring Groups Efficiently. [Citation Graph (, )][DBLP]
On Finding Dense Subgraphs. [Citation Graph (, )][DBLP]
Learning Halfspaces with Malicious Noise. [Citation Graph (, )][DBLP]
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. [Citation Graph (, )][DBLP]
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. [Citation Graph (, )][DBLP]
Limits and Applications of Group Algebras for Parameterized Problems. [Citation Graph (, )][DBLP]
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. [Citation Graph (, )][DBLP]
Improved Bounds for Flow Shop Scheduling. [Citation Graph (, )][DBLP]
A 3/2-Approximation Algorithm for General Stable Marriage. [Citation Graph (, )][DBLP]
Limiting Negations in Formulas. [Citation Graph (, )][DBLP]
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. [Citation Graph (, )][DBLP]
Superhighness and Strong Jump Traceability. [Citation Graph (, )][DBLP]
Amortized Communication Complexity of Distributions. [Citation Graph (, )][DBLP]
The Number of Symbol Comparisons in QuickSort and QuickSelect. [Citation Graph (, )][DBLP]
Computing the Girth of a Planar Graph in O(n logn) Time. [Citation Graph (, )][DBLP]
Elimination Graphs. [Citation Graph (, )][DBLP]
|
