Entry Gambosi:1991:PFD 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{Gambosi:1991:PFD,
  author =       "G. Gambosi and E. Nardelli and M. Talamo",
  title =        "A pointer-free data structure for merging heaps and
                 min-max heaps",
  journal =      j-THEOR-COMP-SCI,
  volume =       "84",
  number =       "1",
  pages =        "107--126",
  day =          "22",
  month =        jul,
  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 = "C6120 (File organisation)",
  corpsource =   "Istituto di Analisi dei Sistemi ed Inf., CNR, Roma,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "amortized time complexity; data structures;
                 DeleteHeap; DeleteMax; DeleteMin; FindMax; FindMin;
                 Insert; Merge; merging heaps; min-max heaps; NewHeap;
                 pointer-free data structure",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

Related entries