scientific article; zbMATH DE number 4045190

MaRDI QIDQ3782811zbMATH OpenFDO

Authors Alberto Apostolico, Costas S. Iliopoulos, Robert Paige

Publication date 1987

zbMATH Keywords

CRCW PRAM algorithmsingle function coarsest partition problem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• An efficient parallel algorithm for the single function coarsest partition problem
• scientific article; zbMATH DE number 2080064
• scientific article; zbMATH DE number 2013188
• Three Partition Refinement Algorithms
• Fast and efficient parallel coarsest refinement

Cited in

(9)

• Optimal algorithms for computing the canonical form of a circular string
• The parallel complexity of coarsest set partition problems
• An efficient parallel algorithm for the single function coarsest partition problem
• scientific article; zbMATH DE number 3883625 (Why is no real title available?)
• scientific article; zbMATH DE number 2013188 (Why is no real title available?)
• Fast and efficient parallel coarsest refinement
• Quantum algorithm for lexicographically minimal string rotation
• Near-optimal quantum algorithms for string problems
• A note on quantum divide and conquer for minimal string rotation

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