Entry Bampis:1995:OPE 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{Bampis:1995:OPE,
  author =       "E. Bampis and J.-C K{\"o}nig and D. Trystram",
  title =        "Optimal parallel execution of complete binary trees
                 and grids into most popular interconnection networks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "147",
  number =       "1--2",
  pages =        "1--18",
  day =          "07",
  month =        aug,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:16 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&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=147&issue=1-2&aid=1901",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
                 France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complete binary trees; computational complexity; de
                 Brujin interconnection network; distributed memory
                 systems; grid interconnection network; grids; hypercube
                 interconnection network; hypercube networks;
                 interconnection networks; linear interconnection
                 network; local communications; multiprocessor
                 interconnection networks; optimal parallel execution;
                 optimal time; parallel algorithms; parallel
                 distributed-memory computers; PRAM model; processor
                 scheduling; scheduling algorithms; trees (mathematics);
                 two-dimensional grid precedence graph",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries