Krishnendu Mukhopadhyaya

Orcid: 0000-0001-6292-8961

According to our database1, Krishnendu Mukhopadhyaya authored at least 63 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Dispersion of Silent Robots in a Ring.
CoRR, 2024

Gathering Over Heterogeneous Meeting Nodes.
Comput. J., 2024

Parking Problem by Oblivious Mobile Robots in Infinite Grids.
Proceedings of the Distributed Computing and Intelligent Technology, 2024

2023
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid.
Int. J. Found. Comput. Sci., January, 2023

Mutual visibility by fat robots with slim omnidirectional camera.
J. Parallel Distributed Comput., 2023

Uniform k-Circle Formation by Fat Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

2022
<i>k</i>-Circle formation by disoriented asynchronous robots.
Theor. Comput. Sci., 2022

Gathering over Meeting Nodes in Infinite Grid<sup>*</sup>.
Fundam. Informaticae, 2022

Optimal Gathering over Meeting Nodes in Infinite Grid.
CoRR, 2022

k-Circle Formation by Oblivious Mobile Robots.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Pattern Formation Problems for Mobile Robots.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021
k-Circle Formation and k-epf by Asynchronous Robots.
Algorithms, 2021

2020
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2020

Uniform Circle Formation By Oblivious Swarm Robots.
CoRR, 2020

Weak robots performing conflicting tasks without knowing who is in their team.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Gathering over Meeting Nodes in Infinite Grid.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
Computation Under Restricted Visibility.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Mutual Visibility for Asynchronous Robots.
Proceedings of the Structural Information and Communication Complexity, 2019

Mutual Visibility by Robots with Persistent Memory.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Gathering of Opaque Robots in 3D Space.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Generalized Bounded Tree Cover of a Graph.
J. Graph Algorithms Appl., 2017

Gathering Asynchronous Robots in the Presence of Obstacles.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Fault-tolerant Gathering of Semi-synchronous Robots.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

Optimum Gathering of Asynchronous Robots.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement.
J. Discrete Algorithms, 2016

A Get-Together for Deaf and Dumb Robots in Three dimensional Space.
CoRR, 2016

Approximation Algorithms for Generalized Bounded Tree Cover.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015
Leader election and gathering for asynchronous fat robots without common chirality.
J. Discrete Algorithms, 2015

MAINT: Localization of Mobile Sensors with Energy Control.
CoRR, 2015

Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility.
Proceedings of the Distributed Computing and Internet Technology, 2015

2014
Pattern Formation for Asynchronous Robots without Agreement in Chirality.
CoRR, 2014

Formation of General Position by Asynchronous Mobile Robots.
CoRR, 2014

2013
Localizability of Wireless Sensor Networks: Beyond Wheel Extension.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Circle Formation by Asynchronous Transparent Fat Robots.
Proceedings of the Distributed Computing and Internet Technology, 2013

2012
Leader Election and Gathering for Asynchronous Transparent Fat Robots without Chirality
CoRR, 2012

Circle Formation by Asynchronous Fat Robots with Limited Visibility.
Proceedings of the Distributed Computing and Internet Technology, 2012

2011
Measuring the Quality of Surveillance in a Wireless Sensor Network.
Int. J. Found. Comput. Sci., 2011

2010
Recognition of largest empty orthoconvex polygon in a point set.
Inf. Process. Lett., 2010

A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass.
Proceedings of the Distributed Computing and Internet Technology, 2010

Gathering Asynchronous Transparent Fat Robots.
Proceedings of the Distributed Computing and Internet Technology, 2010

2007
Self-stabilizing algorithm for checkpointing in a distributed system.
J. Parallel Distributed Comput., 2007

Mobile Agent Based Checkpointing with Concurrent Initiations.
Int. J. Found. Comput. Sci., 2007

Checkpointing Using Mobile Agents in Distributed Systems.
Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007

2006
Performance analysis of different checkpointing and recovery schemes using stochastic model.
J. Parallel Distributed Comput., 2006

Localization Control to Locate Mobile Sensors.
Proceedings of the Distributed Computing and Internet Technology, 2006

2005
Self-stabilizing Checkpointing Algorithm in Ring Topology.
Proceedings of the Distributed Computing, 2005

2004
Concurrent checkpoint initiation and recovery algorithms on asynchronous ring network.
J. Parallel Distributed Comput., 2004

Locating Objects in a Sensor Grid.
Proceedings of the Distributed Computing, 2004

2003
Estimating Checkpointing, Rollback and Recovery Overheads.
Proceedings of the Distributed Computing, 2003

2002
A 2-D Random Walk Based Mobility Model for Location Tracking.
Proceedings of the High Performance Computing, 2002

2000
O(n) routing in rearrangeable networks.
J. Syst. Archit., 2000

1997
A Family of Network Topologies with Multiple Loops and Logarithmic Diameter.
Parallel Comput., 1997

1996
Shooter Location Problem.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Fault-Tolerant Routing in Distributed Loop Networks.
IEEE Trans. Computers, 1995

Implementation of Four Common Functions on an LNS Co-Processor.
IEEE Trans. Computers, 1995

1994
A New Family of Bridged and Twisted Hypercubes.
IEEE Trans. Computers, 1994

1992
Reliability analysis of networks using stochastic model.
Inf. Sci., 1992

Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies.
Inf. Process. Lett., 1992

Brdiged and Twisted Hypercubes with Reduced Diameters.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

A Versatile External Control Method for Self-Routable Permutations in Benes Network.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991
On Self-Routable Permutations in Benes Network.
Proceedings of the International Conference on Parallel Processing, 1991


  Loading...