Ananda Swarup Das

According to our database1, Ananda Swarup Das authored at least 16 papers between 2007 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
AnnoFin-A hybrid algorithm to annotate financial text.
Expert Syst. Appl., 2017

2016
Linear space adaptive data structures for planar range reporting.
Inf. Process. Lett., 2016

2015
Reporting and counting maximal points in a query orthogonal rectangle.
J. Discrete Algorithms, 2015

Predictive Caching Framework for Mobile Wireless Networks.
Proceedings of the 16th IEEE International Conference on Mobile Data Management, 2015

2014
On reporting the L1 metric closest pair in a query rectangle.
Inf. Process. Lett., 2014

2013
Counting Maximal Points in a Query Orthogonal Rectangle.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
Range Aggregate Maximal Points in the Plane.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

On Counting Range Maxima Points in Plane.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2011
Data Structures for Extension Violations in a Query Range.
J. Math. Model. Algorithms, 2011

Range-Aggregate Queries Involving Geometric Aggregation Operations.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

On Finding Skyline Points for Range Queries in Plane.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Finding Maximum Density Axes Parallel Regions for Weighted Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Detecting VLSI Layout, Connectivity Errors in a Query Window.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2009
Data Structures for Reporting Extension Violations in a Query Range.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Privacy Preserving Shortest Path Computation in Presence of Convex Polygonal Obstacles.
Proceedings of the The Third International Conference on Availability, 2008

2007
Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle.
Proceedings of the 8th International Conference on Mobile Data Management (MDM 2007), 2007


  Loading...