Entry Christou:2013:ESC from tcs2010.bib

Last update: Sun Mar 31 03:12:29 MDT 2019                Valid HTML 4.0!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Christou:2013:ESC,
  author =       "M. Christou and M. Crochemore and C. S. Iliopoulos and
                 M. Kubica and S. P. Pissis and J. Radoszewski and W.
                 Rytter and B. Szreder and T. Wale{\'n}",
  title =        "Efficient seed computation revisited",
  journal =      j-THEOR-COMP-SCI,
  volume =       "483",
  number =       "??",
  pages =        "171--181",
  day =          "29",
  month =        apr,
  year =         "2013",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2011.12.078",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon May 6 18:32:37 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397511010632",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cover; linear time cover algorithm; seed in a string;
                 suffix tree",
}

Related entries