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.

The Maximum Number of Minimal Dominating Sets in a Tree: Label: en
Approximating LCS in Linear Time: Beating the √n Barrier: Label: en
Efficiently Approximating Edit Distance Between Pseudorandom Strings: Label: en
Lower bounds for text indexing with mismatches and differences: Label: en
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts: Label: en
The streaming k-mismatch problem: Label: en
Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems: Label: en
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs: Label: en
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity: Label: en
XOR Codes and Sparse Learning Parity with Noise: Label: en
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices: Label: en
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract: Label: en
On the rank of a random binary matrix: Label: en
Nash Flows Over Time with Spillback: Label: en
Computing all Wardrop Equilibria parametrized by the Flow Demand: Label: en
Improving the smoothed complexity of FLIP for max cut problems: Label: en
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions: Label: en
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes): Label: en
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma: Label: en
Distributed Triangle Detection via Expander Decomposition: Label: en
Distributed Maximal Independent Set using Small Messages: Label: en
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model: Label: en
Sublinear Algorithms for (Δ + 1) Vertex Coloring: Label: en
A PTAS for ℓ_p-Low Rank Approximation: Label: en
Testing Matrix Rank, Optimally: Label: en
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty: Label: en
Testing Halfspaces over Rotation-Invariant Distributions: Label: en
A<scp>naconda</scp>: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing: Label: en
Quantum algorithms and approximating polynomials for composed functions with shared inputs: Label: en
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials: Label: en
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits: Label: en
Pseudorandomness for read-k DNF formulas: Label: en
Reproducibility and Pseudo-Determinism in Log-Space: Label: en
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time: Label: en
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs: Label: en
Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities and Multiple Sources and Sinks: Label: en
On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs: Label: en
Flow-Cut Gaps and Face Covers in Planar Graphs: Label: en
Fast greedy for linear matroids: Label: en
Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication: Label: en
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms: Label: en
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain: Label: en
An Algorithmic Blend of LPs and Ring Equations for Promise CSPs: Label: en
Extremal and probabilistic results for order types: Label: en
New Lower Bounds for the Number of Pseudoline Arrangements: Label: en
Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons: Label: en
Colored range closest-pair problem under general distance functions: Label: en
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances: Label: en
Stochastic ℓ_p Load Balancing and Moment Problems via the L-Function Method: Label: en
Stochastic Submodular Cover with Limited Adaptivity: Label: en