Entry Alnuweiri:1991:OBV from supercomputing91.bib

Last update: Wed Sep 26 02:10:27 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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

@InProceedings{Alnuweiri:1991:OBV,
  author =       "H. M. Alnuweiri",
  title =        "Optimal bounded-degree {VLSI} networks for sorting in
                 a constant number of rounds",
  crossref =     "IEEE:1991:PSA",
  pages =        "732--739",
  year =         "1991",
  bibdate =      "Wed Apr 15 16:28:01 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "B2570 (Semiconductor integrated circuits); C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Electr. Eng., British Columbia Univ.,
                 Vancouver, BC, Canada",
  keywords =     "bounded-degree VLSI networks; computational
                 complexity; enumeration-sort; I/O pins; index-mapping
                 methodology; multiple chip networks; multiprocessor
                 interconnection networks; optimal VLSI sorters;
                 parallel programming; partitioning; programming theory;
                 reduced-area shuffle networks; rotate-sort; sorting;
                 VLSI",
  sponsororg =   "IEEE; ACM",
  treatment =    "T Theoretical or Mathematical",
}

Related entries