Entry Hromkovic:1988:ANA from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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:1988:ANA,
  author =       "J. Hromkovic",
  title =        "The advantages of a new approach to defining the
                 communication complexity for {VLSI}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "57",
  number =       "1",
  pages =        "97--111",
  month =        apr,
  year =         "1988",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "B2570 (Semiconductor integrated circuits); C1260
                 (Information theory); C5620 (Computer networks and
                 techniques)",
  conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
  conftitle =    "International Symposium on Mathematical Foundations of
                 Computer Science",
  corpsource =   "Dept. of Theor. Cybern., Komensky Univ., Bratislava,
                 Czechoslovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean formula; communication complexity; information
                 theory; language recognition; protocols;
                 S-communication complexity; strongest lower bound;
                 VLSI",
  pubcountry =   "Netherlands A05",
  treatment =    "T Theoretical or Mathematical",
}

Related entries