Entry Fredman:1976:HGI from tcs1975.bib

Last update: Thu Sep 27 02:46:39 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | Y | Z

BibTeX entry

@Article{Fredman:1976:HGI,
  author =       "M. L. Fredman",
  title =        "How good is the information theory bound in sorting?",
  journal =      j-THEOR-COMP-SCI,
  volume =       "1",
  number =       "4",
  pages =        "355--361",
  month =        apr,
  year =         "1976",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math., MIT, Cambridge, MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "disjoint subsets; information theory bound; nonempty
                 subsets; sorting",
  pubcountry =   "Netherlands",
  treatment =    "A Application; T Theoretical or Mathematical",
}

Related entries