Entry Fill:1996:LRC from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Fill:1996:LRC,
  author =       "James Allen Fill",
  title =        "Limits and rates of convergence for the distribution
                 of search cost under the move-to-front rule",
  journal =      j-THEOR-COMP-SCI,
  volume =       "164",
  number =       "1--2",
  pages =        "185--206",
  day =          "10",
  month =        sep,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=164&issue=1-2&aid=2151",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4240 (Programming
                 and algorithm theory); C4240C (Computational
                 complexity)",
  corpsource =   "Dept. of Math. Sci., Johns Hopkins Univ., Baltimore,
                 MD, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algorithm theory; asymptotic distribution;
                 computational complexity; convergence; Markov chain;
                 move-to-front rule; search cost; search problems;
                 self-organizing lists; stationarity; total variation
                 distance",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries