Entry Anonymous:1992:CPM from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Anonymous:1992:CPM,
  author =       "Anonymous",
  title =        "{Combinatorial Pattern Matching School}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "92",
  number =       "1",
  pages =        "??--??",
  day =          "06",
  month =        jan,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics) and algorithm theory; C1250
                 (Pattern recognition); C4220 (Automata theory); C4240P
                 (Parallel programming and algorithm theory)",
  conflocation = "Paris, France; July 1990",
  conftitle =    "Combinatorial Pattern Matching School",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "acyclic deterministic automata; algorithm theory;
                 automata theory; average-case pattern matching;
                 Boyer--Moore--Horspool algorithm; canonical form;
                 circular string; computational complexity; data
                 compression; dynamic programming; factor automata; fast
                 linear-space computations; linear time; longest common
                 subsequences; minimisation; optimal algorithms; pattern
                 recognition; search problems; string matching",
  pubcountry =   "Netherlands",
}

Related entries