scientific article; zbMATH DE number 4045190

zbMATH Open0641.68106MaRDI QIDQ3782811FDOQ3782811

Alberto Apostolico, Robert Paige, Costas S. Iliopoulos

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

CRCW PRAM algorithmsingle function coarsest partition problem

Mathematics Subject Classification ID

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

Cited In (7)

• Quantum algorithm for lexicographically minimal string rotation
• Optimal algorithms for computing the canonical form of a circular string
• Title not available (Why is that?)
• Near-optimal quantum algorithms for string problems
• Title not available (Why is that?)
• An efficient parallel algorithm for the single function coarsest partition problem
• The parallel complexity of coarsest set partition problems

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)