Entry Habib:1996:TSD 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{Habib:1996:TSD,
  author =       "Michel Habib and Lhouari Nourine",
  title =        "Tree structure for distributive lattices and its
                 applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "165",
  number =       "2",
  pages =        "391--405",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=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=165&issue=2&aid=2173",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Univ. des Sci. et Tech. du Languedoc, Montpellier,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; data structures;
                 distributive lattices; join; lattice operations; meet;
                 reachability; space complexity; time complexity;
                 transitive closure; tree data structures; tree
                 representation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries