@Article{b:li-psrs93,
  author =      "X. Li and P. Lu and J. Schaeffer and J. Shillington and P.S. Wong and H. Shi",
  fullauthor =  "Xiaobo Li and Paul Lu and Jonathan Schaeffer and John Shillington and Pok Sze Wong and Hanmao Shi",
  title =        "{On the Versatility of Parallel Sorting by Regular Sampling}",
  journal =      "Parallel Computing",
  volume =       "19",
  number =       "10",
  pages =        "1079--1103",
  month =        oct,
  year =         "1993",
  coden =        "PACOEJ",
  ISSN =         "0167-8191",
  mrclass =      "68P10 (68Q22)",
  mrnumber =     "1 244 723",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  keywords =     "balancing; duplicate keys; hypercubes; load; memory
                 locality; MIMD architectures; oversampling; parallel
                 algorithms; parallel sorting; regular sampling; shared
                 memory architectures; sorting; undersampling",
  treatment =    "T Theoretical or Mathematical",
  note = "Available at {http://www.cs.ualberta.ca/{\char"7E}paullu/}",
}