Publications

2022

  1. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2022. Distance labeling schemes for K_4-free bridged graphs. Inf. Comput. 289, Part: 104959. DOI-link  
  2. Sébastien Bouchard, Arnaud Labourel, and Andrzej Pelc. 2022. Impact of knowledge on the cost of treasure hunt in trees. Networks 80, 1: 51–62. DOI-link   arXiv-link  
  3. Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, and Arnaud Labourel. 2022. Robustness of Distances and Diameter in a Fragile Network. 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:16. DOI-link  

2021

  1. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2021. Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica 83, 1: 252–296. DOI-link  
  2. Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, and Matús Mihalák. 2021. Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868: 87–96. DOI-link  
  3. Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc. 2021. Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 36:1–36:20. DOI-link  
  4. Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès. 2021. Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65, 3: 856–892. DOI-link  
  5. Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, and Matús Mihalák. 2021. Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849: 35–46. DOI-link  
  6. Emmanuel Godard and Eloi Perdereau. 2021. Back to the Coordinated Attack Problem. CoRR abs/2103.10816. arXiv-link  
  7. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2021. Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. Theor. Comput. Sci. 886: 49–68. DOI-link  
  8. Shantanu Das, Giuseppe Antonio Di Luna, Daniele Mazzei, and Giuseppe Prencipe. 2021. Compacting oblivious agents on dynamic rings. PeerJ Comput. Sci. 7: e466. DOI-link  
  9. Danny Hendler, Adnane Khattabi, Alessia Milani, and Corentin Travers. 2021. Upper and Lower Bounds for Deterministic Approximate Objects. 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021, IEEE, 438–448. DOI-link  
  10. Danny Hendler, Adnane Khattabi, Alessia Milani, and Corentin Travers. 2021. Upper and Lower Bounds for Deterministic Approximate Objects. CoRR abs/2104.09902. arXiv-link  
  11. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, and Corentin Travers. 2021. A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849: 121–137. DOI-link  

2020

  1. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2020. On density of subgraphs of Cartesian products. J. Graph Theory 93, 1: 64–87. DOI-link  
  2. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, et al. 2020. Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2–14. DOI-link  
  3. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2020. Distance Labeling Schemes for K\(_\mbox4\)-Free Bridged Graphs. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 310–327. DOI-link  
  4. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2020. Distance labeling schemes for K\(_\mbox4\)-free bridged graphs. CoRR abs/2007.14192. arXiv-link  
  5. Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc. 2020. Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR abs/2010.14916. arXiv-link  
  6. Jérémie Chalopin and Victor Chepoi. 2020. A counterexample to Thiagarajan’s conjecture on regular event structures. J. Comput. Syst. Sci. 113: 76–100. DOI-link  
  7. Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, and Yann Vaxès. 2020. Medians in Median Graphs and Their Cube Complexes in Linear Time. 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1–10:17. DOI-link  
  8. Emmanuel Godard and Eloi Perdereau. 2020. Back to the Coordinated Attack Problem. Math. Struct. Comput. Sci. 30, 10: 1089–1113. DOI-link  
  9. Emmanuel Godard, Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2020. Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836: 110–123. DOI-link  
  10. Emmanuel Godard, Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2020. From Bezout’s Identity to Space-Optimal Election in Anonymous Memory Systems. PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, ACM, 41–50. DOI-link  
  11. Shantanu Das, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. 2020. Forming Sequences of Patterns With Luminous Robots. IEEE Access 8: 90577–90597. DOI-link  
  12. Gianlorenzo D’Angelo, Mattia D’Emidio, Shantanu Das, Alfredo Navarra, and Giuseppe Prencipe. 2020. Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8: 207619–207634. DOI-link  
  13. Shantanu Das and Sébastien Tixeuil. 2020. Special issue on Structural Information and Communication Complexity. Theor. Comput. Sci. 811: 1–2. DOI-link  
  14. Gianlorenzo D’Angelo, Mattia D’Emidio, Shantanu Das, Alfredo Navarra, and Giuseppe Prencipe. 2020. Leader Election and Compaction for Asynchronous Silent Programmable Matter. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’20, Auckland, New Zealand, May 9-13, 2020, International Foundation for Autonomous Agents and Multiagent Systems, 276–284.
  15. Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, and Euripides Markou. 2020. Broadcasting with Mobile Agents in Dynamic Networks. 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24:1–24:16. DOI-link  
  16. Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers. 2020. Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, ACM, 31–40. DOI-link  
  17. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, and Thibault Rieutord. 2020. Perfect failure detection with very few bits. Inf. Comput. 275: 104604. DOI-link  
  18. Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2020. A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. J. Appl. Comput. Topol. 4, 1: 141–179. DOI-link  
  19. Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, and Corentin Travers. 2020. Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par 2020: Parallel Processing - 26th International Conference on Parallel and Distributed Computing, Warsaw, Poland, August 24-28, 2020, Proceedings, Springer, 359–375. DOI-link  

2019

  1. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2019. On density of subgraphs of halved cubes. Eur. J. Comb. 80: 57–70. DOI-link  
  2. Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, et al. 2019. On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753: 80–90. DOI-link  
  3. Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, and Arnaud Labourel. 2019. Group search of the plane with faulty robots. Theor. Comput. Sci. 792: 69–84. DOI-link  
  4. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2019. Distance Labeling Schemes for Cube-Free Median Graphs. 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15:1–15:14. DOI-link  
  5. Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, and Matús Mihalák. 2019. Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Springer, 139–153. DOI-link  
  6. Jérémie Chalopin and Victor Chepoi. 2019. 1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. 20, 3: 17:1–17:49. DOI-link  
  7. Jérémie Chalopin, Victor Chepoi, Shay Moran, and Manfred K. Warmuth. 2019. Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 34:1–34:15. DOI-link  
  8. Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, and Matús Mihalák. 2019. Near-Gathering of Energy-Constrained Mobile Agents. Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Springer, 52–65. DOI-link  
  9. Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, and Yann Vaxès. 2019. Medians in median graphs in linear time. CoRR abs/1907.10398. arXiv-link  
  10. Emmanuel Godard. 2019. Snap-Stabilizing Tasks in Anonymous Networks. Theory Comput. Syst. 63, 2: 326–343. DOI-link  
  11. Emmanuel Godard, Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2019. Mutex-Based De-anonymization of an Anonymous Read/Write Memory. Networked Systems - 7th International Conference, NETYS 2019, Marrakech, Morocco, June 19-21, 2019, Revised Selected Papers, Springer, 311–326. DOI-link  
  12. Emmanuel Godard, Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2019. Anonymous Read/Write Memory: Leader Election and De-anonymization. Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Springer, 246–261. DOI-link  
  13. Emmanuel Godard, Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2019. Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204. arXiv-link  
  14. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, and Philipp Woelfel. 2019. Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, ACM, 157–166. DOI-link  
  15. Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, and Marco Squarcina. 2019. Gathering of robots in a ring with mobile faults. Theor. Comput. Sci. 764: 42–60. DOI-link  
  16. Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. 2019. Oblivious Permutations on the Plane. 23rd International Conference on Principles of Distributed Systems, OPODIS 2019, December 17-19, 2019, Neuchâtel, Switzerland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24:1–24:16. DOI-link  
  17. Shantanu Das, Giuseppe Antonio Di Luna, and Leszek Antoni Gasieniec. 2019. Patrolling on Dynamic Ring Networks. SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, Springer, 150–163. DOI-link  
  18. Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, and Euripides Markou. 2019. Gathering of Robots in a Grid with Mobile Faults. SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, Springer, 164–178. DOI-link  
  19. Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, and Giuseppe Prencipe. 2019. Compacting and Grouping Mobile Agents on Dynamic Rings. Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings, Springer, 114–133. DOI-link  
  20. Shantanu Das and Nicola Santoro. 2019. Moving and Computing Models: Agents. In P. Flocchini, G. Prencipe, and N. Santoro, eds., Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Springer, 15–34. DOI-link  
  21. Shantanu Das. 2019. Graph Explorations with Mobile Agents. In P. Flocchini, G. Prencipe, and N. Santoro, eds., Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Springer, 403–422. DOI-link  
  22. Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. 2019. Oblivious Permutations on the Plane. CoRR abs/1911.05239. arXiv-link  
  23. Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers. 2019. Long-Lived Counters with Polylogarithmic Amortized Step Complexity. 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 3:1–3:16. DOI-link  
  24. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, and Corentin Travers. 2019. A Topological Perspective on Distributed Network Algorithms. Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Springer, 3–18. DOI-link  
  25. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, and Corentin Travers. 2019. Synchronous t-Resilient Consensus in Arbitrary Graphs. Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings, Springer, 53–68. DOI-link  
  26. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, and Corentin Travers. 2019. A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565. arXiv-link  

2018

  1. Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, and Euripides Markou. 2018. Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings, Springer, 381–395. DOI-link  
  2. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2018. Distance and routing labeling schemes for cube-free median graphs. CoRR abs/1809.10508. arXiv-link  
  3. Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, and Peter Widmayer. 2018. Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, Springer, 191–215. DOI-link  
  4. Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès. 2018. Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22:1–22:15. DOI-link  
  5. Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, and Christina Karousatou. 2018. Maximal Exploration of Trees with Energy-Constrained Agents. CoRR abs/1802.06636. arXiv-link  
  6. Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès. 2018. Fast approximation and exact computation of negative curvature parameters of graphs. CoRR abs/1803.06324. arXiv-link  
  7. Jérémie Chalopin and Victor Chepoi. 2018. 1-Safe Petri nets and special cube complexes: equivalence and applications. CoRR abs/1810.03395. arXiv-link  
  8. Jérémie Chalopin, Victor Chepoi, Shay Moran, and Manfred K. Warmuth. 2018. Unlabeled sample compression schemes and corner peelings for ample and maximum classes. CoRR abs/1812.02099. arXiv-link  
  9. Cedric Berenger, Peter Niebert, and Kévin Perrot. 2018. Balanced Connected Partitioning of Unweighted Grid Graphs. 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 39:1–39:18. DOI-link  
  10. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2018. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, January 4-7, 2018, ACM, 7:1–7:10. DOI-link  
  11. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, and Philipp Woelfel. 2018. Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723. arXiv-link  
  12. Shantanu Das, Dariusz Dereniowski, and Christina Karousatou. 2018. Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. Theory Comput. Syst. 62, 5: 1223–1240. DOI-link  
  13. Shantanu Das, Dariusz Dereniowski, and Przemyslaw Uznanski. 2018. Brief Announcement: Energy Constrained Depth First Search. 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 165:1–165:5. DOI-link  
  14. Shantanu Das, Giuseppe Antonio Di Luna, and Leszek Antoni Gasieniec. 2018. Patrolling on Dynamic Ring Networks. CoRR abs/1808.04349. arXiv-link  
  15. Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2018. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80, 11: 3023–3049. DOI-link  
  16. Claire Capdevielle, Colette Johnen, and Alessia Milani. 2018. On the complexity of basic abstractions to implement consensus. Theor. Comput. Sci. 715: 86–96. DOI-link  

2017

  1. Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, and Euripides Markou. 2017. Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. CoRR abs/1710.00775. arXiv-link  
  2. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2017. On density of subgraphs of halved cubes. CoRR abs/1711.11414. arXiv-link  
  3. Victor Chepoi, Arnaud Labourel, and Sébastien Ratel. 2017. On density of subgraphs of Cartesian products. CoRR abs/1711.11485. arXiv-link  
  4. Jérémie Chalopin and Victor Chepoi. 2017. A Counterexample to Thiagarajan’s Conjecture on Regular Event Structures. 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 101:1–101:14. DOI-link  
  5. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, et al. 2017. Energy-Efficient Delivery by Heterogeneous Mobile Agents. 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1–10:14. DOI-link  
  6. Damien Imbs, Petr Kuznetsov, and Thibault Rieutord. 2017. Progress-Space Tradeoffs in Single-Writer Memory Implementations. 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:17. DOI-link  
  7. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2017. Which Broadcast Abstraction Captures k-Set Agreement? 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 27:1–27:16. DOI-link  
  8. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2017. Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). CoRR abs/1702.08176. arXiv-link  
  9. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2017. Which Broadcast Abstraction Captures \textdollark\textdollar-Set Agreement? CoRR abs/1705.04835. arXiv-link  
  10. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2017. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267. arXiv-link  
  11. Damien Imbs, Petr Kuznetsov, and Thibault Rieutord. 2017. Progress-Space Tradeoffs in Single-Writer Memory Implementations. CoRR abs/1709.01879. arXiv-link  
  12. Evangelos Bampas, Shantanu Das, Dariusz Dereniowski, and Christina Karousatou. 2017. Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, Springer, 1–12. DOI-link  
  13. Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, and Giovanni Viglietta. 2017. Mediated Population Protocols: Leader Election and Applications. Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings, 172–186. DOI-link  
  14. Shantanu Das and Sébastien Tixeuil, eds. 2017. Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers. Springer. DOI-link  
  15. Shantanu Das, Dariusz Dereniowski, and Przemyslaw Uznanski. 2017. Energy Constrained Depth First Search. CoRR abs/1709.10146. arXiv-link  
  16. Claire Capdevielle, Colette Johnen, Petr Kuznetsov, and Alessia Milani. 2017. On the uncontended complexity of anonymous agreement. Distributed Comput. 30, 6: 459–468. DOI-link  

2016

  1. Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès. 2016. Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74, 1: 117–155. DOI-link  
  2. Louis Esperet, Daniel Gonçalves, and Arnaud Labourel. 2016. Coloring Non-Crossing Strings. Electron. J. Comb. 23, 4: P4.4.
  3. Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc. 2016. Rendezvous in networks in spite of delay faults. Distributed Comput. 29, 3: 187–205. DOI-link  
  4. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, et al. 2016. Collaborative Delivery with Energy-Constrained Mobile Robots. Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, 258–274. DOI-link  
  5. Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès. 2016. Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234. arXiv-link  
  6. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, et al. 2016. Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500. arXiv-link  
  7. Jérémie Chalopin, Louis Esperet, Zhentao Li, and Patrice Ossona de Mendez. 2016. Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. 23, 1: P1.30.
  8. Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, and Peter Widmayer. 2016. Sequence Hypergraphs. Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers, 282–294. DOI-link  
  9. Jérémie Chalopin, Emmanuel Godard, and Antoine Naudin. 2016. Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR abs/1604.05915. arXiv-link  
  10. Jérémie Chalopin and Victor Chepoi. 2016. A counterexample to Thiagarajan’s conjecture. CoRR abs/1605.08288. arXiv-link  
  11. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, et al. 2016. Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR abs/1610.02361. arXiv-link  
  12. Emmanuel Godard and Eloi Perdereau. 2016. k-Set Agreement in Communication Networks with Omission Faults. 20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13-16, 2016, Madrid, Spain, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 8:1–8:17. DOI-link  
  13. Emmanuel Godard. 2016. Snap-Stabilizing Tasks in Anonymous Networks. Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings, 170–184. DOI-link  
  14. Zohir Bouzid, Damien Imbs, and Michel Raynal. 2016. A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116, 12: 757–759. DOI-link  
  15. Damien Imbs, Sergio Rajsbaum, Michel Raynal, and Julien Stainer. 2016. Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems. J. Parallel Distributed Comput. 93-94: 1–9. DOI-link  
  16. Damien Imbs and Michel Raynal. 2016. Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast. Parallel Process. Lett. 26, 4: 1650017:1–1650017:8. DOI-link  
  17. Armando Castañeda, Damien Imbs, Sergio Rajsbaum, and Michel Raynal. 2016. Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. 45, 2: 379–414. DOI-link  
  18. Damien Imbs, Michel Raynal, and Julien Stainer. 2016. Are Byzantine Failures Really Different from Crash Failures? Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, Springer, 215–229. DOI-link  
  19. Dmitry Feichtner-Kozlov and Damien Imbs. 2016. Topological Methods in Distributed Computing (Dagstuhl Seminar 16282). Dagstuhl Reports 6, 7: 31–41. DOI-link  
  20. Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Masafumi Yamashita. 2016. Autonomous mobile robots with lights. Theor. Comput. Sci. 609: 171–184. DOI-link  
  21. Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, and Marco Squarcina. 2016. Gathering of Robots in a Ring with Mobile Faults. Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016, CEUR-WS.org, 122–135.
  22. Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, and Lukasz Kuszner. 2016. Distributed Evacuation in Graphs with Multiple Exits. Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, 228–241. DOI-link  
  23. Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, and Corentin Travers. 2016. Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29, 4: 251–277. DOI-link  
  24. Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2016. Counting in Practical Anonymous Dynamic Networks is Polynomial. Networked Systems - 4th International Conference, NETYS 2016, Marrakech, Morocco, May 18-20, 2016, Revised Selected Papers, Springer, 131–136. DOI-link  
  25. Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2016. Counting in Practical Anonymous Dynamic Networks is Polynomial. CoRR abs/1603.05459. arXiv-link  
  26. Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, and Corentin Travers. 2016. Decentralized Asynchronous Crash-Resilient Runtime Verification. 27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1–16:15. DOI-link  
  27. Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2016. Challenges in Fault-Tolerant Distributed Runtime Verification. Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part II, 363–370. DOI-link  
  28. Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2016. Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, Springer, 497–508. DOI-link  
  29. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, and Thibault Rieutord. 2016. Perfect Failure Detection with Very Few Bits. Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings, 154–169. DOI-link  
  30. Zohir Bouzid and Corentin Travers. 2016. Anonymity-Preserving Failure Detectors. Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, Springer, 173–186. DOI-link  

2015

  1. Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, and Przemyslaw Uznanski. 2015. Limit Behavior of the Multi-agent Rotor-Router System. Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings, Springer, 123–139. DOI-link  
  2. Louis Esperet, Daniel Gonçalves, and Arnaud Labourel. 2015. Coloring non-crossing strings. CoRR abs/1511.03827. arXiv-link  
  3. Jérémie Chalopin, Victor Chepoi, and Guyslain Naves. 2015. Isometric Embedding of Busemann Surfaces into L\(_\mbox1\). Discret. Comput. Geom. 53, 1: 16–37. DOI-link  
  4. Jérémie Chalopin, Victor Chepoi, and Damian Osajda. 2015. On two conjectures of Maurer concerning basis graphs of matroids. J. Comb. Theory, Ser. B 114: 1–32. DOI-link  
  5. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2015. Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11, 4: 33:1–33:16. DOI-link  
  6. Jérémie Chalopin, Emmanuel Godard, and Antoine Naudin. 2015. Anonymous Graph Exploration with Binoculars. Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings, Springer, 107–122. DOI-link  
  7. Jérémie Chalopin, Emmanuel Godard, and Antoine Naudin. 2015. Anonymous Graph Exploration with Binoculars. CoRR abs/1505.00599. arXiv-link  
  8. Étienne Coulouma, Emmanuel Godard, and Joseph G. Peters. 2015. A characterization of oblivious message adversaries for which Consensus is solvable. Theor. Comput. Sci. 584: 80–90. DOI-link  
  9. Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, and Masafumi Yamashita. 2015. On the expressivity of time-varying graphs. Theor. Comput. Sci. 590: 27–37. DOI-link  
  10. Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, and Michel Raynal. 2015. Failure detectors in homonymous distributed systems (with an application to consensus). J. Parallel Distributed Comput. 83: 83–95. DOI-link  
  11. Damien Imbs. 2015. The Synchronization Power of Atomic Bitwise Operations. 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 26:1–26:17. DOI-link  
  12. Damien Imbs, Sergio Rajsbaum, and Adrián Valle. 2015. Untangling Partial Agreement: Iterated x-consensus Simulations. Stabilization, Safety, and Security of Distributed Systems - 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings, Springer, 139–155. DOI-link  
  13. Damien Imbs and Michel Raynal. 2015. Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes. CoRR abs/1510.06882. arXiv-link  
  14. Damien Imbs, Michel Raynal, and Julien Stainer. 2015. From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach. CoRR abs/1510.09119. arXiv-link  
  15. Zohir Bouzid, Damien Imbs, and Michel Raynal. 2015. A Necessary Condition for Byzantine \textdollark\textdollar-Set Agreement. CoRR abs/1512.06227. arXiv-link  
  16. Shantanu Das, Paola Flocchini, Nicola Santoro, and Masafumi Yamashita. 2015. Forming sequences of geometric patterns with oblivious mobile robots. Distributed Comput. 28, 2: 131–145. DOI-link  
  17. Shantanu Das, Flaminia L. Luccio, and Euripides Markou. 2015. Mobile Agents Rendezvous in Spite of a Malicious Agent. Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers, Springer, 211–224. DOI-link  
  18. Shantanu Das, Dariusz Dereniowski, and Christina Karousatou. 2015. Collaborative Exploration by Energy-Constrained Mobile Robots. Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, Springer, 357–369. DOI-link  
  19. Claire Capdevielle, Colette Johnen, Petr Kuznetsov, and Alessia Milani. 2015. On the Uncontended Complexity of Anonymous Consensus. 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12:1–12:16. DOI-link  
  20. Alessia Milani and Miguel A. Mosteiro. 2015. A Faster Counting Protocol for Anonymous Dynamic Networks. 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 28:1–28:13. DOI-link  
  21. Hagit Attiya, Vincent Gramoli, and Alessia Milani. 2015. Directory Protocols for Distributed Transactional Memory. In R. Guerraoui and P. Romano, eds., Transactional Memory. Foundations, Algorithms, Tools, and Applications - COST Action Euro-TM IC1001. Springer, 367–391. DOI-link  
  22. Alessia Milani and Miguel A. Mosteiro. 2015. A Faster Counting Protocol for Anonymous Dynamic Networks. CoRR abs/1509.02140. arXiv-link  
  23. David Bonnin and Corentin Travers. 2015. Splitting and Renaming with a Majority of Faulty Processes. Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, January 4-7, 2015, ACM, 26:1–26:10. DOI-link  

2014

  1. Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc. 2014. Fault-Tolerant Rendezvous in Networks. Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Springer, 411–422. DOI-link  
  2. Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc. 2014. Fault-Tolerant Rendezvous in Networks. CoRR abs/1402.2760. arXiv-link  
  3. Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, and Przemyslaw Uznanski. 2014. Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200. arXiv-link  
  4. Jérémie Chalopin and Daniël Paulusma. 2014. Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. 168: 40–50. DOI-link  
  5. Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, and Timothée Pecatte. 2014. Cop and Robber Game and Hyperbolicity. SIAM J. Discret. Math. 28, 4: 1987–2007. DOI-link  
  6. Jérémie Chalopin, Riko Jacob, Matús Mihalák, and Peter Widmayer. 2014. Data Delivery by Energy-Constrained Mobile Agents on a Line. Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Springer, 423–434. DOI-link  
  7. Jérémie Chalopin, Emmanuel Godard, and Antoine Naudin. 2014. What Do We Need to Know to Elect in Networks with Unknown Participants? Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, Springer, 279–294. DOI-link  
  8. Emmanuel Godard and Dorian Mazauric. 2014. Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. Algorithms for Sensor Systems - 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers, Springer, 88–102. DOI-link  
  9. Peter Niebert and Mathieu Caralp. 2014. Cellular Programming. Theory and Practice of Natural Computing - Third International Conference, TPNC 2014, Granada, Spain, December 9-11, 2014. Proceedings, Springer, 11–22. DOI-link  
  10. Damien Imbs, Sergio Rajsbaum, Michel Raynal, and Julien Stainer. 2014. Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems. Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, Springer, 37–53. DOI-link  
  11. Shantanu Das, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. 2014. Synchronized Dancing of Oblivious Chameleons. Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, Springer, 113–124. DOI-link  
  12. Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, and Przemyslaw Uznanski. 2014. Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, Springer, 295–310. DOI-link  
  13. Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, and Przemyslaw Uznanski. 2014. Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR abs/1406.2795. arXiv-link  
  14. Claire Capdevielle, Colette Johnen, and Alessia Milani. 2014. Solo-Fast Universal Constructions for Deterministic Abortable Objects. Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings, Springer, 288–302. DOI-link  
  15. Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, and Corentin Travers. 2014. The Opinion Number of Set-Agreement. Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Cortina d’Ampezzo, Italy, December 16-19, 2014. Proceedings, Springer, 155–170. DOI-link  
  16. Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2014. On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. Runtime Verification - 5th International Conference, RV 2014, Toronto, ON, Canada, September 22-25, 2014. Proceedings, Springer, 92–107. DOI-link  

2013

  1. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2013. Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225: 16–28. DOI-link  
  2. Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, and Yann Vaxès. 2013. Retracts of Products of Chordal Graphs. J. Graph Theory 73, 2: 161–180. DOI-link  
  3. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, and Euripides Markou. 2013. Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509: 70–85. DOI-link  
  4. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2013. Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65, 1: 43–59. DOI-link  
  5. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2013. Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. 161, 10-11: 1287–1307. DOI-link  
  6. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. 2013. Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. 9, 1-2: 5–36.
  7. Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, and Peter Widmayer. 2013. Data Delivery by Energy-Constrained Mobile Agents. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, Springer, 111–122. DOI-link  
  8. Jérémie Chalopin, Victor Chepoi, and Guyslain Naves. 2013. Isometric embedding of Busemann surfaces into L\(_\mbox1\). CoRR abs/1308.3181. arXiv-link  
  9. Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, and Timothée Pecatte. 2013. Cop and robber game and hyperbolicity. CoRR abs/1308.3987. arXiv-link  
  10. Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, and Masafumi Yamashita. 2013. Expressivity of Time-Varying Graphs. Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, Springer, 95–106. DOI-link  
  11. Étienne Coulouma and Emmanuel Godard. 2013. A Characterization of Dynamic Networks Where Consensus Is Solvable. Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers, Springer, 24–35. DOI-link  
  12. Tyler Crain, Damien Imbs, and Michel Raynal. 2013. Towards a universal construction for transaction-based multiprocess programs. Theor. Comput. Sci. 496: 154–169. DOI-link  
  13. Damien Imbs and Michel Raynal. 2013. The weakest failure detector to implement a register in asynchronous systems with hybrid communication. Theor. Comput. Sci. 512: 130–142. DOI-link  
  14. Andreas Emil Feldmann, Shantanu Das, and Peter Widmayer. 2013. Corner cuts are close to optimal: From solid grids to polygons and back. Discret. Appl. Math. 161, 7-8: 970–998. DOI-link  
  15. Shantanu Das. 2013. Mobile agents in distributed computing: Network exploration. Bull. EATCS 109: 54–69.
  16. Eduardo Mesa Barrameda, Shantanu Das, and Nicola Santoro. 2013. Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, Springer, 228–243. DOI-link  
  17. Shantanu Das, Shay Kutten, and Zvi Lotker. 2013. Distributed Verification Using Mobile Agents. Distributed Computing and Networking, 14th International Conference, ICDCN 2013, Mumbai, India, January 3-6, 2013. Proceedings, Springer, 330–347. DOI-link  
  18. Zohir Bouzid, Shantanu Das, and Sébastien Tixeuil. 2013. Gathering of Mobile Robots Tolerating Multiple Crash Faults. IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, IEEE Computer Society, 337–346. DOI-link  
  19. Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2013. Locality and checkability in wait-free computing. Distributed Comput. 26, 4: 223–242. DOI-link  
  20. Zohir Bouzid and Corentin Travers. 2013. Parallel Consensus is Harder than Set Agreement in Message Passing. IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, IEEE Computer Society, 611–620. DOI-link  
  21. David Bonnin and Corentin Travers. 2013. \(α\)-Register. Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings, Springer, 53–67. DOI-link  

2012

  1. Jurek Czyzowicz, Andrzej Pelc, and Arnaud Labourel. 2012. How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, 4: 37:1–37:14. DOI-link  
  2. Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès. 2012. Collecting Information by Power-Aware Mobile Agents. Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, Springer, 46–60. DOI-link  
  3. Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. 2012. Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25, 4: 297–311. DOI-link  
  4. Jérémie Chalopin, Yves Métivier, and Thomas Morsellino. 2012. Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae 120, 1: 1–27. DOI-link  
  5. Jérémie Chalopin, Yves Métivier, and Thomas Morsellino. 2012. On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers, Springer, 207–218. DOI-link  
  6. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2012. Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850. arXiv-link  
  7. Jérémie Chalopin, Victor Chepoi, and Damian Osajda. 2012. Proof of two Maurer’s conjectures on basis graphs of matroids. CoRR abs/1212.6879. arXiv-link  
  8. Victor Chepoi, Tristan Fevat, Emmanuel Godard, and Yann Vaxès. 2012. A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62, 1-2: 146–168. DOI-link  
  9. Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, and Masafumi Yamashita. 2012. Brief announcement: waiting in dynamic networks. ACM Symposium on Principles of Distributed Computing, PODC ’12, Funchal, Madeira, Portugal, July 16-18, 2012, ACM, 99–100. DOI-link  
  10. Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, and Masafumi Yamashita. 2012. Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975. arXiv-link  
  11. Damien Imbs. 2012. Calculabilité et conditions de progression des objets partagés en présence de défaillances. (Calculability and progress conditions of shared objects when facing crashes). Retrieved from https://tel.archives-ouvertes.fr/tel-00722855.
  12. Damien Imbs and Michel Raynal. 2012. Help when needed, but no more: Efficient read/write partial snapshot. J. Parallel Distributed Comput. 72, 1: 1–12. DOI-link  
  13. Damien Imbs and Michel Raynal. 2012. Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations). Theor. Comput. Sci. 444: 113–127. DOI-link  
  14. Damien Imbs and Michel Raynal. 2012. Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register. IEEE 26th International Conference on Advanced Information Networking and Applications, AINA, 2012 , Fukuoka, Japan, March 26-29, 2012, IEEE Computer Society, 326–330. DOI-link  
  15. Tyler Crain, Damien Imbs, and Michel Raynal. 2012. Towards a Universal Construction for Transaction-Based Multiprocess Programs. Distributed Computing and Networking - 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012. Proceedings, Springer, 61–75. DOI-link  
  16. Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, and Michel Raynal. 2012. Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). 2012 IEEE 32nd International Conference on Distributed Computing Systems, Macau, China, June 18-21, 2012, IEEE Computer Society, 275–284. DOI-link  
  17. Armando Castañeda, Damien Imbs, Sergio Rajsbaum, and Michel Raynal. 2012. Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, Springer, 145–156. DOI-link  
  18. Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Masafumi Yamashita. 2012. The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. 2012 IEEE 32nd International Conference on Distributed Computing Systems, Macau, China, June 18-21, 2012, IEEE Computer Society, 506–515. DOI-link  
  19. Zohir Bouzid, Shantanu Das, and Sébastien Tixeuil. 2012. Brief Announcement: Wait-Free Gathering of Mobile Robots. Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, Springer, 401–402. DOI-link  
  20. Zohir Bouzid, Shantanu Das, and Sébastien Tixeuil. 2012. Wait-Free Gathering of Mobile Robots. CoRR abs/1207.0226. arXiv-link  
  21. Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2012. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25, 4: 279–296. DOI-link  
  22. Hagit Attiya and Alessia Milani. 2012. Transactional scheduling for read-dominated workloads. J. Parallel Distributed Comput. 72, 10: 1386–1396. DOI-link  
  23. Vincent Gramoli and Alessia Milani. 2012. WTTM 2012, the fourth workshop on the theory of transactional memory. SIGACT News 43, 4: 116–122. DOI-link  
  24. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2012. Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, Springer, 303–314. DOI-link  
  25. Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, and Corentin Travers. 2012. Universal constructions that ensure disjoint-access parallelism and wait-freedom. ACM Symposium on Principles of Distributed Computing, PODC ’12, Funchal, Madeira, Portugal, July 16-18, 2012, ACM, 115–124. DOI-link  
  26. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2012. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithmica 62, 1-2: 595–629. DOI-link  
  27. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2012. Generating Fast Indulgent Algorithms. Theory Comput. Syst. 51, 4: 404–424. DOI-link  
  28. Dan Alistarh, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. 2012. Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers, Springer, 195–206. DOI-link  
  29. Zohir Bouzid and Corentin Travers. 2012. Brief Announcement: Anonymity, Failures, Detectors and Consensus. Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, Springer, 427–428. DOI-link  

2011

  1. Jurek Czyzowicz, Arnaud Labourel, and Andrzej Pelc. 2011. Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209, 1: 74–88. DOI-link  
  2. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2011. Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412, 50: 6926–6937. DOI-link  
  3. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, and Euripides Markou. 2011. Tight Bounds for Scattered Black Hole Search in a Ring. Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings, Springer, 186–197. DOI-link  
  4. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, and Euripides Markou. 2011. Black Hole Search with Finite Automata Scattered in a Synchronous Torus. Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings, Springer, 432–446. DOI-link  
  5. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, and Euripides Markou. 2011. Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings. CoRR abs/1104.5076. arXiv-link  
  6. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, and Euripides Markou. 2011. Black Hole Search with Finite Automata Scattered in a Synchronous Torus. CoRR abs/1106.6037. arXiv-link  
  7. Jérémie Chalopin and Daniël Paulusma. 2011. Graph labelings derived from models in distributed computing: A complete complexity classification. Networks 58, 3: 207–231. DOI-link  
  8. Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, and Yann Vaxès. 2011. Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25, 1: 333–359. DOI-link  
  9. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. 2011. Computing with Pavlovian Populations. Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, Springer, 409–420. DOI-link  
  10. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2011. Telling convex from reflex allows to map a polygon. 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 153–164. DOI-link  
  11. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. 2011. Asymetric Pavlovian Populations. CoRR abs/1109.4433. arXiv-link  
  12. Tristan Fevat and Emmanuel Godard. 2011. Minimal Obstructions for the Coordinated Attack Problem and Beyond. 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May, 2011 - Conference Proceedings, IEEE, 1001–1011. DOI-link  
  13. Emmanuel Godard and Joseph G. Peters. 2011. Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings, Springer, 29–41. DOI-link  
  14. Emmanuel Godard and Joseph G. Peters. 2011. Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. CoRR abs/1106.3579. arXiv-link  
  15. Janusz Malinowski, Peter Niebert, and Pierre-Alain Reynier. 2011. A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, Taipei, Taiwan, October 11-14, 2011. Proceedings, Springer, 198–212. DOI-link  
  16. Damien Imbs and Michel Raynal. 2011. A liveness condition for concurrent objects: x-wait-freedom. Concurr. Comput. Pract. Exp. 23, 17: 2154–2166. DOI-link  
  17. Damien Imbs and Michel Raynal. 2011. Software transactional memories: an approach for multicore programming. J. Supercomput. 57, 2: 203–215. DOI-link  
  18. Tyler Crain, Damien Imbs, and Michel Raynal. 2011. Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible. Algorithms and Architectures for Parallel Processing - 11th International Conference, ICA3PP, Melbourne, Australia, October 24-26, 2011, Proceedings, Part I, Springer, 244–257. DOI-link  
  19. Damien Imbs and Michel Raynal. 2011. A Simple Snapshot Algorithm for Multicore Systems. 5th Latin-American Symposium on Dependable Computing, LADC 2011, São José dos Campos, Brazil, 25-29 April 2011, IEEE Computer Society, 17–24. DOI-link  
  20. Damien Imbs, Sergio Rajsbaum, and Michel Raynal. 2011. The universe of symmetry breaking tasks. Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011, ACM, 287–288. DOI-link  
  21. Damien Imbs, Sergio Rajsbaum, and Michel Raynal. 2011. The Universe of Symmetry Breaking Tasks. Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings, Springer, 66–77. DOI-link  
  22. Tyler Crain, Damien Imbs, and Michel Raynal. 2011. Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011), ACM, 315–316. DOI-link  
  23. Damien Imbs and Michel Raynal. 2011. The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication. Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Grenoble, France, October 10-12, 2011. Proceedings, Springer, 268–282. DOI-link  
  24. Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, and Michel Raynal. 2011. Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). CoRR abs/1110.1842. arXiv-link  
  25. Andreas Emil Feldmann, Shantanu Das, and Peter Widmayer. 2011. Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, Springer, 143–154. DOI-link  
  26. Hagit Attiya, Eshcar Hillel, and Alessia Milani. 2011. Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49, 4: 698–719. DOI-link  
  27. Roberto Baldoni, Antonio Fernández Anta, Kleoni Ioannidou, and Alessia Milani. 2011. The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost. Theor. Comput. Sci. 412, 12-14: 1066–1080. DOI-link  
  28. François Bonnet, Alessia Milani, Maria Potop-Butucaru, and Sébastien Tixeuil. 2011. Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, Springer, 251–265. DOI-link  
  29. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2011. Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings, Springer, 202–204. DOI-link  
  30. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2011. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR abs/1105.6151. arXiv-link  
  31. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2011. Generating Fast Indulgent Algorithms. Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Bangalore, India, January 2-5, 2011. Proceedings, Springer, 41–52. DOI-link  
  32. Zohir Bouzid, Pierre Sutra, and Corentin Travers. 2011. Anonymous Agreement: The Janus Algorithm. Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, Springer, 175–190. DOI-link  
  33. Pierre Fraigniaud, Sergio Rajsbaum, and Corentin Travers. 2011. Locality and Checkability in Wait-Free Computing. Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings, Springer, 333–347. DOI-link  

2010

  1. Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, and Arnaud Labourel. 2010. Tell Me Where I Am So I Can Meet You Sooner. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, Springer, 502–514. DOI-link  
  2. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2010. Asynchronous Deterministic Rendezvous in Bounded Terrains. Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings, Springer, 72–85. DOI-link  
  3. Jurek Czyzowicz, Arnaud Labourel, and Andrzej Pelc. 2010. How to Meet Asynchronously (Almost) Everywhere. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, SIAM, 22–30. DOI-link  
  4. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2010. Optimal Exploration of Terrains with Obstacles. Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings, Springer, 1–12. DOI-link  
  5. Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, and Arnaud Labourel. 2010. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 297–311. DOI-link  
  6. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2010. Optimal Exploration of Terrains with Obstacles. CoRR abs/1001.0639. arXiv-link  
  7. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc. 2010. Asynchronous deterministic rendezvous in bounded terrains. CoRR abs/1001.0889. arXiv-link  
  8. Jurek Czyzowicz, Arnaud Labourel, and Andrzej Pelc. 2010. How to meet asynchronously (almost) everywhere. CoRR abs/1001.0890. arXiv-link  
  9. Jérémie Chalopin and Yves Métivier. 2010. On the power of synchronization between two adjacent processes. Distributed Comput. 23, 3: 177–196. DOI-link  
  10. Jérémie Chalopin, Daniel Gonçalves, and Pascal Ochem. 2010. Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43, 3: 626–647. DOI-link  
  11. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. 2010. How Simple Robots Benefit from Looking Back. Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, Springer, 229–239. DOI-link  
  12. Jérémie Chalopin and Daniël Paulusma. 2010. Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, Springer, 276–287. DOI-link  
  13. Jérémie Chalopin and Shantanu Das. 2010. Rendezvous of Mobile Agents without Agreement on Local Orientation. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, Springer, 515–526. DOI-link  
  14. Jérémie Chalopin, Shantanu Das, and Adrian Kosowski. 2010. Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings, Springer, 119–134. DOI-link  
  15. Jérémie Chalopin, Shantanu Das, and Peter Widmayer. 2010. Rendezvous of Mobile Agents in Directed Graphs. Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 282–296. DOI-link  
  16. Jérémie Chalopin, Paola Flocchini, Bernard Mans, and Nicola Santoro. 2010. Network Exploration by Silent and Oblivious Robots. Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, 208–219. DOI-link  
  17. Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, and Yann Vaxès. 2010. Cop and robber games when the robber can hide and ride. CoRR abs/1001.4457. arXiv-link  
  18. Emmanuel Godard, Yves Métivier, and Gerard Tel. 2010. Termination Detection of Local Computations. CoRR abs/1001.2785. arXiv-link  
  19. Janusz Malinowski and Peter Niebert. 2010. SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata. Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, Springer, 405–419. DOI-link  
  20. Damien Imbs and Michel Raynal. 2010. The x-Wait-Freedom Progress Condition. Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part I, Springer, 584–595. DOI-link  
  21. Damien Imbs and Michel Raynal. 2010. The multiplicative power of consensus numbers. Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 26–35. DOI-link  
  22. Damien Imbs, Michel Raynal, and Gadi Taubenfeld. 2010. On asymmetric progress conditions. Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 55–64. DOI-link  
  23. Damien Imbs and Michel Raynal. 2010. On Adaptive Renaming under Eventually Limited Contention. Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings, Springer, 377–387. DOI-link  
  24. Shantanu Das, Beat Gfeller, and Peter Widmayer. 2010. Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14, 2: 287–306. DOI-link  
  25. Andreas Emil Feldmann, Shantanu Das, and Peter Widmayer. 2010. Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I, Springer, 11–20. DOI-link  
  26. Shantanu Das, Paola Flocchini, Nicola Santoro, and Masafumi Yamashita. 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, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 267–276. DOI-link  
  27. Hagit Attiya, Vincent Gramoli, and Alessia Milani. 2010. Brief announcement: combine – an improved directory-based consistency protocol. SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, ACM, 72–73. DOI-link  
  28. Hagit Attiya, Vincent Gramoli, and Alessia Milani. 2010. A Provably Starvation-Free Distributed Directory Protocol. Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings, Springer, 405–419. DOI-link  
  29. Lélia Blin, Alessia Milani, Maria Potop-Butucaru, and Sébastien Tixeuil. 2010. Exclusive Perpetual Ring Exploration without Chirality. Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 312–327. DOI-link  
  30. Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2010. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 374–388. DOI-link  
  31. Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2010. The k-simultaneous consensus problem. Distributed Comput. 22, 3: 185–195. DOI-link  
  32. Philippe Raipin Parvédy, Michel Raynal, and Corentin Travers. 2010. Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Theory Comput. Syst. 47, 1: 259–287. DOI-link  
  33. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2010. Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Theor. Comput. Sci. 411, 1: 58–69. DOI-link  
  34. Zohir Bouzid and Corentin Travers. 2010. (anti-Omega\(^\mboxx\) \texttimesSigma\(_\mboxz\))-Based k-Set Agreement Algorithms. Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings, Springer, 189–204. DOI-link  
  35. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2010. Brief Announcement: New Bounds for Partially Synchronous Set Agreement. Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 404–405. DOI-link  

2009

  1. Louis Esperet, Daniel Gonçalves, and Arnaud Labourel. 2009. Coloring a set of touching strings. Electron. Notes Discret. Math. 34: 213–217. DOI-link  
  2. Jurek Czyzowicz, Arnaud Labourel, and Andrzej Pelc. 2009. Optimality and Competitiveness of Exploring Polygons by Mobile Robots. Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, Springer, 263–274. DOI-link  
  3. Jérémie Chalopin and Daniel Gonçalves. 2009. Every planar graph is the intersection graph of segments in the plane: extended abstract. Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, ACM, 631–638. DOI-link  
  4. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, and Xavier Koegler. 2009. Population Protocols that Correspond to Symmetric Games. CoRR abs/0907.3126. arXiv-link  
  5. Peter Niebert and Doron A. Peled. 2009. Efficient model checking for LTL with partial order snapshots. Theor. Comput. Sci. 410, 42: 4180–4189. DOI-link  
  6. Damien Imbs and Michel Raynal. 2009. A note on atomicity: Boosting Test&Set to solve consensus. Inf. Process. Lett. 109, 12: 589–591. DOI-link  
  7. Damien Imbs and Michel Raynal. 2009. Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort. Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009. Proceedings, Springer, 67–78. DOI-link  
  8. Damien Imbs and Michel Raynal. 2009. Software Transactional Memories: An Approach for Multicore Programming. Parallel Computing Technologies, 10th International Conference, PaCT 2009, Novosibirsk, Russia, August 31-September 4, 2009. Proceedings, Springer, 26–40. DOI-link  
  9. Damien Imbs, Mendı́vil José Ramón González, and Michel Raynal. 2009. Brief announcement: virtual world consistency: a new condition for STM systems. Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, ACM, 280–281. DOI-link  
  10. Damien Imbs and Michel Raynal. 2009. A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition. Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers, Springer, 266–280. DOI-link  
  11. Damien Imbs and Michel Raynal. 2009. Visiting Gafni’s Reduction Land: From the BG Simulation to the Extended BG Simulation. Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 369–383. DOI-link  
  12. Damien Imbs and Michel Raynal. 2009. Help When Needed, But No More: Efficient Read/Write Partial Snapshot. Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, Springer, 142–156. DOI-link  
  13. Shantanu Das. 2009. Review of SIROCCO 2009. SIGACT News 40, 4: 93–97. DOI-link  
  14. Shantanu Das, Hai Liu, Amiya Nayak, and Ivan Stojmenovic. 2009. A localized algorithm for bi-connectivity of connected mobile robots. Telecommun. Syst. 40, 3-4: 129–140. DOI-link  
  15. Hagit Attiya and Alessia Milani. 2009. Transactional Scheduling for Read-Dominated Workloads. Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nı̂mes, France, December 15-18, 2009. Proceedings, Springer, 3–17. DOI-link  
  16. Hagit Attiya, Eshcar Hillel, and Alessia Milani. 2009. Inherent limitations on disjoint-access parallel implementations of transactional memory. SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, ACM, 69–78. DOI-link  
  17. Hagit Attiya and Alessia Milani. 2009. Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, Springer, 108–110. DOI-link  
  18. Eli Gafni, Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2009. From adaptive renaming to set agreement. Theor. Comput. Sci. 410, 14: 1328–1335. DOI-link  
  19. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2009. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 943–953. DOI-link  
  20. Antonio Fernández Anta, Sergio Rajsbaum, and Corentin Travers. 2009. Brief announcement: weakest failure detectors via an egg-laying simulation. Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, ACM, 290–291. DOI-link  

2008

  1. Arnaud Labourel. 2008. On Universal Graphs of Minor Closed Families. Electron. Notes Discret. Math. 31: 85–89. DOI-link  
  2. Louis Esperet, Arnaud Labourel, and Pascal Ochem. 2008. On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108, 5: 255–260. DOI-link  
  3. Jérémie Chalopin and Pascal Ochem. 2008. Dejean’s conjecture and letter frequency. RAIRO Theor. Informatics Appl. 42, 3: 477–480. DOI-link  
  4. Jérémie Chalopin. 2008. Election and rendezvous with incomparable labels. Theor. Comput. Sci. 399, 1-2: 54–70. DOI-link  
  5. Jérémie Chalopin, Antoni W. Mazurkiewicz, and Yves Métivier. 2008. Labelled (Hyper)Graphs, Negotiations and the Naming Problem. Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, Springer, 54–68. DOI-link  
  6. Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. 2008. Local Terminations and Distributed Computability in Anonymous Networks. Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, Springer, 47–62. DOI-link  
  7. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, and Xavier Koegler. 2008. Playing With Population Protocols. Proceedings International Workshop on The Complexity of Simple Programs, CSP 2008, Cork, Ireland, 6-7th December 2008, 3–15.
  8. Peter Niebert, Doron A. Peled, and Amir Pnueli. 2008. Discriminative Model Checking. Computer Aided Verification, 20th International Conference, CAV 2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings, Springer, 504–516. DOI-link  
  9. Damien Imbs and Michel Raynal. 2008. A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness. Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings, Springer, 226–245. DOI-link  
  10. Yao Chen, Shantanu Das, Pulak Dhar, Abdulmotaleb El-Saddik, and Amiya Nayak. 2008. Detecting and Preventing IP-spoofed Distributed DoS Attacks. Int. J. Netw. Secur. 7, 1: 69–80.
  11. Eduardo Mesa Barrameda, Shantanu Das, and Nicola Santoro. 2008. Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments. Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers, Springer, 125–140. DOI-link  
  12. Shantanu Das. 2008. Mobile Agent Rendezvous in a Ring Using Faulty Tokens. Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, Springer, 292–297. DOI-link  
  13. Shantanu Das, Beat Gfeller, and Peter Widmayer. 2008. Computing Best Swaps in Optimal Tree Spanners. Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, Springer, 716–727. DOI-link  
  14. Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, and Peter Widmayer. 2008. Rendezvous of Mobile Agents When Tokens Fail Anytime. Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings, Springer, 463–480. DOI-link  
  15. Roberto Baldoni, François Bonnet, Alessia Milani, and Michel Raynal. 2008. Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109, 2: 98–103. DOI-link  
  16. Antonio Fernández Anta and Alessia Milani. 2008. Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks. Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings, Springer, 164–183. DOI-link  
  17. Roberto Baldoni, François Bonnet, Alessia Milani, and Michel Raynal. 2008. On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings, Springer, 428–445. DOI-link  
  18. Roberto Baldoni, François Bonnet, Alessia Milani, and Michel Raynal. 2008. Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, Springer, 496–497. DOI-link  
  19. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2008. On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Comput. 21, 3: 201–222. DOI-link  
  20. Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2008. An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett. 108, 3: 160–164. DOI-link  
  21. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2008. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. SIAM J. Comput. 38, 4: 1574–1601. DOI-link  
  22. Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2008. The Iterated Restricted Immediate Snapshot Model. Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, Springer, 487–497. DOI-link  
  23. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2008. Narrowing Power vs. Efficiency in Synchronous Set Agreement. Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, Springer, 99–111. DOI-link  
  24. Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. 2008. How to Solve Consensus in the Smallest Window of Synchrony. Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, Springer, 32–46. DOI-link  

2007

  1. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. 2007. Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28: 153–160. DOI-link  
  2. Cyril Gavoille and Arnaud Labourel. 2007. Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, Springer, 582–593. DOI-link  
  3. Cyril Gavoille and Arnaud Labourel. 2007. Distributed Relationship Schemes for Trees. Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, Springer, 728–738. DOI-link  
  4. Cyril Gavoille and Arnaud Labourel. 2007. On local representation of distances in trees. Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 352–353. DOI-link  
  5. Jérémie Chalopin and Pascal Ochem. 2007. Dejean’s conjecture and letter frequency. Electron. Notes Discret. Math. 28: 501–505. DOI-link  
  6. Jérémie Chalopin and Yves Métivier. 2007. An Efficient Message Passing Election Algorithm based on Mazurkiewicz’s Algorithm. Fundam. Informaticae 80, 1-3: 221–246.
  7. Jérémie Chalopin, Daniel Gonçalves, and Pascal Ochem. 2007. Planar graphs are in 1-STRING. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, SIAM, 609–617.
  8. Jérémie Chalopin, Emmanuel Godard, Yves Métivier, and Gerard Tel. 2007. About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, Springer, 200–211. DOI-link  
  9. Jérémie Chalopin, Shantanu Das, and Nicola Santoro. 2007. Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 108–122. DOI-link  
  10. Victor Chepoi, Tristan Fevat, Emmanuel Godard, and Yann Vaxès. 2007. A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, Springer, 81–95. DOI-link  
  11. Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, and Nicola Santoro. 2007. Map construction of unknown graphs by multiple agents. Theor. Comput. Sci. 385, 1-3: 34–48. DOI-link  
  12. Shantanu Das, Hai Liu, Ajith Kamath, Amiya Nayak, and Ivan Stojmenovic. 2007. Localized Movement Control for Fault Tolerance of Mobile Robot Networks. Wireless Sensor and Actor Networks - IFIP WG 6.8 First International Conference on Wireless Sensor and Actor Networks, WSAN’07, Albacete, Spain, September 24-26, 2007, Springer, 1–12. DOI-link  
  13. Shantanu Das, Amiya Nayak, Stefan Rührup, and Ivan Stojmenovic. 2007. Semi-Beaconless Power and Cost Efficient Georouting with Guaranteed Delivery using Variable Transmission Radii for Wireless Sensor Networks. IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, MASS 2007, 8-11 October 2007, Pisa, Italy, IEEE Computer Society, 1–6. DOI-link  
  14. Shantanu Das, Paola Flocchini, Nicola Santoro, and Masafumi Yamashita. 2007. Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, Springer, 289–303. DOI-link  
  15. Kleoni Ioannidou and Alessia Milani. 2007. Distributed aerial scanning in mobile ad-hoc networks. Proceedings of the 1st International Conference on Autonomic Computing and Communication Systems, Autonomics 2007, 28-30 October 2007, Rome, Italy, ACM, 12. DOI-link  
  16. Roberto Baldoni, Kleoni Ioannidou, and Alessia Milani. 2007. Solvability of geocasting in mobile ad-hoc networks. Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 386–387. DOI-link  
  17. Roberto Baldoni, Kleoni Ioannidou, and Alessia Milani. 2007. Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks. Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 48–62. DOI-link  
  18. Corentin Travers. 2007. Derrière le consensus : coordination faiblement contrainte dans les systèmes distribués asynchrones. (Beyond consensus : weak coordination in asynchronous distributed systems). Retrieved from https://tel.archives-ouvertes.fr/tel-00485704.
  19. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2007. From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. J. Parallel Distributed Comput. 67, 1: 125–129. DOI-link  
  20. Alejandro Cornejo, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2007. Failure detectors are schedulers. Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 308–309. DOI-link  
  21. Jiannong Cao, Michel Raynal, Corentin Travers, and Weigang Wu. 2007. The Eventual Leadership in Dynamic Mobile Networking Environments. 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 17-19 December, 2007, Melbourne, Victoria, Australia, IEEE Computer Society, 123–130. DOI-link  
  22. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2007. From Renaming to Set Agreement. Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, Springer, 66–80. DOI-link  
  23. Eli Gafni, Michel Raynal, and Corentin Travers. 2007. Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), Beijing, China, October 10-12, 2007, IEEE Computer Society, 93–102. DOI-link  

2006

  1. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. 2006. Short Labels by Traversal and Jumping. Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, Springer, 143–156. DOI-link  
  2. Jérémie Chalopin, Yves Métivier, and Wieslaw Zielonka. 2006. Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74, 1: 85–114.
  3. Jérémie Chalopin, Emmanuel Godard, Yves Métivier, and Rodrigue Ossamy. 2006. Mobile Agent Algorithms Versus Message Passing Algorithms. Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, Springer, 187–201. DOI-link  
  4. Jérémie Chalopin. 2006. Election in the Qualitative World. Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, Springer, 85–99. DOI-link  
  5. Jérémie Chalopin, Shantanu Das, and Nicola Santoro. 2006. Groupings and Pairings in Anonymous Networks. Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, Springer, 105–119. DOI-link  
  6. Jérémie Chalopin and Daniël Paulusma. 2006. Graph Labelings Derived from Models in Distributed Computing. Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, Springer, 301–312. DOI-link  
  7. Peter Niebert and Hongyang Qu. 2006. The Implementation of Mazurkiewicz Traces in POEM. Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006, Springer, 508–522. DOI-link  
  8. Peter Niebert and Hongyang Qu. 2006. Adding Invariants to Event Zone Automata. Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings, Springer, 290–305. DOI-link  
  9. Marcos E. Kurbán, Peter Niebert, Hongyang Qu, and Walter Vogler. 2006. Stronger Reduction Criteria for Local First Search. Theoretical Aspects of Computing - ICTAC 2006, Third International Colloquium, Tunis, Tunisia, November 20-24, 2006, Proceedings, Springer, 108–122. DOI-link  
  10. Peter Niebert and Doron A. Peled. 2006. Efficient Model Checking for LTL with Partial Order Snapshots. Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings, Springer, 272–286. DOI-link  
  11. Mourad Elhadef, Shantanu Das, and Amiya Nayak. 2006. System-Level Fault Diagnosis Using Comparison Models: An Artificial-Immune-Systems-Based Approach. J. Networks 1, 5: 43–53. DOI-link  
  12. Mourad Elhadef, Kaouther Abrougui, Shantanu Das, and Amiya Nayak. 2006. A Parallel Probabilistic System-level Fault Diagnosis Approach for Large Multiprocessor Systems. Parallel Process. Lett. 16, 1: 63–80. DOI-link  
  13. Mourad Elhadef, Shantanu Das, and Amiya Nayak. 2006. A Novel Artificial-Immune-Based Approach for System-Level Fault Diagnosis. Proceedings of the The First International Conference on Availability, Reliability and Security, ARES 2006, The International Dependability Conference - Bridging Theory and Practice, April 20-22 2006, Vienna University of Technology, Austria, IEEE Computer Society, 166–173. DOI-link  
  14. Shantanu Das, Shay Kutten, and Ayelet Yifrach. 2006. Improved Distributed Exploration of Anonymous Networks. Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006, Springer, 306–318. DOI-link  
  15. Shantanu Das, Paola Flocchini, Amiya Nayak, and Nicola Santoro. 2006. Effective Elections for Anonymous Mobile Agents. Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, Springer, 732–743. DOI-link  
  16. Roberto Baldoni, Alessia Milani, and Sara Tucci Piergiovanni. 2006. Optimal propagation-based protocols implementing causal memories. Distributed Comput. 18, 6: 461–474. DOI-link  
  17. Jean-Michel Hélary and Alessia Milani. 2006. About the Efficiency of Partial Replication to Implement Distributed Shared Memory. 2006 International Conference on Parallel Processing (ICPP 2006), 14-18 August 2006, Columbus, Ohio, USA, IEEE Computer Society, 263–270. DOI-link  
  18. Roberto Baldoni, Miroslaw Malek, Alessia Milani, and Sara Tucci Piergiovanni. 2006. Weakly-Persistent Causal Objects in Dynamic Distributed Systems. 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006),2-4 October 2006, Leeds, UK, IEEE Computer Society, 165–174. DOI-link  
  19. Achour Mostéfaoui, Eric Mourgaya, Michel Raynal, and Corentin Travers. 2006. A Time-free Assumption to Implement Eventual Leadership. Parallel Process. Lett. 16, 2: 189–208. DOI-link  
  20. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2006. Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership. IEEE Trans. Parallel Distributed Syst. 17, 7: 656–666. DOI-link  
  21. Achour Mostéfaoui, Michel Raynal, Corentin Travers, and Sergio Rajsbaum. 2006. From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 18-20 April 2006, Vienna, Austria, IEEE Computer Society, 81–86. DOI-link  
  22. Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2006. Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006, Springer, 331–341. DOI-link  
  23. Jin Yang, Jiannong Cao, Weigang Wu, and Corentin Travers. 2006. The notification based approach to implementing failure detectors in distributed systems. Proceedings of the 1st International Conference on Scalable Information Systems, Infoscale 2006, Hong Kong, May 30-June 1, 2006, ACM, 14. DOI-link  
  24. Eli Gafni, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2006. The Committee Decision Problem. LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, Springer, 502–514. DOI-link  
  25. Michel Raynal and Corentin Travers. 2006. In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, Springer, 3–19. DOI-link  
  26. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. 2006. Irreducibility and additivity of set agreement-oriented failure detector classes. Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, ACM, 153–162. DOI-link  
  27. Michel Raynal and Corentin Travers. 2006. Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems). 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 18-20 December, 2006, University of California, Riverside, USA, IEEE Computer Society, 267–274. DOI-link  
  28. Philippe Raipin Parvédy, Michel Raynal, and Corentin Travers. 2006. Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, Springer, 182–196. DOI-link  
  29. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2006. Exploring Gafni’s Reduction Land: From Omega\(^\mboxk\)to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, Springer, 1–15. DOI-link  

