The following pages link to Algorithm Theory — SWAT '92 (Q5056123):
Displaying 36 items.
- Direct bulk-synchronous parallel algorithms (Q5056124) (← links)
- Memory limited inductive inference machines (Q5056125) (← links)
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs (Q5056126) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- An elementary approach to some analytic asymptotics (Q5056128) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)
- Parallel algorithm for cograph recognition with applications (Q5056132) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- Optimal multi-packet routing on the torus (Q5056134) (← links)
- Parallel algorithms for priority queue operations (Q5056135) (← links)
- Heap construction in the parallel comparison tree model (Q5056136) (← links)
- Efficient rebalancing of chromatic search trees (Q5056137) (← links)
- The complexity of scheduling problems with communication delays for trees (Q5056138) (← links)
- The list update problem and the retrieval of sets (Q5056139) (← links)
- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization (Q5056141) (← links)
- Fractional cascading simplified (Q5056142) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- Fully dynamic 2-edge-connectivity in planar graphs (Q5056144) (← links)
- Non-interfering network flows (Q5056145) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- How to draw a series-parallel digraph (Q5056147) (← links)
- Coloring random graphs (Q5056148) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- Convex polygons made from few lines and convex decompositions of polyhedra (Q5056156) (← links)
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity (Q5056157) (← links)
- Voronoi diagrams of moving points in higher dimensional spaces (Q5056158) (← links)
- Sorting multisets stably in minimum space (Q5056159) (← links)
- A framework for adaptive sorting (Q5056160) (← links)
