The parallel complexity of coarsest set partition problems

DOI10.1016/0020-0190(92)90095-DzbMath0780.68056MaRDI QIDQ1198030

Dung T. Huynh, Sang Cho

Publication date: 16 January 1993

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

zbMATH Keywords

parallel algorithmsparallel complexitycoarsest set partition problems

Mathematics Subject Classification ID

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

Related Items (2)

An efficient parallel algorithm for the single function coarsest partition problem ⋮ On deciding some equivalences for concurrent processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• A linear time solution to the single function coarsest partition problem
• The method of forced enumeration for nondeterministic automata
• A taxonomy of problems with fast parallel algorithms
• Three Partition Refinement Algorithms
• Nondeterministic Space is Closed under Complementation
• A parallel algorithm for the minimization of finite state automata

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