Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds

Mark H. Overmars, Jan van Leeuwen. Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. In Peter Deussen, editor, Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings. Volume 104 of Lecture Notes in Computer Science, pages 224-233, Springer, 1981.

Abstract

Abstract is missing.