default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnanda Swarup Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j5]Ananda Swarup Das, Sameep Mehta, L. Venkata Subramaniam:
AnnoFin-A hybrid algorithm to annotate financial text. Expert Syst. Appl. 88: 270-275 (2017)- 2016
- [j4]Ananda Swarup Das, Prosenjit Gupta:
Linear space adaptive data structures for planar range reporting. Inf. Process. Lett. 116(5): 361-366 (2016) - 2015
- [j3]Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan:
Reporting and counting maximal points in a query orthogonal rectangle. J. Discrete Algorithms 30: 78-95 (2015) - [c11]Sourav Dutta
, Ankur Narang, Souvik Bhattacherjee, Ananda Swarup Das, Dilip Krishnaswamy:
Predictive Caching Framework for Mobile Wireless Networks. MDM (1) 2015: 179-184 - 2014
- [j2]Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan:
On reporting the L1 metric closest pair in a query rectangle. Inf. Process. Lett. 114(5): 256-263 (2014) - 2013
- [c10]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Counting Maximal Points in a Query Orthogonal Rectangle. WALCOM 2013: 65-76 - 2012
- [c9]Anil Kishore Kalavagattu, Jatin Agarwal, Ananda Swarup Das, Kishore Kothapalli:
On Counting Range Maxima Points in Plane. IWOCA 2012: 263-273 - [c8]Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli:
Range Aggregate Maximal Points in the Plane. WALCOM 2012: 52-63 - 2011
- [j1]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Data Structures for Extension Violations in a Query Range. J. Math. Model. Algorithms 10(1): 79-107 (2011) - [c7]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Detecting VLSI Layout, Connectivity Errors in a Query Window. CCCG 2011 - [c6]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan, Kishore Kothapalli:
Finding Maximum Density Axes Parallel Regions for Weighted Point Sets. CCCG 2011 - [c5]Anil Kishore Kalavagattu, Ananda Swarup Das, Kishore Kothapalli, Kannan Srinathan:
On Finding Skyline Points for Range Queries in Plane. CCCG 2011 - [c4]Saladi Rahul, Ananda Swarup Das, Krishnan Sundara Rajan, Kannan Srinathan:
Range-Aggregate Queries Involving Geometric Aggregation Operations. WALCOM 2011: 122-133
2000 – 2009
- 2009
- [c3]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan:
Data Structures for Reporting Extension Violations in a Query Range. CCCG 2009: 129-132 - 2008
- [c2]Ananda Swarup Das, Jitu Kumar Keshri, Kannan Srinathan, Vaibhav Srivastava:
Privacy Preserving Shortest Path Computation in Presence of Convex Polygonal Obstacles. ARES 2008: 446-451 - 2007
- [c1]Ananda Swarup Das, Kannan Srinathan, Ritesh Kumar Tiwari, Vaibhav Srivastava:
Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle. MDM 2007: 248-252
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-25 05:47 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:
