Shantanu Das

Orcid: 0000-0003-4008-2445

Affiliations:
  • Aix-Marseille University, France


According to our database1, Shantanu Das authored at least 79 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deterministic Leader Election for Stationary Programmable Matter with Common Direction.
CoRR, 2024

2021
Collaborative delivery on a fixed path with homogeneous energy-constrained agents.
Theor. Comput. Sci., 2021

Near-gathering of energy-constrained mobile agents.
Theor. Comput. Sci., 2021

Compacting oblivious agents on dynamic rings.
PeerJ Comput. Sci., 2021

2020
Special issue on Structural Information and Communication Complexity.
Theor. Comput. Sci., 2020

Collaborative delivery with energy-constrained mobile robots.
Theor. Comput. Sci., 2020

Forming Sequences of Patterns With Luminous Robots.
IEEE Access, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.
IEEE Access, 2020

Broadcasting with Mobile Agents in Dynamic Networks.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Graph Explorations with Mobile Agents.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Moving and Computing Models: Agents.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Gathering of robots in a ring with mobile faults.
Theor. Comput. Sci., 2019

Compacting and Grouping Mobile Agents on Dynamic Rings.
Proceedings of the Theory and Applications of Models of Computation, 2019

Patrolling on Dynamic Ring Networks.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Gathering of Robots in a Grid with Mobile Faults.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Oblivious Permutations on the Plane.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots.
Theory Comput. Syst., 2018

Maximal Exploration of Trees with Energy-Constrained Agents.
CoRR, 2018

Brief Announcement: Energy Constrained Depth First Search.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Energy Constrained Depth First Search.
CoRR, 2017

Mediated Population Protocols: Leader Election and Applications.
Proceedings of the Theory and Applications of Models of Computation, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Autonomous mobile robots with lights.
Theor. Comput. Sci., 2016

Distributed Evacuation in Graphs with Multiple Exits.
Proceedings of the Structural Information and Communication Complexity, 2016

Gathering of Robots in a Ring with Mobile Faults.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015
Mapping Simple Polygons: The Power of Telling Convex from Reflex.
ACM Trans. Algorithms, 2015

Forming sequences of geometric patterns with oblivious mobile robots.
Distributed Comput., 2015

Limit Behavior of the Multi-agent Rotor-Router System.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Collaborative Exploration by Energy-Constrained Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2015

Mobile Agents Rendezvous in Spite of a Malicious Agent.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Lock-in Problem for Parallel Rotor-router Walks.
CoRR, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.
Proceedings of the Structural Information and Communication Complexity, 2014

Synchronized Dancing of Oblivious Chameleons.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Tight bounds for black hole search with scattered agents in synchronous rings.
Theor. Comput. Sci., 2013

Mobile agents in distributed computing: Network exploration.
Bull. EATCS, 2013

Corner cuts are close to optimal: From solid grids to polygons and back.
Discret. Appl. Math., 2013

Simple agents learn to find their way: An introduction on mapping polygons.
Discret. Appl. Math., 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.
Algorithmica, 2013

Gathering of Mobile Robots Tolerating Multiple Crash Faults.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

Distributed Verification Using Mobile Agents.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Data Delivery by Energy-Constrained Mobile Agents.
Proceedings of the Algorithms for Sensor Systems, 2013

Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Wait-Free Gathering of Mobile Robots
CoRR, 2012

Brief Announcement: Wait-Free Gathering of Mobile Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

2011
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Black Hole Search with Finite Automata Scattered in a Synchronous Torus.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Telling convex from reflex allows to map a polygon.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Tight Bounds for Scattered Black Hole Search in a Ring.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
Computing All Best Swaps for Minimum-Stretch Tree Spanners.
J. Graph Algorithms Appl., 2010

Rendezvous of Mobile Agents in Directed Graphs.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

On the computational power of oblivious robots: forming a series of geometric patterns.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Rendezvous of Mobile Agents without Agreement on Local Orientation.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids.
Proceedings of the Combinatorial Optimization and Applications, 2010

How Simple Robots Benefit from Looking Back.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
A localized algorithm for bi-connectivity of connected mobile robots.
Telecommun. Syst., 2009

Review of SIROCCO 2009.
SIGACT News, 2009

2008
Detecting and Preventing IP-spoofed Distributed DoS Attacks.
Int. J. Netw. Secur., 2008

Rendezvous of Mobile Agents When Tokens Fail Anytime.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Computing Best Swaps in Optimal Tree Spanners.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Mobile Agent Rendezvous in a Ring Using Faulty Tokens.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
Map construction of unknown graphs by multiple agents.
Theor. Comput. Sci., 2007

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2007

Semi-Beaconless Power and Cost Efficient Georouting with Guaranteed Delivery using Variable Transmission Radii for Wireless Sensor Networks.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

Localized Movement Control for Fault Tolerance of Mobile Robot Networks.
Proceedings of the Wireless Sensor and Actor Networks, 2007

2006
A Parallel Probabilistic System-level Fault Diagnosis Approach for Large Multiprocessor Systems.
Parallel Process. Lett., 2006

System-Level Fault Diagnosis Using Comparison Models: An Artificial-Immune-Systems-Based Approach.
J. Networks, 2006

Groupings and Pairings in Anonymous Networks.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Effective Elections for Anonymous Mobile Agents.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Improved Distributed Exploration of Anonymous Networks.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

A Novel Artificial-Immune-Based Approach for System-Level Fault Diagnosis.
Proceedings of the The First International Conference on Availability, 2006

2005
A parallel genetic algorithm for identifying faults in large diagnosable systems.
Parallel Algorithms Appl., 2005

Distributed Exploration of an Unknown Graph.
Proceedings of the Structural Information and Communication Complexity, 2005

Probabilistic Diagnosis of Large Systems Using a Parallel Genetic Approach.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005


  Loading...