Search results for "Theocharis Malamatos"

Found 17 publication records. Showing 17 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-time tradeoffs for approximate nearest neighbor searching.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	The Effect of Corners on the Complexity of Approximate Range Searching.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Computational complexity, Approximation algorithms, Range searching, Idempotence
1	Theocharis Malamatos	Lower bounds for expected-case planar point location.	Comput. Geom.	2008	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	A simple entropy-based algorithm for planar point location.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	expected-case complexity, polygonal subdivision, trapezoidal maps, entropy, randomized algorithms, Point location
1	Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong	Optimal Expected-Case Planar Point Location.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	The effect of corners on the complexity of approximate range searching.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
1	Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert	(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram.	CCCG	2006	DBLP BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	On the importance of idempotence.	STOC	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
1	Stefan Funke, Theocharis Malamatos, Rahul Ray	Finding Planar Regions in a Terrain - in Practice and with a Guarantee.	Int. J. Comput. Geometry Appl.	2005	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-time tradeoffs for approximate spherical range counting.	SODA	2005	DBLP DOI BibTeX RDF
1	Theocharis Malamatos	Lower bounds for expected-case planar point location.	CCCG	2005	DBLP BibTeX RDF
1	Stefan Funke, Theocharis Malamatos, Rahul Ray	Finding planar regions in a terrain: in practice and with a guarantree.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	approximation, terrain, planarity
1	Sunil Arya, Theocharis Malamatos	Linear-size approximate voronoi diagrams.	SODA	2002	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-efficient approximate Voronoi diagrams.	STOC	2002	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	A simple entropy-based algorithm for planar point location.	SODA	2001	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Entropy-preserving cuttings and space-efficient planar point location.	SODA	2001	DBLP DOI BibTeX RDF
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Nearly Optimal Expected-Case Planar Point Location.	FOCS	2000	DBLP DOI BibTeX RDF	nearly optimal expected-case planar point location, expected search time, planar polygonal subdivision, search structure, optimal binary search tree, polygonal subdivision, polygonal cells, convex cells, data structure, computational geometry, probability, trees (mathematics), search problems, subdivision, planar point location

Publications of "Theocharis Malamatos" ( http://dblp.L3S.de/Authors/Theocharis_Malamatos )