Lower bounds for sorting networks

  • Authors:
  • Nabil Kahale;Tom Leighton;Yuan Ma;C. Greg Plaxton;Torsten Suel;Endre Szemerédi

  • Affiliations:
  • Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA and DIMACS;Department of Mathematics and Laboratory for Computer Science, MIT, Cambridge, MA;Department of Computer Science, Stanford University, Stanford, CA and DIMACS;Department of Computer Science, University of Texas at Austin, Austin, TX and DIMACS;NEC Research Institute, 4 Independence Way, Princeton, NJ and DIMACS;Department of Computer Science, Rutgers University, Piscataway, NJ

  • Venue:
  • STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract