An $O(n \log n)$ cost parallel algorithm for the single function coarsest partition problem (bibtex)
by Apostolico Apostolico, Costas S. Iliopoulos, Robert Paige
Abstract:
Reference:
An $O(n \log n)$ cost parallel algorithm for the single function coarsest partition problem (Apostolico Apostolico, Costas S. Iliopoulos, Robert Paige), In Mathematische Forschung (, ed.), volume , 1987. ()
Bibtex Entry:
@INPROCEEDINGS{AIP87ParallelPartitionProb,
  AUTHOR =       "Apostolico Apostolico and Costas S. Iliopoulos and Robert Paige",
  TITLE =        "An {$O(n \log n)$} cost parallel algorithm for the single function coarsest partition problem",
  BOOKTITLE =    "Mathematische Forschung",
  YEAR =         "1987",
  editor =       "",
  volume =       "",
  number =       "",
  series =       "",
  pages =        "70--76",
  address =      "Band 38, Akademie Verlag, Berlin",
  month =        "",
  organization = "",
  publisher =    "",
  note =         "",
  abstract =     "",
  keywords =     ""
}
Powered by bibtexbrowser