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

A framework for adaptive sorting: Label: en
Sorting multisets stably in minimum space: Label: en
Voronoi diagrams of moving points in higher dimensional spaces: Label: en
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity: Label: en
Convex polygons made from few lines and convex decompositions of polyhedra: Label: en
Decomposing the boundary of a nonconvex polyhedron: Label: en
Two- and three- dimensional point location in rectangular subdivisions: Label: en
Dynamic closest pairs — A probabilistic approach: Label: en
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs: Label: en
Improvements on geometric pattern matching problems: Label: en
Parametric problems on graphs of bounded tree-width: Label: en
Testing superperfection of k-trees: Label: en
Coloring random graphs: Label: en
How to draw a series-parallel digraph: Label: en
Triangulating planar graphs while minimizing the maximum degree: Label: en
Non-interfering network flows: Label: en
Fully dynamic 2-edge-connectivity in planar graphs: Label: en
Dynamic 2- and 3-connectivity on planar graphs: Label: en
Fractional cascading simplified: Label: en
Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization: Label: en
The list update problem and the retrieval of sets: Label: en
The complexity of scheduling problems with communication delays for trees: Label: en
Efficient rebalancing of chromatic search trees: Label: en
Heap construction in the parallel comparison tree model: Label: en
Parallel algorithms for priority queue operations: Label: en
Optimal multi-packet routing on the torus: Label: en
Parallel algorithms for all minimum link paths and link center problems: Label: en
Parallel algorithm for cograph recognition with applications: Label: en
Low-diameter graph decomposition is in NC: Label: en
Generating sparse 2—spanners: Label: en
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications: Label: en
An elementary approach to some analytic asymptotics: Label: en
On small depth threshold circuits: Label: en
Retrieval of scattered information by EREW, CREW and CRCW PRAMs: Label: en
Memory limited inductive inference machines: Label: en
Direct bulk-synchronous parallel algorithms: Label: en