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 #51 to #100.

Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach: Label: en
Faster Fully Dynamic Matchings with Small Approximation Ratios: Label: en
Weighted dynamic finger in binary search trees: Label: en
Balanced Allocation: Patience is not a Virtue: Label: en
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness: Label: en
Stabilizing Consensus with Many Opinions: Label: en
Markovian Hitters and the Complexity of Blind Rendezvous: Label: en
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees: Label: en
Jointly Private Convex Programming: Label: en
Non-convex Compressed Sensing with the Sum-of-Squares Method: Label: en
Weighted SGD for ℓ_p Regression with Randomized Preconditioning: Label: en
Sparse Approximation via Generating Point Sets: Label: en
Towards Optimal Algorithms for Prediction with Expert Advice: Label: en
Canonical Paths for MCMC: from Art to Science: Label: en
Random-Cluster Dynamics in ℤ²: Label: en
Evolutionary Dynamics in Finite Populations Mix Rapidly: Label: en
Bounds for Random Constraint Satisfaction Problems via Spatial Coupling: Label: en
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs: Label: en
A Fast Approximation for Maximum Weight Matroid Intersection: Label: en
Exact and Approximation Algorithms for Weighted Matroid Intersection: Label: en
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions: Label: en
Improved Approximation Algorithms for k-Submodular Function Maximization: Label: en
Deterministic Algorithms for Submodular Maximization Problems: Label: en
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs: Label: en
New Bounds for Approximating Extremal Distances in Undirected Graphs: Label: en
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff: Label: en
Simpler, faster and shorter labels for distances in graphs: Label: en
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching: Label: en
The Restricted Isometry Property of Subsampled Fourier Matrices: Label: en
Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities: Label: en
An Improved Distributed Algorithm for Maximal Independent Set: Label: en
Expanders via Local Edge Flips: Label: en
The Adversarial Noise Threshold for Distributed Protocols: Label: en
Local-on-Average Distributed Tasks: Label: en
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut: Label: en
Online Pricing with Impatient Bidders: Label: en
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time: Label: en
Online Degree-Bounded Steiner Network Design: Label: en
An ℴ(log m)-Competitive Algorithm for Online Machine Minimization: Label: en
Make-to-Order Integrated Scheduling and Distribution: Label: en
The Complexity of All-switches Strategy Improvement: Label: en
Learning and Efficiency in Games with Dynamic Population: Label: en
Characterisation of Strongly Stable Matchings: Label: en
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market: Label: en
Designing Networks with Good Equilibria under Uncertainty: Label: en
Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions: Label: en
Phase Transitions in Group Testing: Label: en
Undirected Graph Exploration with ⊝(log log n) Pebbles: Label: en
New directions in nearest neighbor searching with applications to lattice sieving: Label: en
Locality-sensitive Hashing without False Negatives: Label: en