Login / Signup

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting

Torben HagerupRajeev Raman
Published in: FOCS (1992)
Keyphrases
  • tight bounds
  • upper bound
  • sorting algorithms
  • parallel processing
  • learning algorithm
  • lower bound
  • parallel implementation
  • information retrieval
  • parallel algorithm
  • parallel computation