Hidden fields
Books Books
" MH Overmars and J. van Leeuwen. Dynamization of decomposable searching problems yielding good worst-case bounds. "
Computational Geometry: Algorithms and Applications - Page 353
by Mark de Berg - 2000 - 367 pages
Limited preview - About this book

Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske ...

J. Gruska, M. Chytil - Computers - 1981 - 608 pages
...Utrecht, 1979 (revised as Techn. Rep. RUU-CS-81-3, to appear in J. Comp. Syst. Sci.). 17 Overmars, MH and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, in: P. Deussen (ed.), Theoretical Computer Science (5th GI-Conf.), Lect. Notes in Comp. Sci. 104, Springer...
Limited preview - About this book

Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981

P. Deussen - Computers - 1981 - 276 pages
...plane, Techn. Rep. RUU-CS-80-5, Dept. of Computer Science, University of Utrecht, 1980. 16 Overnars, MH and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, Techn. Rep. RUU-CS-80-6, Dept. of Computer Science, University of Utrecht, 1980. 17 Saxe, JB and JL...
Limited preview - About this book




  1. My library
  2. Help
  3. Advanced Book Search