The art of dynamizing
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 121-131
- https://doi.org/10.1007/3-540-10856-4_78
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Two general methods for dynamizing decomposable searching problemsComputing, 1981
- Some principles for dynamizing decomposable searching problemsInformation Processing Letters, 1981
- Dynamization of decomposable searching problems yielding good worst-case boundsLecture Notes in Computer Science, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- A data structure for manipulating priority queuesCommunications of the ACM, 1978