Остановите войну!
for scientists:
default search action
Jerry L. Trahan
- > Home > Persons > Jerry L. Trahan
Publications
- 2023
- [c42]Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
On Doorway Egress by Autonomous Robots. IPDPS 2023: 312-321 - 2022
- [j30]Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
On fast pattern formation by autonomous robots. Inf. Comput. 285(Part): 104699 (2022) - [j29]Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights. IEEE Trans. Parallel Distributed Syst. 33(12): 3532-3545 (2022) - [c41]Rory Hector, Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan:
Optimal Arbitrary Pattern Formation on a Grid by Asynchronous Autonomous Robots. IPDPS 2022: 1151-1161 - 2021
- [j27]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan:
Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case. Algorithms 14(2): 56 (2021) - [j26]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan:
Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights. Int. J. Netw. Comput. 11(1): 50-77 (2021) - [c38]Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
On Optimal Doorway Egress by Autonomous Robots. SSS 2021: 489-494 - 2020
- [c36]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan:
Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights. IPDPS Workshops 2020: 607-616 - [c35]Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
Optimal Convex Hull Formation on a Grid by Asynchronous Robots with Lights. IPDPS 2020: 1051-1060 - 2018
- [c32]Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan:
On Fast Pattern Formation by Autonomous Robots. SSS 2018: 203-220 - 2017
- [c30]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai:
O(log N)-Time Complete Visibility for Asynchronous Robots with Lights. IPDPS 2017: 513-522 - [c29]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan:
Constant-Time Complete Visibility for Asynchronous Robots with Lights. SSS 2017: 265-281 - 2016
- [c28]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai:
Complete Visibility for Robots with Lights in O(1) Time. SSS 2016: 327-345 - 2015
- [j25]Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan:
Efficient transformations for Klee's measure problem in the streaming model. Comput. Geom. 48(9): 688-702 (2015) - [c27]Ramachandran Vaidyanathan, Costas Busch, Jerry L. Trahan, Gokarna Sharma, Suresh Rai:
Logarithmic-Time Complete Visibility for Robots with Lights. IPDPS 2015: 375-384 - 2014
- [c25]Gokarna Sharma, Suresh Rai, Costas Busch, Jerry L. Trahan, Ramachandran Vaidyanathan:
Work-Efficient Load Balancing. ICPP Workshops 2014: 27-36 - 2012
- [c24]Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan:
An Efficient Transformation for the Klee's Measure Problem in the Streaming Model. CCCG 2012: 83-88
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-21 16:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint