Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials: Label: en
Fully Dynamic Matching in Bipartite Graphs: Label: en
Testing Linear-Invariant Function Isomorphism: Label: en
Approximating the Diameter of Planar Graphs in Near Linear Time: Label: en
The Complexity of Infinitely Repeated Alternating Move Games: Label: en
The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom: Label: en
Large Neighborhood Local Search for the Maximum Set Packing Problem: Label: en
A Composition Theorem for the Fourier Entropy-Influence Conjecture: Label: en
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms: Label: en
Dual Techniques for Scheduling on a Machine with Varying Speed: Label: en
Graph Reconstruction via Distance Oracles: Label: en
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation: Label: en
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,: Label: en
Model Checking Lower Bounds for Simple Graphs: Label: en
Arithmetic Circuit Lower Bounds via MaxRank: Label: en
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization: Label: en
Small Stretch Pairwise Spanners: Label: en
A Robust AFPTAS for Online Bin Packing with Polynomial Migration,: Label: en
Robust Pseudorandom Generators: Label: en
On Model-Based RIP-1 Matrices: Label: en
On the Complexity of Broadcast Setup: Label: en
Local Correctability of Expander Codes: Label: en
Arthur-Merlin Streaming Complexity: Label: en
Dynamic Compressed Strings with Random Access: Label: en
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete: Label: en
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets: Label: en
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions: Label: en
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk: Label: en
On the Power of Deterministic Mechanisms for Facility Location Games: Label: en
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds: Label: en
Clustering in the Boolean Hypercube in a List Decoding Regime: Label: en
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal: Label: en
Combining Binary Search Trees: Label: en
Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree: Label: en
Counting Matchings of Size k Is $\sharp$ W[1]-Hard: Label: en
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy: Label: en
Maximum Edge-Disjoint Paths in k-Sums of Graphs: Label: en
New Doubling Spanners: Better and Simpler: Label: en
On Randomized Online Labeling with Polynomially Many Labels: Label: en
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm: Label: en
Exact and Efficient Generation of Geometric Random Variates and Random Graphs: Label: en
How Hard Is Counting Triangles in the Streaming Model?: Label: en
Direct Product via Round-Preserving Compression: Label: en
On the Complexity of Higher Order Abstract Voronoi Diagrams: Label: en
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth: Label: en
Optimal Orthogonal Graph Drawing with Convex Bend Costs: Label: en
Noncommutativity Makes Determinants Hard: Label: en
Tree Compression with Top Trees: Label: en
Sparse Suffix Tree Construction in Small Space: Label: en
An Algebraic Characterization of Testable Boolean CSPs: Label: en