Solving Geometric Problems in Space-Conscious Models
When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In particular, in-place algorithms, multi-pass algorithms, read-only algorithms, and stream-sort algorithms are studied, and...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4257 |