Arya Tanmay Gupta

Orcid: 0000-0003-2147-8276

According to our database1, Arya Tanmay Gupta authored at least 18 papers between 2020 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Tolerance to asynchrony in algorithms for multiplication and modulo.
Theor. Comput. Sci., 2025

2024
Eventually lattice-linear algorithms.
J. Parallel Distributed Comput., March, 2024

Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid.
Proceedings of the 19th European Dependable Computing Conference, 2024

2023
Burning and w-burning of geometric graphs.
Discret. Appl. Math., September, 2023

Lattice Linearity in Assembling Myopic Robots on an Infinite Triangular Grid.
CoRR, 2023

DAG-Inducing Problems and Algorithms.
CoRR, 2023

Multiplication and Modulo are Lattice Linear.
CoRR, 2023

Lattice Linearity of Multiplication and Modulo.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Inducing Lattices in Non-Lattice-Linear Problems.
Proceedings of the 42nd International Symposium on Reliable Distributed Systems, 2023

Analyzing Program Transitions to Compute Benefit of Tolerating Consistency Violation Faults.
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2022
Lattice Linear Problems vs Algorithms.
CoRR, 2022

Lattice Linear Algorithms.
CoRR, 2022

Brief Announcement: Fully Lattice Linear Algorithms.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

2021
A secure home automation prototype built on raspberry-pi.
CoRR, 2021

Extending Lattice Linearity for Self-stabilizing Algorithms.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Burning Grids and Intervals.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Burning Geometric Graphs.
CoRR, 2020

NP-completeness Results for Graph Burning on Geometric Graphs.
CoRR, 2020


  Loading...