The parallel complexity of coarsest set partition problems

Authors:
Sang Cho;Dung T. Huynh
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1992

Citing 0
Cited 3

An efficient parallel algorithm for the single function coarsest partition problem

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A Parallel DFA Minimization Algorithm

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
A Parallel Algorithm for Minimization of Finite Automata

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium

Quantified Score

Hi-index	0.89

Visualization

Abstract