Pages that link to "Item:Q3763585"
From MaRDI portal
The following pages link to Applying Parallel Computation Algorithms in the Design of Serial Algorithms (Q3763585):
Displaying 50 items.
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint (Q1069860) (← links)
- Parallel and sequential computation: A statistician's view (Q1084862) (← links)
- Partitioning point sets in arbitrary dimension (Q1088420) (← links)
- A linear time randomizing algorithm for searching ranked functions (Q1101237) (← links)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Randomized optimal algorithm for slope selection (Q1182097) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Compact location problems (Q1391322) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Placing two disks in a convex polygon (Q1583047) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- Computing the similarity between moving curves (Q1615772) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Optimization with additional variables and constraints (Q1779712) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Synergy in parallel algorithms (Q1823662) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- Efficient algorithms for the minimum diameter bridge problem (Q1869735) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
