Entry Hromkovic:1994:SHC 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{Hromkovic:1994:SHC,
  author =       "Juraj Hromkovi{\v{c}} and Jarkko Kari and Lila Kari",
  title =        "Some hierarchies for the communication complexity
                 measures of cooperating grammar systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "127",
  number =       "1",
  pages =        "123--147",
  day =          "09",
  month =        may,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:06 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&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=1994&volume=127&issue=1&aid=1434",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Paderborn Univ.,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "communication complexity measures; computational
                 complexity; cooperating grammar systems; formal
                 language theory; grammars; hierarchies; lower-bound
                 proof techniques; parallel algorithms; parallel
                 communicating grammar systems; pumping lemmas",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries