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.

All-pairs shortest paths for unweighted undirected graphs in o(mn) time: Label: en
Vertical ray shooting and computing depth orders for fat objects: Label: en
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting: Label: en
Analysis of incomplete data and an intrinsic-dimension Helly theorem: Label: en
Balanced allocation on graphs: Label: en
Asymmetric balanced allocation with simple hash functions: Label: en
The rainbow skip graph: Label: en
O(log log n)-competitive dynamic binary search trees: Label: en
Rank/select operations on large alphabets: Label: en
Distributed selfish load balancing: Label: en
Efficient construction of unit circular-arc models: Label: en
Cake cutting really is not a piece of cake: Label: en
Lower bounds for asymmetric communication channels and distributed source coding: Label: en
Overhang: Label: en
Morphing orthogonal planar graph drawings: Label: en
Anisotropic surface meshing: Label: en
Tightening non-simple paths and cycles on surfaces: Label: en
Robust shape fitting via peeling and grating coresets: Label: en
Combination can be hard: Label: en
A deterministic subexponential algorithm for solving parity games: Label: en
Approximating unique games: Label: en
On nash equilibria for a network creation game: Label: en
Metric cotype: Label: en
A new approach to proving upper bounds for MAX-2-SAT: Label: en
Pattern matching with address errors: Label: en
Efficient algorithms for substring near neighbor problem: Label: en
Entropy based nearest neighbor search in high dimensions: Label: en
On k-Median clustering in high dimensions: Label: en
Matrix approximation and projective clustering via volume sampling: Label: en
An improved approximation algorithm for combinatorial auctions with submodular bidders: Label: en
Trees and Markov convexity: Label: en
l²₂ spreading metrics for vertex ordering problems: Label: en
Scalable leader election: Label: en
Randomized online algorithms for minimum metric bipartite matching: Label: en
Anytime algorithms for multi-armed bandit problems: Label: en
Oblivious string embeddings and edit distance approximations: Label: en
Weighted isotonic regression under the L₁ norm: Label: en
FPTAS for mixed-integer polynomial optimization with a fixed number of variables: Label: en
Streaming and sublinear approximation of entropy and information distances: Label: en
Approximation algorithms for wavelet transform coding of data streams: Label: en
8/7-approximation algorithm for (1,2)-TSP: Label: en
Approximating the k-multicut problem: Label: en
Tight approximation algorithms for maximum general assignment problems: Label: en
A computational study of external-memory BFS algorithms: Label: en
Cache-oblivious dynamic programming: Label: en
Finding large sticks and potatoes in polygons: Label: en
Solving random satisfiable 3CNF formulas in expected polynomial time: Label: en
Superiority and complexity of the spaced seeds: Label: en
Implicit dictionaries with O(1) modifications per update and fast search: Label: en
Improved approximation algorithms for broadcast scheduling: Label: en