Papers in International Journal of Colette Johnen

  1. Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore, Theoretical Computer Science (TCS), 955: 113804, 2023.
    https://doi.org/10.1016/j.tcs.2023.113804
  2. Self-stabilizing systems in spite of high dynamics. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit, Theoretical Computer Science (TCS), 964: 113966, 2023.
    https://doi.org/10.1016/j.tcs.2023.113966
  3. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Stéphane Devismes, David Ilcinkas, Colette Johnen: Algorithmica 84(1), pages 85-123, 2022.
    https://doi.org/10.1007/s00453-021-00878-9
  4. Polynomial Silent Self-Stabilizing p-Star Decomposition. Mohammed Haddad, Colette Johnen, Sven Köhler: Computer Journal (CJ), vol. 63, no. 2, pages 253-266, 2020.
    https://doi.org/10.1093/comjnl/bxz102
  5. Disconnected components detection and rooted shortest-path tree maintenance in networks Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen, Journal of Parallel and Distributed Computing (JPDC), vol. 132, pages 299-309, 2019.
    https://doi.org/10.1016/j.jpdc.2019.05.006
  6. Maintaining a Distributed Spanning Forest in Highly Dynamic Networks Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz, Computer Journal (CJ), vol. 62, no. 2, pages 231-246, 2019.
    https://doi.org/10.1093/comjnl/bxy069
  7. On the complexity of basic abstractions to implement consensus. Claire Capdevielle, Colette Johnen, Alessia Milani. On the complexity of basic abstractions to implement consensus. Theoretical Computer Science (TCS), vol. 715, pages 86-96, 2018.
    https://doi.org/10.1016/j.tcs.2017.12.039
  8. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Step. Stéphane Devismes, David Ilcinkas, Colette Johnen, Discrete Mathematics & Theoretical Computer Science (DMTCS), Vol. 19 no. 3, 2017.
    http://dmtcs.episciences.org/4116
  9. On the uncontended complexity of anonymous agreement. Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. Distributed Computing (DC), vol. 30, no. 6, pages 459-468, 2017.
    https://doi.org/10.1007/s00446-017-0297-z
  10. Silent self-stabilizing BFS tree algorithms revisited. Stéphane Devismes, Colette Johnen, Journal of Parallel and Distributed Computing (JPDC), vol 97, pages 11-23 2016.
    https://doi.org/10.1016/j.jpdc.2016.06.003
  11. Fast, silent self-stabilizing distance-k independent dominating set construction, Colette Johnen, Information Processing Letters (IPL), vol 114, no 10, pages 551-555, 2014
  12. Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters, Colette Johnen and Fouzi Mekhaldi, Journal of Parallel and Distributed Computing (JPDC), vol 74, no 1, pages 1900-1913, 2014.
  13. Robust Self-Stabilizing Weight-Based Clustering Algorithm, Colette Johnen and Le Huy Nguyen, Theoretical Computer Science (TCS), vol 410, no (6-7), pages 581-594, 2009.
  14. Safe Peer-to-Peer self-downloading, Kajari Ghosh Dastidar, Ted Herman and Colette Johnen, ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol 3 no 4, 2008.
  15. Randomized Self-Stabilizing and Space Optimal Leader Election under Arbitrary Scheduler on Rings, Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Distributed Computing (DC), vol 20, no 1, pages 75-93, 2007.
  16. Strategies for Peer-to-Peer downloading, Ted Herman and Colette Johnen, Information Processing Letters (IPL), vol 94, no 5, pages 203-209, 2005.
  17. Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks, Colette Johnen, Luc O. Alima, Ajoy K. Datta, Sébastien Tixeuil in Parallel Processing Letters (PPL), vol 12, no 3&4, pages 327-340, 2002.
  18. Token Based Self-Stabilizing Uniform Algorithms, Joffroy Beauquier, Maria Gradinariu, Colette Johnen, and Jérôme Durand-Lose. in Journal of Parallel and Distributed Computing (JPDC). vol 62, no 5, pages 899-921, 2002.
  19. Self-stabilizing Depth-First Token Circulation in Arbitrary Rooted Networks, Ajoy K. Datta, Colette Johnen, Franck Petit, Vincent Villain. Distributed Computing (DC), vol 13, no 4, pages 207-218, 2000.