Entry Culberson:1989:EBB from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

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 | X | Y | Z

BibTeX entry

@Article{Culberson:1989:EBB,
  author =       "J. Culberson and J. I. Munro",
  title =        "Explaining the behaviour of binary search trees under
                 prolonged updates: a model and simulations",
  journal =      j-COMP-J,
  volume =       "32",
  number =       "1",
  pages =        "68--75",
  month =        feb,
  year =         "1989",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/32.1.68",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68U20 (68-04 68P10 68R10)",
  MRnumber =     "984 924",
  bibdate =      "Tue Dec 4 14:48:26 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/32/1.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/32/1/68.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/68.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/69.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/70.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/71.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/72.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/73.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/74.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/75.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Alberta Univ.",
  affiliationaddress = "Edmonton, Alberta, Can",
  classcodes =   "C4250 (Database theory); C6160 (Database management
                 systems (DBMS)); C6120 (File organisation); C1160
                 (Combinatorial mathematics)",
  classification = "723; 921; C1160 (Combinatorial mathematics); C4250
                 (Database theory); C6120 (File organisation); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "Asymptotic average search path length; asymptotic
                 average search path length; average path length;
                 Average path length, Data Processing; Binary search
                 trees; Binary Search Trees; binary search trees;
                 Computer Programming--Algorithms; Computer Simulation;
                 Data Structures; data structures; database; database
                 management systems; Database Systems; Deletion
                 algorithms; Deletion Algorithms; deletion algorithms;
                 Long-term behaviour; long-term behaviour; Long-term
                 deterioration; long-term deterioration; Mathematical
                 Techniques--Trees; Prolonged updates; Prolonged
                 Updates; prolonged updates; Symmetry; symmetry; theory;
                 trees (mathematics)",
  thesaurus =    "Data structures; Database management systems; Database
                 theory; Trees [mathematics]",
  treatment =    "T Theoretical or Mathematical",
}

Related entries