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.

Exponentially improved algorithms and lower bounds for testing signed majorities: Label: en
Frozen variables in random boolean constraint satisfaction problems: Label: en
Skew Bisubmodularity and Valued CSPs: Label: en
Dichotomy for Holant Problems with a Function on Domain Size 3: Label: en
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis: Label: en
Exponential Lower Bounds for the PPSZ k-SAT Algorithm: Label: en
A Unified Approach to Truthful Scheduling on Related Machines: Label: en
Towards Polynomial Simplex-Like Algorithms for Market Equilibria: [Extended Abstract]: Label: en
Online submodular welfare maximization: Greedy is optimal: Label: en
Communication Complexity of Combinatorial Auctions with Submodular Valuations: Label: en
Approximating Non-Uniform Sparsest Cut via Generalized Spectra: Label: en
Regret Minimization for Reserve Prices in Second-Price Auctions: Label: en
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection: Label: en
Smoothed Analysis of the Successive Shortest Path Algorithm: Label: en
Near-Optimal Range Reporting Structures for Categorical Data: Label: en
Breaking the O(n^2.5) Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow: Label: en
The Space Complexity of 2-Dimensional Approximate Range Counting: Label: en
Approximate Maximum Flow on Separable Undirected Graphs: Label: en
Adaptive and Approximate Orthogonal Range Counting: Label: en
Decremental maintenance of strongly connected components: Label: en
Compressed Static Functions with Applications: Label: en
Dynamic graph connectivity in polylogarithmic worst case time: Label: en
Twisted Tabulation Hashing: Label: en
Minimizing the number of lattice points in a translated polygon: Label: en
Weighted Graph Laplace Operator under Topological Noise: Label: en
An Infinite Class of Sparse-Yao Spanners: Label: en
Algorithms for the Densest Sub-Lattice Problem: Label: en
The complexity of detecting taut angle structures on triangulations: Label: en
Lattice Sparsification and the Approximate Closest Vector Problem: Label: en
Fast matrix multiplication using coherent configurations: Label: en
Approximate Shortest Descending Paths: Label: en
Breaking the n^log ⁿ Barrier for Solvable-Group Isomorphism: Label: en
Weighted Flowtime on Capacitated Machines: Label: en
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio: Label: en
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems: Label: en
Totally odd subdivisions and parity subdivisions: Structures and Coloring: Label: en
List-coloring embedded graphs: Label: en
5-coloring K_3,k-minor-free graphs: Label: en
Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching: Label: en
A Constant Factor Approximation Algorithm for Reordering Buffer Management: Label: en
Online Mixed Packing and Covering: Label: en
Lyndon Words and Short Superstrings: Label: en
Correlation Decay up to Uniqueness in Spin Systems: Label: en
Approximate Counting via Correlation Decay on Planar Graphs: Label: en
Energy Efficient Scheduling of Parallelizable Jobs: Label: en
Convergence of Multivariate Belief Propagation, with Applications to Cuckoo Hashing and Load Balancing: Label: en
Minimum Makespan Scheduling with Low Rank Processing Times: Label: en
Balls into Bins via Local Search: Label: en
Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations: Label: en
New Approximability Results for Two-Dimensional Bin Packing: Label: en