default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArya Tanmay Gupta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Arya Tanmay Gupta
, Sandeep S. Kulkarni:
Tolerance to asynchrony in algorithms for multiplication and modulo. Theor. Comput. Sci. 1024: 114914 (2025)- 2024
- [j2]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Eventually lattice-linear algorithms. J. Parallel Distributed Comput. 185: 104802 (2024) - [c7]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid. EDCC 2024: 61-68 - 2023
- [j1]Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit:
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023) - [c6]Duong Ngoc Nguyen, Arya Tanmay Gupta, Sandeep S. Kulkarni:
Analyzing Program Transitions to Compute Benefit of Tolerating Consistency Violation Faults. ICDCN 2023: 58-69 - [c5]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Inducing Lattices in Non-Lattice-Linear Problems. SRDS 2023: 232-242 - [c4]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Lattice Linearity of Multiplication and Modulo. SSS 2023: 141-156 - [i10]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Multiplication and Modulo are Lattice Linear. CoRR abs/2302.07207 (2023) - [i9]Arya Tanmay Gupta, Sandeep S. Kulkarni:
DAG-Inducing Problems and Algorithms. CoRR abs/2302.14834 (2023) - [i8]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Lattice Linearity in Assembling Myopic Robots on an Infinite Triangular Grid. CoRR abs/2307.13080 (2023) - [i7]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Eventually Lattice-Linear Algorithms. CoRR abs/2311.09760 (2023) - 2022
- [c3]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Brief Announcement: Fully Lattice Linear Algorithms. SSS 2022: 341-345 - [i6]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Lattice Linear Algorithms. CoRR abs/2209.14703 (2022) - [i5]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Lattice Linear Problems vs Algorithms. CoRR abs/2210.03055 (2022) - 2021
- [c2]Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal:
Burning Grids and Intervals. CALDAM 2021: 66-79 - [c1]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Extending Lattice Linearity for Self-stabilizing Algorithms. SSS 2021: 365-379 - [i4]Arya Tanmay Gupta, Sandeep S. Kulkarni:
Extending Lattice linearity for Self-Stabilizing Algorithms. CoRR abs/2109.13216 (2021) - [i3]Arya Tanmay Gupta, Humani Gupta, Muskan Sharma, Priyanka Khanna:
A secure home automation prototype built on raspberry-pi. CoRR abs/2109.14579 (2021) - 2020
- [i2]Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal:
NP-completeness Results for Graph Burning on Geometric Graphs. CoRR abs/2003.07746 (2020) - [i1]Arya Tanmay Gupta:
Burning Geometric Graphs. CoRR abs/2010.01439 (2020)
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-11-07 20:32 CET 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:
