scientific article; zbMATH DE number 1057777

MaRDI QIDQ4352834zbMATH OpenFDO

Authors Jan Petersson

Publication date 12 January 1998

zbMATH Keywords

virtualizationdominance counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to computer science (68-04)

Recommendations

• Parallel algorithms for planar dominance counting
• PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• Optimal randomized parallel algorithms for computational geometry

Cited in

(12)

• Fast algorithms for direct enclosures and direct dominances
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• Geometric algorithms for private-cache chip multiprocessors (extended abstract)
• Fast Algorithms for Geometric Consensuses
• Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem
• Parallel algorithm for computing points on a computation front hyperplane
• An efficient algorithm for maxdominance, with applications
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• Parallel algorithms for planar dominance counting
• A general approach to dominance in the plane
• On the accuracy of the parallel diagonal dominant algorithm
• Direct dominance of points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352834)