AUB ScholarWorks
A cache-oblivious polygon indecomposability testing of convex polygons - by Rawan Nabil Soudah
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Soudah, Rawan Nabil |
| dc.date.accessioned | 2012-06-13T07:14:03Z |
| dc.date.available | 2012-06-13T07:14:03Z |
| dc.date.issued | 2008 |
| dc.identifier.uri | http://hdl.handle.net/10938/7733 |
| dc.description | Thesis (M.S.)--American University of Beirut, Dept. of Computer Science, 2008.;"Advisor : Dr. Fatima Abu Salem, Assistant Professor, Computer Science--Member of Committee : Dr. Kamal Khuri-Makdisi, Associate Professor, Mathematics--Member of Committee : D |
| dc.description | Bibliography : leaves 113-117. |
| dc.description.abstract | Cache-oblivious algorithm design has been growing due to many successful researc h efforts in this emerging field. Next to the theoretical implications of reason ing within this model, one needs to address the usefulness of cache oblivious al gorithms in |
| dc.format.extent | xi, 184 leaves : ill. 30 cm. |
| dc.language.iso | eng |
| dc.relation.ispartof | Theses, Dissertations, and Projects |
| dc.subject.classification | T:005144 AUBNO |
| dc.subject.lcsh | Polygons |
| dc.subject.lcsh | Convex polytopes |
| dc.title | A cache-oblivious polygon indecomposability testing of convex polygons - by Rawan Nabil Soudah |
| dc.type | Thesis |
| dc.contributor.department | American University of Beirut. Faculty of Arts and Sciences. Department of Computer Science |
