Anil Maheshwari
Anil Maheshwari
Verified email at - Homepage
Cited by
Cited by
On the false-positive rate of Bloom filters
P Bose, H Guo, E Kranakis, A Maheshwari, P Morin, J Morrison, M Smid, ...
Information Processing Letters 108 (4), 210-213, 2008
Approximating weighted shortest paths on polyhedral surfaces
M Lanthier, A Maheshwari, JR Sack
Proceedings of the thirteenth annual symposium on Computational geometry …, 1997
Determining approximate shortest paths on weighted polyhedral surfaces
L Aleksandrov, A Maheshwari, JR Sack
Journal of the ACM (JACM) 52 (1), 25-53, 2005
Fast approximations for sums of distances, clustering and the Fermat–Weber problem
P Bose, A Maheshwari, P Morin
Computational Geometry 24 (3), 135-146, 2003
Approximation algorithms for geometric shortest path problems
L Aleksandrov, A Maheshwari, JR Sack
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
An ε—approximation algorithm for weighted shortest paths on polyhedral surfaces
L Aleksandrov, M Lanthier, A Maheshwari, JR Sack
Algorithm Theory—SWAT'98: 6th Scandinavian Workshop on Algorithm Theory …, 1998
An external memory data structure for shortest path queries
D Hutchinson, A Maheshwari, N Zeh
Discrete Applied Mathematics 126 (1), 55-82, 2003
A survey of geodesic paths on 3D surfaces
P Bose, A Maheshwari, C Shu, S Wuhrer
Computational Geometry 44 (9), 486-498, 2011
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
F Dehne, W Dittrich, D Hutchinson
Proceedings of the ninth annual ACM symposium on Parallel algorithms and …, 1997
Succinct orthogonal range search structures on a grid with applications to text indexing
P Bose, M He, A Maheshwari, P Morin
Workshop on Algorithms and Data Structures, 98-109, 2009
Effect of blockage on drag and heat transfer from a single sphere and an in-line array of three spheres
A Maheshwari, RP Chhabra, G Biswas
Powder technology 168 (2), 74-83, 2006
Link distance problems
A Maheshwari, JR Sack, HN Djidjev
Handbook of Computational Geometry, 519-558, 2000
Approximating shortest paths on weighted polyhedral surfaces
M Lanthier, A Maheshwari, J -R. Sack
Algorithmica 30, 527-562, 2001
Approximating geometric bottleneck shortest paths
P Bose, A Maheshwari, G Narasimhan, M Smid, N Zeh
Computational Geometry 29 (3), 233-249, 2004
Sharing perspectives in distributed decision making
RJ Boland Jr, AK Maheshwari, D Te'eni, DG Schwartz, RV Tenkasi
Proceedings of the 1992 ACM conference on Computer-supported cooperative …, 1992
On reverse nearest neighbor queries.
A Maheshwari, J Vahrenhold, N Zeh
CCCG, 128-132, 2002
Shortest anisotropic paths on terrains
M Lanthier, A Maheshwari, JR Sack
Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 1999
Approximation algorithms for the unit disk cover problem in 2D and 3D
A Biniaz, P Liu, A Maheshwari, M Smid
Computational Geometry 60, 8-18, 2017
Fréchet distance with speed limits
A Maheshwari, JR Sack, K Shahbaz, H Zarrabi-Zadeh
Computational Geometry 44 (2), 110-120, 2011
I/O-optimal algorithms for planar graphs using separators
A Maheshwari, N Zeh
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
The system can't perform the operation now. Try again later.
Articles 1–20