default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubbiah Soundaralakshmi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j8]Amitava Datta
, Subbiah Soundaralakshmi:
On-line path planning in an unknown polygonal environment. Inf. Sci. 164(1-4): 89-111 (2004)- [j7]Amitava Datta, Subbiah Soundaralakshmi:
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system. J. Parallel Distributed Comput. 64(3): 360-369 (2004) - 2003
- [j6]Amitava Datta, Subbiah Soundaralakshmi:
Summation and routing on a partitioned optical passive stars network with large group size. IEEE Trans. Parallel Distributed Syst. 14(12): 1275-1285 (2003) - [j5]Amitava Datta, Subbiah Soundaralakshmi:
Fast parallel algorithm for distance transform. IEEE Trans. Syst. Man Cybern. Part A 33(4): 429-434 (2003) - [c9]Amitava Datta, Subbiah Soundaralakshmi:
Fast Merging and Sorting on a Partitioned Optical Passive Stars Network. Computer Science in Perspective 2003: 115-127 - [c8]Amitava Datta, Subbiah Soundaralakshmi:
Energy-Efficient Communication Protocols for Wireless Networks. ICOIN 2003: 181-191 - [c7]Amitava Datta, Subbiah Soundaralakshmi:
A Simple and Energy-Efficient Routing Protocol for Radio Networks. SAC 2003: 1014-1018 - 2002
- [j4]Amitava Datta, Subbiah Soundaralakshmi, Robyn A. Owens:
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. IEEE Trans. Parallel Distributed Syst. 13(3): 212-222 (2002) - [c6]Amitava Datta, Subbiah Soundaralakshmi:
Basic Operations on a Partitioned Optical Passive Stars Network with Large Group Size. International Conference on Computational Science (1) 2002: 306-315 - 2001
- [j3]Amitava Datta, Subbiah Soundaralakshmi:
Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes. J. Parallel Distributed Comput. 61(10): 1439-1455 (2001) - [j2]Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. Nord. J. Comput. 8(2): 179-192 (2001) - [c5]Amitava Datta, Subbiah Soundaralakshmi:
Fast parallel algorithm for distance transforms. IPDPS 2001: 112 - [c4]Amitava Datta, Subbiah Soundaralakshmi:
Fast and Scalable Algorithms for Euclidean Distance Transform on the LARPBS. IPDPS 2001: 138 - 2000
- [j1]Amitava Datta, Subbiah Soundaralakshmi:
An efficient algorithm for computing the maximum empty rectangle in three dimensions. Inf. Sci. 128(1-2): 43-65 (2000) - [c3]Amitava Datta, Robyn A. Owens, Subbiah Soundaralakshmi:
Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System. IPDPS Workshops 2000: 1110-1117
1990 – 1999
- 1999
- [c2]Amitava Datta, Subbiah Soundaralakshmi:
Motion Planning in an Unknown Polygonal Environment with Bounded Performance Guarantee. ICRA 1999: 1032-1037 - 1995
- [c1]Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. STACS 1995: 562-570
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:53 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:
