default search action
Shantanu Das 0001
Person information
- affiliation: Aix-Marseille University, France
Other persons with the same name
- Shantanu Das — disambiguation page
- Shantanu Das 0002
— Reactor Control Division, Bhabha Atomic Research Centre, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Energy Constrained Depth First Search. Algorithmica 86(12): 3759-3782 (2024) - [c52]Jérémie Chalopin
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. SIROCCO 2024: 174-191 - [c51]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. DISC 2024: 13:1-13:17 - [i14]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. CoRR abs/2402.10582 (2024) - [i13]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. CoRR abs/2408.08775 (2024) - 2021
- [j25]Shantanu Das
Compacting oblivious agents on dynamic rings. PeerJ Comput. Sci. 7: e466 (2021) - [j24]Andreas Bärtschi
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849: 35-46 (2021) - [j23]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868: 87-96 (2021) - 2020
- [j22]Shantanu Das, Paola Flocchini, Giuseppe Prencipe
Forming Sequences of Patterns With Luminous Robots. IEEE Access 8: 90577-90597 (2020) - [j21]Gianlorenzo D'Angelo
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8: 207619-207634 (2020) - [j20]Andreas Bärtschi
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - [j19]Shantanu Das, Sébastien Tixeuil:
Special issue on Structural Information and Communication Complexity. Theor. Comput. Sci. 811: 1-2 (2020) - [c50]Gianlorenzo D'Angelo, Mattia D'Emidio
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS 2020: 276-284 - [c49]Shantanu Das
Broadcasting with Mobile Agents in Dynamic Networks. OPODIS 2020: 24:1-24:16
2010 – 2019
- 2019
- [j18]Shantanu Das, Riccardo Focardi
Gathering of robots in a ring with mobile faults. Theor. Comput. Sci. 764: 42-60 (2019) - [c48]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. OPODIS 2019: 24:1-24:16 - [c47]Andreas Bärtschi
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO 2019: 52-65 - [c46]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO 2019: 139-153 - [c45]Shantanu Das, Giuseppe Antonio Di Luna, Leszek Antoni Gasieniec:
Patrolling on Dynamic Ring Networks. SOFSEM 2019: 150-163 - [c44]Shantanu Das, Nikos Giachoudis
Gathering of Robots in a Grid with Mobile Faults. SOFSEM 2019: 164-178 - [c43]Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe
Compacting and Grouping Mobile Agents on Dynamic Rings. TAMC 2019: 114-133 - [p2]Shantanu Das, Nicola Santoro:
Moving and Computing Models: Agents. Distributed Computing by Mobile Entities 2019: 15-34 - [p1]Shantanu Das:
Graph Explorations with Mobile Agents. Distributed Computing by Mobile Entities 2019: 403-422 - [i12]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. CoRR abs/1911.05239 (2019) - 2018
- [j17]Shantanu Das, Dariusz Dereniowski, Christina Karousatou
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. Theory Comput. Syst. 62(5): 1223-1240 (2018) - [c42]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Brief Announcement: Energy Constrained Depth First Search. ICALP 2018: 165:1-165:5 - [i11]Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou:
Maximal Exploration of Trees with Energy-Constrained Agents. CoRR abs/1802.06636 (2018) - [i10]Shantanu Das, Giuseppe Antonio Di Luna, Leszek Antoni Gasieniec:
Patrolling on Dynamic Ring Networks. CoRR abs/1808.04349 (2018) - 2017
- [c41]Evangelos Bampas, Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. ALGOSENSORS 2017: 1-12 - [c40]Andreas Bärtschi
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017: 10:1-10:14 - [c39]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro
Mediated Population Protocols: Leader Election and Applications. TAMC 2017: 172-186 - [e1]Shantanu Das, Sébastien Tixeuil:
Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10641, Springer 2017, ISBN 978-3-319-72049-4 [contents] - [i9]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Energy Constrained Depth First Search. CoRR abs/1709.10146 (2017) - 2016
- [j16]Shantanu Das, Paola Flocchini, Giuseppe Prencipe
Autonomous mobile robots with lights. Theor. Comput. Sci. 609: 171-184 (2016) - [c38]Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, Marco Squarcina:
Gathering of Robots in a Ring with Mobile Faults. ICTCS 2016: 122-135 - [c37]Piotr Borowiecki
Distributed Evacuation in Graphs with Multiple Exits. SIROCCO 2016: 228-241 - [c36]Andreas Bärtschi
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [i8]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - [i7]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR abs/1610.02361 (2016) - 2015
- [j15]Shantanu Das, Paola Flocchini, Nicola Santoro
Forming sequences of geometric patterns with oblivious mobile robots. Distributed Comput. 28(2): 131-145 (2015) - [j14]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11(4): 33:1-33:16 (2015) - [c35]Shantanu Das, Flaminia L. Luccio
Mobile Agents Rendezvous in Spite of a Malicious Agent. ALGOSENSORS 2015: 211-224 - [c34]Shantanu Das, Dariusz Dereniowski
Collaborative Exploration by Energy-Constrained Mobile Robots. SIROCCO 2015: 357-369 - [c33]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015: 123-139 - 2014
- [c32]Shantanu Das, Paola Flocchini, Giuseppe Prencipe
Synchronized Dancing of Oblivious Chameleons. FUN 2014: 113-124 - [c31]Shantanu Das, Dariusz Dereniowski
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO 2014: 295-310 - [i6]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR abs/1406.2795 (2014) - [i5]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200 (2014) - 2013
- [j13]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013) - [j12]Andreas Emil Feldmann
Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. 161(7-8): 970-998 (2013) - [j11]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. 161(10-11): 1287-1307 (2013) - [j10]Shantanu Das:
Mobile agents in distributed computing: Network exploration. Bull. EATCS 109: 54-69 (2013) - [j9]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509: 70-85 (2013) - [c30]Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013: 111-122 - [c29]Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro:
Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes. ALGOSENSORS 2013: 228-243 - [c28]Shantanu Das, Shay Kutten, Zvi Lotker:
Distributed Verification Using Mobile Agents. ICDCN 2013: 330-347 - [c27]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Gathering of Mobile Robots Tolerating Multiple Crash Faults. ICDCS 2013: 337-346 - 2012
- [c26]Shantanu Das, Paola Flocchini, Giuseppe Prencipe
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. ICDCS 2012: 506-515 - [c25]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Brief Announcement: Wait-Free Gathering of Mobile Robots. DISC 2012: 401-402 - [i4]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012) - [i3]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Wait-Free Gathering of Mobile Robots. CoRR abs/1207.0226 (2012) - 2011
- [c24]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197 - [c23]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - [c22]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446 - [c21]Andreas Emil Feldmann
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154 - [i2]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings. CoRR abs/1104.5076 (2011) - [i1]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. CoRR abs/1106.6037 (2011) - 2010
- [j8]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010) - [c20]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 - [c19]Andreas Emil Feldmann
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20 - [c18]Jérémie Chalopin, Shantanu Das:
Rendezvous of Mobile Agents without Agreement on Local Orientation. ICALP (2) 2010: 515-526 - [c17]Jérémie Chalopin, Shantanu Das, Adrian Kosowski:
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134 - [c16]Shantanu Das, Paola Flocchini, Nicola Santoro
On the computational power of oblivious robots: forming a series of geometric patterns. PODC 2010: 267-276 - [c15]Jérémie Chalopin, Shantanu Das, Peter Widmayer:
Rendezvous of Mobile Agents in Directed Graphs. DISC 2010: 282-296
2000 – 2009
- 2009
- [j7]Shantanu Das:
Review of SIROCCO 2009. SIGACT News 40(4): 93-97 (2009) - [j6]Shantanu Das, Hai Liu, Amiya Nayak
A localized algorithm for bi-connectivity of connected mobile robots. Telecommun. Syst. 40(3-4): 129-140 (2009) - 2008
- [j5]Yao Chen, Shantanu Das, Pulak Dhar, Abdulmotaleb El-Saddik, Amiya Nayak:
Detecting and Preventing IP-spoofed Distributed DoS Attacks. Int. J. Netw. Secur. 7(1): 69-80 (2008) - [c14]Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments. ALGOSENSORS 2008: 125-140 - [c13]Shantanu Das:
Mobile Agent Rendezvous in a Ring Using Faulty Tokens. ICDCN 2008: 292-297 - [c12]Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing Best Swaps in Optimal Tree Spanners. ISAAC 2008: 716-727 - [c11]Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 - 2007
- [j4]Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak
Map construction of unknown graphs by multiple agents. Theor. Comput. Sci. 385(1-3): 34-48 (2007) - [c10]Shantanu Das, Hai Liu, Ajith Kamath, Amiya Nayak
Localized Movement Control for Fault Tolerance of Mobile Robot Networks. WSAN 2007: 1-12 - [c9]Shantanu Das, Amiya Nayak
Semi-Beaconless Power and Cost Efficient Georouting with Guaranteed Delivery using Variable Transmission Radii for Wireless Sensor Networks. MASS 2007: 1-6 - [c8]Shantanu Das, Paola Flocchini, Nicola Santoro
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. SIROCCO 2007: 289-303 - [c7]Jérémie Chalopin, Shantanu Das, Nicola Santoro
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. DISC 2007: 108-122 - 2006
- [j3]Mourad Elhadef, Shantanu Das, Amiya Nayak
System-Level Fault Diagnosis Using Comparison Models: An Artificial-Immune-Systems-Based Approach. J. Networks 1(5): 43-53 (2006) - [j2]Mourad Elhadef, Kaouther Abrougui, Shantanu Das, Amiya Nayak
A Parallel Probabilistic System-level Fault Diagnosis Approach for Large Multiprocessor Systems. Parallel Process. Lett. 16(1): 63-80 (2006) - [c6]Mourad Elhadef, Shantanu Das, Amiya Nayak
A Novel Artificial-Immune-Based Approach for System-Level Fault Diagnosis. ARES 2006: 166-173 - [c5]Shantanu Das, Shay Kutten, Ayelet Yifrach:
Improved Distributed Exploration of Anonymous Networks. ICDCN 2006: 306-318 - [c4]Shantanu Das, Paola Flocchini, Amiya Nayak
Effective Elections for Anonymous Mobile Agents. ISAAC 2006: 732-743 - [c3]Jérémie Chalopin, Shantanu Das, Nicola Santoro
Groupings and Pairings in Anonymous Networks. DISC 2006: 105-119 - 2005
- [j1]Mourad Elhadef, Shantanu Das, Amiya Nayak
A parallel genetic algorithm for identifying faults in large diagnosable systems. Parallel Algorithms Appl. 20(2): 113-125 (2005) - [c2]Mourad Elhadef, Kaouther Abrougui, Shantanu Das, Amiya Nayak:
Probabilistic Diagnosis of Large Systems Using a Parallel Genetic Approach. PDPTA 2005: 1010-1016 - [c1]Shantanu Das, Paola Flocchini, Amiya Nayak
Distributed Exploration of an Unknown Graph. SIROCCO 2005: 99-114
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-12-10 21:48 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: