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 #101 to #150.

Generic quantum Fourier transforms: Label: en
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching: Label: en
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time: Label: en
Bin Packing via Discrepancy of Permutations: Label: en
The Simplex Algorithm Is NP-Mighty: Label: en
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor: Label: en
Approximating Semi-matchings in Streaming and in Two-Party Communication: Label: en
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions: Label: en
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks: Label: en
A PTAS for Euclidean TSP with Hyperplane Neighborhoods: Label: en
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces: Label: en
Partial fillup and search time in LC tries: Label: en
Distribution-free Junta Testing: Label: en
For-All Sparse Recovery in Near-Optimal Time: Label: en
Better Distance Preservers and Additive Spanners: Label: en
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem: Label: en
Zip Trees: Label: en
Approximating Geometric Knapsack via L-packings: Label: en
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain: Label: en
Querying a Matrix through Matrix-Vector Products: Label: en
Smaller Cuts, Higher Lower Bounds: Label: en
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching: Label: en
Sublinear Random Access Generators for Preferential Attachment Graphs: Label: en
The Quest for Strong Inapproximability Results with Perfect Completeness: Label: en
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space: Label: en
Discrete Fréchet Distance under Translation: Label: en
On β-Plurality Points in Spatial Voting Games: Label: en
Online Service with Delay: Label: en
The Complexity of Approximately Counting Retractions to Square-free Graphs: Label: en
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains: Label: en
The Infinite Server Problem: Label: en
Improving the Smoothed Complexity of FLIP for Max Cut Problems: Label: en
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls: Label: en
Sparse Backbone and Optimal Distributed SINR Algorithms: Label: en
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space: Label: en
Navigating in Trees with Permanently Noisy Advice: Label: en
Node-weighted Network Design in Planar and Minor-closed Families of Graphs: Label: en
Finding a Shortest Odd Hole: Label: en
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems: Label: en
2-Approximating Feedback Vertex Set in Tournaments: Label: en
r -Simple k -Path and Related Problems Parameterized by k / r: Label: en
Journey to the Center of the Point Set: Label: en
Optimal-Time Dictionary-Compressed Indexes: Label: en
Optimal Substring Equality Queries with Applications to Sparse Text Indexing: Label: en
Randomized Contractions Meet Lean Decompositions: Label: en
Fine-grained Complexity Analysis of Two Classic TSP Variants: Label: en
Zeros of Holant Problems: Label: en
Tight Bounds for Online TSP on the Line: Label: en
Deterministic APSP, Orthogonal Vectors, and More: Label: en
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma: Label: en