Entry Bentley:2001:AAS from dr-dobbs-2000.bib

Last update: Fri Jan 5 02:08:04 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Bentley:2001:AAS,
  author =       "Jon Bentley",
  title =        "Algorithm Alley: Suffix arrays",
  journal =      j-DDJ,
  volume =       "26",
  number =       "4",
  pages =        "145--147",
  month =        apr,
  year =         "2001",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Mar 13 15:22:36 MST 2001",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/dr-dobbs-2000.bib",
  URL =          "http://www.ddj.com/ftp/2001/2001_04/aa0401.txt",
  abstract =     "Suffix trees are simple, yet powerful, data
                 structures: Fill an array with pointers to every
                 position in a string, sort the array, then quickly
                 search the string for long phrases. Additional
                 resources include aa0401.txt (listings).",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.ddj.com/",
}

Related entries