Sunil Arya

From MaRDI portal
Person:293202

Available identifiers

zbMath Open arya.sunilWikidataQ102305534 ScholiaQ102305534MaRDI QIDQ293202

List of research outcomes

PublicationDate of PublicationType
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q50095602021-08-04Paper
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2021-02-02Paper
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q57433752019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45800822018-08-13Paper
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees2018-07-16Paper
Optimal Approximate Polytope Membership2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46438962018-05-29Paper
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q31328442018-01-30Paper
Approximate Polytope Membership Queries2018-01-12Paper
On the combinatorial complexity of approximating polytopes2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q53687282017-10-10Paper
A 2.5-factor approximation algorithm for the \(k\)-MST problem2016-06-09Paper
A simple entropy-based algorithm for planar point location2015-09-02Paper
On the importance of idempotence2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29217102014-10-13Paper
Optimal area-sensitive bounds for polytope approximation2014-08-07Paper
Approximate polytope membership queries2014-06-05Paper
Tight lower bounds for halfspace range searching2014-04-03Paper
Tight lower bounds for halfspace range searching2012-05-22Paper
A Unified Approach to Approximate Proximity Searching2010-09-06Paper
Space-efficient approximate Voronoi diagrams2010-08-05Paper
Space-time tradeoffs for approximate nearest neighbor searching2010-07-14Paper
The effect of corners on the complexity of approximate range searching2009-04-27Paper
https://portal.mardi4nfdi.de/entity/Q36015162009-02-10Paper
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces2008-11-25Paper
Optimal Expected-Case Planar Point Location2008-04-22Paper
APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING2005-06-10Paper
An optimal algorithm for approximate nearest neighbor searching fixed dimensions2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48289272004-11-29Paper
Expected-Case Complexity of Approximate Nearest Neighbor Searching2003-06-19Paper
Binary space partitions for axis-parallel line segments: Size-height tradeoffs.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27683042002-06-18Paper
https://portal.mardi4nfdi.de/entity/Q27683032002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q27541822001-11-11Paper
Approximate range searching2001-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42340972001-08-28Paper
https://portal.mardi4nfdi.de/entity/Q27219942001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q49526412000-05-10Paper
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions2000-03-07Paper
On the Expected Depth of Random Circuits2000-03-07Paper
Efficient construction of a bounded-degree spanner with low weight1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q31289201997-04-23Paper
https://portal.mardi4nfdi.de/entity/Q31404291993-12-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sunil Arya