2005

  1. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. 2005. Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22: 421–425. DOI-link  
  2. Jérémie Chalopin, Yves Métivier, and Wieslaw Zielonka. 2005. Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85: 105–109. 
    @article{DBLP:journals/eatcs/ChalopinMZ05,
  title = {Local Computation in Graphs: The Case of Cellular Edge Local Computations},
  author = {Chalopin, J{\'{e}}r{\'{e}}mie and M{\'{e}}tivier, Yves and Zielonka, Wieslaw},
  year = {2005},
  journal = {Bull. {EATCS}},
  volume = {85},
  pages = {105--109},
  timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl = {https://dblp.org/rec/journals/eatcs/ChalopinMZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  3. Jérémie Chalopin and Yves Métivier. 2005. A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, Springer, 212–223. DOI-link  
  4. Jérémie Chalopin. 2005. Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, Springer, 82–91. DOI-link  
  5. Denis Lugiez, Peter Niebert, and Sarah Zennou. 2005. A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345, 1: 27–59. DOI-link  
  6. Mourad Elhadef, Shantanu Das, and Amiya Nayak. 2005. A parallel genetic algorithm for identifying faults in large diagnosable systems. Parallel Algorithms Appl. 20, 2: 113–125. DOI-link  
  7. Mourad Elhadef, Kaouther Abrougui, Shantanu Das, and Amiya Nayak. 2005. Probabilistic Diagnosis of Large Systems Using a Parallel Genetic Approach. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 3, CSREA Press, 1010–1016. 
    @inproceedings{DBLP:conf/pdpta/ElhadefADN05,
  title = {Probabilistic Diagnosis of Large Systems Using a Parallel Genetic Approach},
  author = {Elhadef, Mourad and Abrougui, Kaouther and Das, Shantanu and Nayak, Amiya},
  year = {2005},
  booktitle = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, {PDPTA} 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 3},
  publisher = {{CSREA} Press},
  pages = {1010--1016},
  editor = {Arabnia, Hamid R.},
  timestamp = {Tue, 28 Aug 2012 01:00:00 +0200},
  biburl = {https://dblp.org/rec/conf/pdpta/ElhadefADN05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  8. Shantanu Das, Paola Flocchini, Amiya Nayak, and Nicola Santoro. 2005. Distributed Exploration of an Unknown Graph. Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings, Springer, 99–114. DOI-link  
  9. Roy Friedman, Michel Raynal, and Corentin Travers. 2005. Two Abstractions for Implementing Atomic Objects in Dynamic Systems. Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, Springer, 73–87. DOI-link  
  10. Philippe Raipin Parvédy, Michel Raynal, and Corentin Travers. 2005. Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. Parallel Computing Technologies, 8th International Conference, PaCT 2005, Krasnoyarsk, Russia, September 5-9, 2005, Proceedings, Springer, 49–58. DOI-link  
  11. Roy Friedman, Michel Raynal, and Corentin Travers. 2005. Brief announcement: abstractions for implementing atomic objects in dynamic systems. Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, ACM, 354. DOI-link  
  12. Philippe Raipin Parvédy, Michel Raynal, and Corentin Travers. 2005. Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 12-14 December, 2005, Changsha, Hunan, China, IEEE Computer Society, 23–30. DOI-link  
  13. Achour Mostéfaoui, Michel Raynal, Corentin Travers, Stacy Patterson, Divyakant Agrawal, and Amr El Abbadi. 2005. From Static Distributed Systems to Dynamic Systems. 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005),26-28 October 2005, Orlando, FL, USA, IEEE Computer Society, 109–118. DOI-link  

2004

  1. Jérémie Chalopin and Hing Leung. 2004. On factorization forests of finite height. Theor. Comput. Sci. 310, 1-3: 489–499. DOI-link  
  2. Jérémie Chalopin and Yves Métivier. 2004. Election and Local Computations on Edges. Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, Springer, 90–104. DOI-link  
  3. Jérémie Chalopin, Yves Métivier, and Wieslaw Zielonka. 2004. Election, Naming and Cellular Edge Local Computations. Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings, Springer, 242–256. DOI-link  
  4. Emmanuel Godard, Yves Métivier, and Anca Muscholl. 2004. Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37, 2: 249–293. DOI-link  
  5. Scott Cotton, Eugene Asarin, Oded Maler, and Peter Niebert. 2004. Some Progress in Satisfiability Checking for Difference Logic. Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings, Springer, 263–276. DOI-link  
  6. Pedro R. D’Argenio and Peter Niebert. 2004. Partial Order Reduction on Concurrent Probabilistic Programs. 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 27-30 September 2004, Enschede, The Netherlands, IEEE Computer Society, 240–249. DOI-link  
  7. Denis Lugiez, Peter Niebert, and Sarah Zennou. 2004. A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, Springer, 296–311. DOI-link  
  8. Roberto Baldoni, Alessia Milani, and Sara Tucci Piergiovanni. 2004. An Optimal Protocol for Causally Consistent Distributed Shared Memory Systems. 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, IEEE Computer Society. DOI-link  
  9. Achour Mostéfaoui, Michel Raynal, and Corentin Travers. 2004. Crash-Resilient Time-Free Eventual Leadership. 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 18-20 October 2004, Florianpolis, Brazil, IEEE Computer Society, 208–217. DOI-link  

2003

  1. Guillaume Fertin, Emmanuel Godard, and André Raspaud. 2003. Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87, 1: 51–58. DOI-link  
  2. Emmanuel Godard and Yves Métivier. 2003. Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36, 6: 631–654. DOI-link  
  3. Martijn Hendriks, Gerd Behrmann, Kim Guldstrand Larsen, Peter Niebert, and Frits W. Vaandrager. 2003. Adding Symmetry Reduction to Uppaal. Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers, Springer, 46–59. DOI-link  
  4. Sarah Zennou, Manuel Yguel, and Peter Niebert. 2003. ELSE: A New Symbolic State Generator for Timed Automata. Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers, Springer, 273–280. DOI-link  
  5. Paul Caspi, Adrian Curic, Aude Maignan, Christos Sofronis, Stavros Tripakis, and Peter Niebert. 2003. From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications. Proceedings of the 2003 Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES’03). San Diego, California, USA, June 11-13, 2003, ACM, 153–162. DOI-link  
  6. Kim Guldstrand Larsen and Peter Niebert, eds. 2003. Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers. Springer. DOI-link  

2002

  1. Emmanuel Godard. 2002. A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82, 6: 299–305. DOI-link  
  2. Guillaume Fertin, Emmanuel Godard, and André Raspaud. 2002. Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84, 3: 131–139. DOI-link  
  3. Emmanuel Godard and Yves Métivier. 2002. A Characterization of Families of Graphs in Which Election Is Possible. Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings, Springer, 159–172. DOI-link  
  4. Emmanuel Godard, Yves Métivier, Mohamed Mosbah, and Afif Sellami. 2002. Termination Detection of Distributed Algorithms by Graph Relabelling Systems. Graph Transformation, First International Conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002, Proceedings, Springer, 106–119. DOI-link  
  5. Emmanuel Godard and Yves Métivier. 2002. Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002, Carleton Scientific, 149–164. 
    @inproceedings{DBLP:conf/sirocco/GodardM02,
  title = {Equivalence of Structural Knowledges in Distributed Algorithms},
  author = {Godard, Emmanuel and M{\'{e}}tivier, Yves},
  year = {2002},
  booktitle = {{SIROCCO} 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002},
  publisher = {Carleton Scientific},
  series = {Proceedings in Informatics},
  volume = {13},
  pages = {149--164},
  editor = {Kaklamanis, Christos and Kirousis, Lefteris M.},
  timestamp = {Thu, 05 Feb 2004 10:15:20 +0100},
  biburl = {https://dblp.org/rec/conf/sirocco/GodardM02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  6. Peter Niebert, Moez Mahfoudh, Eugene Asarin, Marius Bozga, Oded Maler, and Navendu Jain. 2002. Verification of Timed Automata via Satisfiability Checking. Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, Springer, 225–244. DOI-link  
  7. Denis Lugiez, Peter Niebert, and Sarah Zennou. 2002. Dynamic Bounds and Transition Merging for Local First Search. Model Checking of Software, 9th International SPIN Workshop, Grenoble, France, April 11-13, 2002, Proceedings, Springer, 221–229. DOI-link  
  8. Sébastien Bornot, Rémi Morin, Peter Niebert, and Sarah Zennou. 2002. Black Box Unfolding with Local First Search. Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, TACAS 2002, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, Proceedings, Springer, 386–400. DOI-link  

2001

  1. Emmanuel Godard and Yves Métivier. 2001. A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001, Carleton Scientific, 179–194. 
    @inproceedings{DBLP:conf/sirocco/GodardM01,
  title = {A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge},
  author = {Godard, Emmanuel and M{\'{e}}tivier, Yves},
  year = {2001},
  booktitle = {{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de N{\'{u}}ria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001},
  publisher = {Carleton Scientific},
  series = {Proceedings in Informatics},
  volume = {8},
  pages = {179--194},
  editor = {Comellas, Francesc and F{\`{a}}brega, Josep and Fraigniaud, Pierre},
  timestamp = {Thu, 05 Feb 2004 10:15:17 +0100},
  biburl = {https://dblp.org/rec/conf/sirocco/GodardM01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  2. Peter Niebert and Sergio Yovine. 2001. Computing Efficient Operation Schemes for Chemical Plants in Multi-batch Mode. Eur. J. Control 7, 4: 440–454. DOI-link  
  3. Peter Niebert, Michaela Huhn, Sarah Zennou, and Denis Lugiez. 2001. Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, Springer, 396–410. DOI-link  

2000

  1. Peter Niebert and Sergio Yovine. 2000. Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode. Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings, Springer, 338–351. DOI-link  

1999

  1. Michaela Huhn, Peter Niebert, and Frank Wallner. 1999. Model Checking Logics for Communicating Sequential Agents. Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS’99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS’99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings, Springer, 227–242. DOI-link  

1998

  1. Emmanuel Godard, Yves Métivier, and Anca Muscholl. 1998. The Power of Local Computations in Graphs with Initial Knowledge. Theory and Application of Graph Transformations, 6th International Workshop, TAGT’98, Paderborn, Germany, November 16-20, 1998, Selected Papers, Springer, 71–84. DOI-link  
  2. Peter Niebert. 1998. A temporal logic for the specification and verification of distributed behaviour. Retrieved from https://d-nb.info/957152582.
  3. Thomas Gehrke, Michaela Huhn, Peter Niebert, Arend Rensink, and Heike Wehrheim. 1998. A Process Algebra Semantics for MSC Including Conditions. Formale Beschreibungstechniken für verteilte Systeme, 8. GI/ITG-Fachgespräch, Cottbus, 4. und 5. Juni 1998, Verlag Shaker, 185–196. 
    @inproceedings{DBLP:conf/fbt/GehrkeHNRW98,
  title = {A Process Algebra Semantics for {MSC} Including Conditions},
  author = {Gehrke, Thomas and Huhn, Michaela and Niebert, Peter and Rensink, Arend and Wehrheim, Heike},
  year = {1998},
  booktitle = {Formale Beschreibungstechniken f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5. Juni 1998},
  publisher = {Verlag Shaker},
  pages = {185--196},
  editor = {K{\"{o}}nig, Hartmut and Langend{\"{o}}rfer, Peter},
  timestamp = {Tue, 19 Jul 2005 12:16:22 +0200},
  biburl = {https://dblp.org/rec/conf/fbt/GehrkeHNRW98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
  4. Michaela Huhn, Peter Niebert, and Heike Wehrheim. 1998. Partial Order Reductions for Bisimulation Checking. Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings, Springer, 271–282. DOI-link  
  5. Michaela Huhn, Peter Niebert, and Frank Wallner. 1998. Verification Based on Local States. Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS ’98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS’98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, Springer, 36–51. DOI-link  

1997

  1. Peter Niebert and Barbara Sprick. 1997. A Tableau Proof System for a Mazurkiewicz Trace Logic with Fixpoints. Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX ’97, Pont-à-Mousson, France, May 13-16, 1997, Proceedings, Springer, 291–306. DOI-link  

1996

  1. Michaela Huhn and Peter Niebert. 1996. Towards Automata for Branching Time and Partial Order. CONCUR ’96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings, Springer, 611–626. DOI-link  

1995

  1. Peter Niebert. 1995. A v-Calculus with Local Views for Systems of Sequential Agents. Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS’95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, Springer, 563–573. DOI-link