External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract)

Frank Thomson Leighton, Yuan Ma. Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract). In 34th Annual Symposium on Foundations of Computer Science, 3-5 November 1993, Palo Alto, California, USA. pages 734-743, IEEE, 1993.

Abstract

Abstract is missing.

runs on