Остановите войну!
for scientists:
default search action
Guilherme Dias da Fonseca
Publications
- 2023
- [c23]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SODA 2023: 1834-1861 - [i22]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. CoRR abs/2303.08349 (2023) - [i20]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR abs/2306.15621 (2023) - [i19]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR abs/2306.15648 (2023) - 2022
- [j20]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18(4): 35:1-35:29 (2022) - 2020
- [c17]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA 2020: 786-805 - 2019
- [c14]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA 2019: 355-372 - [i11]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1910.14459 (2019) - 2018
- [j17]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. SIAM J. Comput. 47(1): 1-51 (2018) - [c13]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA 2018: 3:1-3:14 - [i10]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR abs/1807.00484 (2018) - 2017
- [j16]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58(4): 849-870 (2017) - [c12]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG 2017: 10:1-10:15 - [c11]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. SODA 2017: 270-288 - [i8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal ε-Kernel Construction and Related Problems. CoRR abs/1703.10868 (2017) - 2016
- [c10]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. SoCG 2016: 11:1-11:15 - [i7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1604.01175 (2016) - [i6]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. CoRR abs/1604.01183 (2016) - [i5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. CoRR abs/1612.01696 (2016) - 2012
- [c8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal area-sensitive bounds for polytope approximation. SCG 2012: 363-372 - [c7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Polytope approximation and the Mahler volume. SODA 2012: 29-42 - 2011
- [c5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate polytope membership queries. STOC 2011: 579-586 - 2010
- [c4]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
A Unified Approach to Approximate Proximity Searching. ESA (1) 2010: 374-385 - 2008
- [c3]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244
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-25 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint