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 35 results in range #1 to #35.

Dynamic partition trees: Label: en
Intersection queries in sets of disks: Label: en
Applications of a semi-dynamic convex hull algorithm: Label: en
Upper envelope onion peeling: Label: en
Complete problems with L-samplable distributions: Label: en
Boyer-Moore approach to approximate string matching: Label: en
Fast algorithms for two dimensional and multiple pattern matching: Label: en
On matroids and hierarchical graphs: Label: en
Canonical representations of partial 2-and 3-trees: Label: en
The pathwidth and treewidth of cographs: Label: en
Efficient parallel algorithms for shortest paths in planar graphs: Label: en
Approximating finite weighted point sets by hyperplanes: Label: en
Space-sweep algorithms for parametric optimization: Label: en
Star unfolding of a polytope with applications: Label: en
Fast algorithms for greedy triangulation: Label: en
Input-sensitive compliant motion in the plane: Label: en
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric: Label: en
A rectilinear steiner minimal tree algorithm for convex point sets: Label: en
A faster parallel algorithm for a matrix searching problem: Label: en
Sorting shuffled monotone sequences: Label: en
Lower bounds for monotonic list labeling: Label: en
Analysis of the expected search cost in skip lists: Label: en
Expected behaviour analysis of AVL trees: Label: en
Ranking trees generated by rotations: Label: en
How to update a balanced binary tree with a constant number of rotations: Label: en
Fast updating of well-balanced trees: Label: en
The visibility diagram: A data structure for visibility problems and motion planning: Label: en
Graphics in flatland revisited: Label: en
Output-sensitive generation of the perspective view of isothetic parallelepipeds: Label: en
Translating polygons with applications to hidden surface removal: Label: en
The file distribution problem for processor networks: Label: en
Finding the k smallest spanning trees: Label: en
Generating sparse spanners for weighted graphs: Label: en
Approximating maximum independent sets by excluding subgraphs: Label: en
Structural complexity theory: Recent surprises: Label: en