On the Complexity of Certified Write All Algorithms

Charles U. Martel, Ramesh Subramonian. On the Complexity of Certified Write All Algorithms. In R. K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings. Volume 652 of Lecture Notes in Computer Science, pages 368-379, Springer, 1992.

Abstract

Abstract is missing.