default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheocharis Malamatos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j7]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
Conic nearest neighbor queries and approximate Voronoi diagrams. Comput. Geom. 48(2): 76-86 (2015)
2000 – 2009
- 2009
- [j6]Sunil Arya, Theocharis Malamatos, David M. Mount
:
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41(3): 398-443 (2009) - [j5]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57(1): 1:1-1:54 (2009) - 2008
- [j4]Theocharis Malamatos:
Lower bounds for expected-case planar point location. Comput. Geom. 39(2): 91-103 (2008) - 2007
- [j3]Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong:
Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007) - [j2]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3(2): 17 (2007) - 2006
- [c11]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram. CCCG 2006 - [c10]Sunil Arya, Theocharis Malamatos, David M. Mount:
The effect of corners on the complexity of approximate range searching. SCG 2006: 11-20 - [c9]Sunil Arya, Theocharis Malamatos, David M. Mount:
On the importance of idempotence. STOC 2006: 564-573 - 2005
- [j1]Stefan Funke, Theocharis Malamatos, Rahul Ray:
Finding Planar Regions in a Terrain - in Practice and with a Guarantee. Int. J. Comput. Geom. Appl. 15(4): 379-402 (2005) - [c8]Theocharis Malamatos:
Lower bounds for expected-case planar point location. CCCG 2005: 191-194 - [c7]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544 - 2004
- [c6]Stefan Funke, Theocharis Malamatos, Rahul Ray:
Finding planar regions in a terrain: in practice and with a guarantree. SCG 2004: 96-105 - 2002
- [c5]Sunil Arya, Theocharis Malamatos:
Linear-size approximate voronoi diagrams. SODA 2002: 147-155 - [c4]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730 - 2001
- [c3]Sunil Arya, Theocharis Malamatos, David M. Mount:
Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261 - [c2]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. SODA 2001: 262-268 - 2000
- [c1]Sunil Arya, Theocharis Malamatos, David M. Mount:
Nearly Optimal Expected-Case Planar Point Location. FOCS 2000: 208-218
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
