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.

Approximation Algorithms for Movement Repairmen: Label: en
Fast Simulation of Large-Scale Growth Models: Label: en
Smooth Analysis of the Condition Number and the Least Singular Value: Label: en
Improved Polynomial Identity Testing for Read-Once Formulas: Label: en
Testing Computability by Width Two OBDDs: Label: en
Small Clique Detection and Approximate Nash Equilibria: Label: en
Small-Bias Spaces for Group Products: Label: en
Testing ±1-weight halfspace: Label: en
The Glauber Dynamics for Colourings of Bounded Degree Trees: Label: en
Pseudorandom Bit Generators That Fool Modular Sums: Label: en
Tolerant Linearity Testing and Locally Testable Codes: Label: en
Succinct Representation of Codes with Applications to Testing: Label: en
Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions: Label: en
Algorithmic Aspects of Property Testing in the Dense Graphs Model: Label: en
Pseudorandom Generators and Typically-Correct Derandomization: Label: en
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND: Label: en
Hierarchy Theorems for Property Testing: Label: en
Efficient Quantum Tensor Product Expanders and k-Designs: Label: en
An Analysis of Random-Walk Cuckoo Hashing: Label: en
How Well Do Random Walks Parallelize?: Label: en
Extractors Using Hardness Amplification: Label: en
A Hypergraph Dictatorship Test with Perfect Completeness: Label: en
Average-Case Analyses of Vickrey Costs: Label: en
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry: Label: en
Random Tensors and Planted Cliques: Label: en
On the Security of Goldreich’s One-Way Function: Label: en
Composition of Semi-LTCs by Two-Wise Tensor Products: Label: en
Random Low Degree Polynomials are Hard to Approximate: Label: en
Strong Parallel Repetition Theorem for Free Projection Games: Label: en
Deterministic Approximation Algorithms for the Nearest Codeword Problem: Label: en
On the Complexity of the Asymmetric VPN Problem: Label: en
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs: Label: en
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem: Label: en
Approximating Node-Connectivity Augmentation Problems: Label: en
Minimizing Average Shortest Path Distances via Shortcut Edge Addition: Label: en
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy: Label: en
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties: Label: en
Approximating Some Network Design Problems with Node Costs: Label: en
Real-Time Message Routing and Scheduling: Label: en
On Hardness of Pricing Items for Single-Minded Bidders: Label: en
On the Optimality of Gluing over Scales: Label: en
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems: Label: en
Improved Inapproximability Results for Maximum k-Colorable Subgraph: Label: en
Scheduling with Outliers: Label: en
An Approximation Scheme for Terrain Guarding: Label: en
Optimal Sherali-Adams Gaps from Pairwise Independence: Label: en
PASS Approximation: Label: en
New Hardness Results for Diophantine Approximation: Label: en
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders: Label: en
Resource Minimization Job Scheduling: Label: en