Entry Palko:1991:ACM 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{Palko:1991:ACM,
  author =       "V. Palko and O. Sykora and I. Vrto",
  title =        "Area complexity of merging",
  journal =      j-THEOR-COMP-SCI,
  volume =       "82",
  number =       "1",
  pages =        "157--163",
  day =          "22",
  month =        may,
  year =         "1991",
  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 = "B2570 (Semiconductor integrated circuits); C4240
                 (Programming and algorithm theory); C6130 (Data
                 handling techniques)",
  corpsource =   "Inst. of Tech. Cybern., Slovak Acad. of Sci.,
                 Bratislava, Czechoslovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "area complexity; area-time squared tradeoff;
                 complexity measures; computational complexity;
                 l-selection; merging; optimal algorithms; optimal lower
                 bounds; ordering; sorting; VLSI; VLSI complexity; VLSI
                 sorting algorithms",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries