The subtree max gap problem with application to parallel string covering

Ben-Amram, A. M.; Berkman, Omer; Iliopoulos, Costas S.; Park, Kundoo

by A. M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kundoo Park

Abstract:

Reference:

The subtree max gap problem with application to parallel string covering (A. M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kundoo Park), In Proceedings 5--th ACM--SIAM Symposium on Discrete Algorithms (, ed.), volume , 1994. ()

Bibtex Entry:

@INPROCEEDINGS{BBI94SubtreeMaxGapParallelCovering,
  AUTHOR =       "A. M. Ben-Amram and Omer Berkman and Costas S. Iliopoulos and Kundoo Park",
  TITLE =        "The subtree max gap problem with application to parallel string covering",
  BOOKTITLE =    "Proceedings 5--th ACM--SIAM Symposium on Discrete Algorithms",
  YEAR =         "1994",
  editor =       "",
  volume =       "",
  number =       "",
  series =       "",
  pages =        "501--510",
  address =      "",
  month =        "",
  organization = "",
  publisher =    "",
  note =         "",
  abstract =     "",
  keywords =     ""
}