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.

Efficient quantum protocols for XOR functions: Label: en
Finding orthogonal vectors in discrete structures: Label: en
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets: Label: en
Causal Erasure Channels: Label: en
Broadcast Throughput in Radio Networks: Routing vs. Network Coding: Label: en
A subexponential parameterized algorithm for Subset TSP on planar graphs: Label: en
Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs: Label: en
A Near-Optimal Planarization Algorithm: Label: en
Hypercontractive inequalities via SOS, and the Frankl–Rödl graph: Label: en
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions): Label: en
Half-integrality, LP-branching and FPT Algorithms: Label: en
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems: Label: en
Linear-Time FPT Algorithms via Network Flow: Label: en
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs: Label: en
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts: Label: en
Point Line Cover: The Easy Kernel is Essentially Tight: Label: en
Minimum d-dimensional arrangement with fixed points: Label: en
On Sketching Matrix Norms and the Top Singular Vector: Label: en
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs: Label: en
Approximation-Tolerant Model-Based Compressive Sensing: Label: en
Model-based Sketching and Recovery with Expanders: Label: en
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems: Label: en
New constructions of RIP matrices with fast multiplication and fewer rows: Label: en
Approximating Minimum Cost Connectivity Orientation and Augmentation: Label: en
Fast algorithms for maximizing submodular functions: Label: en
The Generalized Terminal Backup Problem: Label: en
Influence Maximization in Undirected Networks: Label: en
Maximizing Bisubmodular and k-Submodular Functions: Label: en
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover: Label: en
Submodular Maximization with Cardinality Constraints: Label: en
Making Octants Colorful and Related Covering Decomposition Problems: Label: en
Fast Computation of Output-Sensitive Maxima in a Word RAM: Label: en
Four Soviets Walk the Dog—with an Application to Alt's Conjecture: Label: en
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges: Label: en
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension: Label: en
Prophet Inequalities with Limited Information: Label: en
Constrained Signaling in Auction Design: Label: en
On Computability of Equilibria in Markets with Production: Label: en
The Complexity of Optimal Multidimensional Pricing: Label: en
The Complexity of Optimal Mechanism Design: Label: en
Streaming Balanced Graph Partitioning Algorithms for Random Graphs: Label: en
Flow-Based Algorithms for Local Graph Clustering: Label: en
Partitioning into Expanders: Label: en
Approximation Algorithm for Sparsest k-Partitioning: Label: en
Non-Uniform Graph Partitioning: Label: en
A Cubic Algorithm for Computing Gaussian Volume: Label: en
Testing Surface Area: Label: en
Optimal Algorithms for Testing Closeness of Discrete Distributions: Label: en
Testing equivalence between distributions using conditional samples: Label: en
Hereditary properties of permutations are strongly testable: Label: en