Worst-case optimal insertion and deletion methods for decomposable searching problems
- 1 August 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 12 (4), 168-173
- https://doi.org/10.1016/0020-0190(81)90093-4
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Two general methods for dynamizing decomposable searching problemsComputing, 1981
- Optimal dynamization of decomposable searching problemsInformation Processing Letters, 1981
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980
- Decomposable searching problemsInformation Processing Letters, 1979