Entry Oommen:1993:OAL 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{Oommen:1993:OAL,
  author =       "B. John Oommen and David T. H. Ng",
  title =        "An optimal absorbing list organization strategy with
                 constant memory requirements",
  journal =      j-THEOR-COMP-SCI,
  volume =       "119",
  number =       "2",
  pages =        "355--361",
  day =          "25",
  month =        oct,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:38 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=119&issue=2;
                 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=1993&volume=119&issue=2&aid=1369",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6120 (File
                 organisation); C6130 (Data handling techniques)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "constant memory; data structures; ergodic rule; hybrid
                 reorganization scheme; list processing; optimal
                 absorbing list organization strategy; restructuring
                 operation; search problems; transient data retrieval
                 process",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

Related entries