An $O(\log \log n)$ PRAM Algorithm for computing all seeds of a string (bibtex)
by Costas S. Iliopoulos, Kunsoo Park
Abstract:
Reference:
An $O(\log \log n)$ PRAM Algorithm for computing all seeds of a string (Costas S. Iliopoulos, Kunsoo Park), In Theoretical Computer Science, volume 164, 1996. ()
Bibtex Entry:
@string{tcs="Theoretical Computer Science"}
@ARTICLE{IP96PRAMSeeds,
  AUTHOR =       "Costas S. Iliopoulos and Kunsoo Park",
  TITLE =        "An {$O(\log \log n)$ PRAM} Algorithm for computing all seeds of a string",
  JOURNAL =      TCS,
  YEAR =         "1996",
  volume =       "164",
  number =       "",
  pages =        "299--310",
  month =        "",
  note =         "",
  abstract =     "",
  keywords =     "",
  source =       ""
}
Powered by bibtexbrowser