The parallel complexity of coarsest set partition problems

DOI10.1016/0020-0190(92)90095-DMaRDI QIDQ1198030zbMATH OpenFDO

Authors Sang Cho, Dung T. Huynh

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90095-D

zbMATH Keywords

coarsest set partition problemsparallel algorithmsparallel complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4045190
• An efficient parallel algorithm for the single function coarsest partition problem
• On the complexity of some partition problems
• Fast and efficient parallel coarsest refinement
• scientific article; zbMATH DE number 2013188

Cites work

• A linear time solution to the single function coarsest partition problem
• A parallel algorithm for the minimization of finite state automata
• A taxonomy of problems with fast parallel algorithms
• CCS expressions, finite state processes, and three problems of equivalence
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Nondeterministic Space is Closed under Complementation
• The method of forced enumeration for nondeterministic automata
• Three Partition Refinement Algorithms

Cited in

(10)

• On the complexity of assembly partitioning
• An efficient parallel algorithm for the single function coarsest partition problem
• Parallel algorithms for partitioning sorted sets and related problems
• scientific article; zbMATH DE number 3883625 (Why is no real title available?)
• An efficient algorithm for a special case of the set partition problem
• On deciding some equivalences for concurrent processes
• scientific article; zbMATH DE number 2013188 (Why is no real title available?)
• scientific article; zbMATH DE number 2080064 (Why is no real title available?)
• Fast and efficient parallel coarsest refinement
• An evaluation of massively parallel algorithms for DFA minimization

This page was built for publication: The parallel complexity of coarsest set partition problems

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