Theocharis Malamatos, Ph.D.
Affiliations: | 2002 | Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
Area:
Computer ScienceGoogle:
"Theocharis Malamatos"Parents
Sign in to add mentorSunil Arya | grad student | 2002 | HKUST | |
(Expected-case planar point location.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Funke S, Malamatos T, Matijevic D, et al. (2015) Conic nearest neighbor queries and approximate Voronoi diagrams Computational Geometry: Theory and Applications. 48: 76-86 |
Arya S, Malamatos T, Mount DM. (2009) Space-time tradeoffs for approximate nearest neighbor searching Journal of the Acm. 57 |
Arya S, Malamatos T, Mount DM. (2009) The effect of corners on the complexity of approximate range searching Discrete and Computational Geometry. 41: 398-443 |
Malamatos T. (2008) Lower bounds for expected-case planar point location Computational Geometry: Theory and Applications. 39: 91-103 |
Arya S, Malamatos T, Mount DM. (2007) A simple entropy-based algorithm for planar point location Acm Transactions On Algorithms. 3 |
Arya S, Malamatos T, Mount DM, et al. (2007) Optimal expected-case planar point location Siam Journal On Computing. 37: 584-610 |
Arya S, Malamatos T, Mount DM. (2006) On the importance of idempotence Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 564-573 |
Arya S, Malamatos T, Mount DM. (2005) Space-time tradeoffs for approximate spherical range counting Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 535-544 |
Funke S, Malamatos T, Ray R. (2004) Finding planar regions in a terrain - In practice and with a guarantee Proceedings of the Annual Symposium On Computational Geometry. 96-105 |
Arya S, Malamatos T. (2002) Linear-size approximate Voronoi diagrams Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 147-155 |