Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

  • Authors:
  • F T Leighton;P Shor

  • Affiliations:
  • Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Mathematical Sciences Research Institute, 1000 Centennial Drive, Berkeley, CA

  • Venue:
  • STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract