Entry Srinivas:1993:STA 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{Srinivas:1993:STA,
  author =       "Yellamraju V. Srinivas",
  title =        "A sheaf-theoretic approach to pattern matching and
                 related problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "112",
  number =       "1",
  pages =        "53--97",
  day =          "26",
  month =        apr,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:09 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=112&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=112&issue=1&aid=1301",
  acknowledgement = ack-nhfb,
  classification = "C1250 (Pattern recognition); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Kestrel Inst., Palo Alto, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; generalized version;
                 geometric view; grammars; Grothendieck topology;
                 Knuth-Morris-Pratt string-matching algorithm; modulo
                 commutativity; n-queens problem; parsing; pattern
                 matching; pattern recognition; scene analysis;
                 sheaf-theoretic approach; Waltz filtering",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries