Entry Dessmark:1995:MLL 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{Dessmark:1995:MLL,
  author =       "Anders Dessmark and Andrzej Lingas and Anil
                 Maheshwari",
  title =        "Multi-list layering: {Complexity} and applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "141",
  number =       "1--2",
  pages =        "337--350",
  day =          "17",
  month =        apr,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&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=1995&volume=141&issue=1-2&aid=1847",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Lund Univ., Sweden",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "almost complete problem; combinatorial generalization;
                 complexity; computational complexity; computational
                 geometry; convex layer problem; logspace-hard;
                 multilist layering; NC algorithms; P-complete;
                 polynomial time",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries