scientific article; zbMATH DE number 4060711

MaRDI QIDQ3795217zbMATH OpenFDO

Authors S. R. Kosaraju, Mikhail J. Atallah, Michael T. Goodrich

Publication date 1988

zbMATH Keywords

parallel complexityprocessor complexityset-manipulation operations

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Parallel algorithms for evaluating sequences of set-manipulation operations
• Parallelization of implementations of purely sequential algorithms
• Parallel algorithms for partitioning sorted sets and related problems
• Parallel algorithms for partitioning sorted sets and related problems
• scientific article; zbMATH DE number 4131653
• Parallel algorithms for arrangements
• Parallel algorithms for maximal acyclic sets
• An optimal parallel algorithm for sorting multisets
• Parallelizing a new algorithm for the set partition problem
• On Efficient Parallel Algorithms for Solving Set Recurrence Equations

Cited in

(5)

• Dynamic parallel evaluation of the cross-product set using time-stamps
• Sweep methods for parallel computational geometry
• Parallel algorithms for evaluating sequences of set-manipulation operations
• Sorting on a parallel pointer machine with applications to set expression evaluation
• A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle

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 Q3795217)