Theocharis Malamatos

According to our database1, Theocharis Malamatos authored at least 15 papers between 2000 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Conic nearest neighbor queries and approximate Voronoi diagrams.
Comput. Geom., 2015

2009
Space-time tradeoffs for approximate nearest neighbor searching.
J. ACM, 2009

The Effect of Corners on the Complexity of Approximate Range Searching.
Discret. Comput. Geom., 2009

2008
Lower bounds for expected-case planar point location.
Comput. Geom., 2008

2007
A simple entropy-based algorithm for planar point location.
ACM Trans. Algorithms, 2007

Optimal Expected-Case Planar Point Location.
SIAM J. Comput., 2007

2006
On the importance of idempotence.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Finding Planar Regions in a Terrain - in Practice and with a Guarantee.
Int. J. Comput. Geom. Appl., 2005

Space-time tradeoffs for approximate spherical range counting.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Finding planar regions in a terrain: in practice and with a guarantree.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2002
Space-efficient approximate Voronoi diagrams.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Linear-size approximate voronoi diagrams.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Entropy-preserving cuttings and space-efficient planar point location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Nearly Optimal Expected-Case Planar Point Location.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000


  Loading...