Parallel algorithms for evaluating sequences of set-manipulation operations

DOI10.1145/195613.195617MaRDI QIDQ4327628zbMATH OpenOpenAlexFDO

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

Publication date 10 April 1995

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1692&context=cstech

zbMATH Keywords

off-line evaluationparallel complexityparallel data structures

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4060711
• 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
• scientific article; zbMATH DE number 4060711 (Why is no real title available?)
• An efficient algorithm for the 1D total visibility-index problem and its parallelization
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
• Processing an Offline Insertion-Query Sequence with Applications

This page was built for publication: Parallel algorithms for evaluating sequences of set-manipulation operations

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