Abstract
We presented here different trends for data structures and algorithms, in the field of dynamic randomized algorithms. As publications in this field are rushing, this presentation deliberately stop at what I have heard of, up to this fatidical day of October 14th, 1991 ! I have no doubt that the field will still inspire researchers in the future.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1993). Parallel work. In: Towards Dynamic Randomized Algorithms in Computational Geometry. Lecture Notes in Computer Science, vol 758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57503-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-57503-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57503-0
Online ISBN: 978-3-540-48202-4
eBook Packages: Springer Book Archive