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.

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract: Label: en
Hallucination Helps: Energy Efficient Virtual Circuit Routing: Label: en
Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms: Label: en
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints: Label: en
New Approximations for Reordering Buffer Management: Label: en
Fault Tolerant Approximate BFS Structures: Label: en
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths: Label: en
Better Approximation Algorithms for the Graph Diameter: Label: en
Cutting corners cheaply, or how to remove Steiner points: Label: en
Beyond Locality-Sensitive Hashing: Label: en
Disjoint Set Union with Randomized Linking: Label: en
Selection and Sorting in the “Restore” Model: Label: en
Concurrent Range Reporting in Two-Dimensional Space: Label: en
Near-optimal labeling schemes for nearest common ancestors: Label: en
Cache-Adaptive Algorithms: Label: en
Maximizing Social Influence in Nearly Optimal Time: Label: en
Pipage Rounding, Pessimistic Estimators and Matrix Concentration: Label: en
A constructive algorithm for the Lovász Local Lemma on permutations: Label: en
Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut: Label: en
Smoothed Analysis of Local Search for the Maximum-Cut Problem: Label: en
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes: Label: en
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence: Label: en
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles: Label: en
Integer quadratic programming in the plane: Label: en
Polynomiality for Bin Packing with a Constant Number of Item Types: Label: en
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids: Label: en
Tight Bounds for Rumor Spreading with Vertex Expansion: Label: en
Faster Agreement via a Spectral Method for Detecting Malicious Behavior: Label: en
Timing in chemical reaction networks: Label: en
Intrinsic universality in tile self-assembly requires cooperation: Label: en
Approximating matching size from random streams: Label: en
An Optimal Lower Bound for Distinct Elements in the Message Passing Model: Label: en
Relative Errors for Deterministic Low-Rank Matrix Approximations: Label: en
Annotations for Sparse Data Streams: Label: en
Improved Concentration Bounds for Count-Sketch: Label: en
On the optimality of approximation schemes for the classical scheduling problem: Label: en
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices: Label: en
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage: Label: en
Approximating k-center in planar graphs: Label: en
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.: Label: en
Large induced subgraphs via triangulations and CMSO: Label: en
Independent Set in P₅-Free Graphs in Polynomial Time: Label: en
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity: Label: en
On the compatibility of quartet trees: Label: en
Exploiting Metric Structure for Efficient Private Query Release: Label: en
Learning Entangled Single-Sample Gaussians: Label: en
Learning Sparse Polynomial Functions: Label: en
(Nearly) Sample-Optimal Sparse Fourier Transform: Label: en
Maintaining Assignments Online: Matching, Scheduling, and Flows: Label: en
Online Steiner Tree with Deletions: Label: en