DALGO : Distributed Algorithms

Keys words

algorithms, distributed algorithms, computation models, mobile agents, shared memory, message passing systems, dynamic networks, fault tolerance, swarm robotics, anonymous networks, distributed computability, topological methods, embedded systems, synchronous programming

 

Header

Jéremy CHAPOLIN

 

Permanent Members

CHALOPIN JérémieChargé de recherche
Courriel : jeremie.chalopin@lis-lab.fr
Telephone : 0486090458
Page personnelle : https://pageperso.lis-lab.fr/jeremie.chalopin/
DAS ShantanuMaitre de Conférences
Courriel : shantanu.das@lis-lab.fr
Telephone : 0486090463
Page personnelle : https://pageperso.lis-lab.fr/shantanu.das/
GODARD EmmanuelMaitre de Conférences
Courriel : emmanuel.godard@lis-lab.fr
Telephone : 0486090470
Page personnelle : https://pageperso.lis-lab.fr/emmanuel.godard/
IMBS DamienMaitre de Conférences
Courriel : damien.imbs@lis-lab.fr
Telephone : 0486090480
LABOUREL ArnaudMaitre de Conférences
Courriel : arnaud.labourel@lis-lab.fr
Telephone : 0486090477
Page personnelle : https://pageperso.lis-lab.fr/arnaud.labourel/
NIEBERT PeterMaitre de Conférences
Courriel : peter.niebert@lis-lab.fr
Telephone : 0486090493
Page personnelle : https://pageperso.lis-lab.fr/peter.niebert/

 

Phd Students

BERENGER CédricDoctorant
Courriel : cedric.berenger@lis-lab.fr
Telephone : 0486090481
PERDEREAU ÉloiDoctorant
Courriel : eloi.perdereau@lis-lab.fr
Telephone : 0486090484
Page personnelle : https://pageperso.lis-lab.fr/eloi.perdereau/

 

Other Staff

 

Scientific goal

The Distributed Algorithms (DALGO) team belongs to the Laboratoire d’Informatique et Systèmes (LIS, UMR 7020) and is based in Luminy.

The concept of distributed systems is fundamental for practical applications as well as for the theoretical foundations of computer science. A distributed system is an environment where several processes collaborate to achieve a common goal; in such a system, processes can only communicate directly with a limited number of other processes. We are interested in studying the global behaviors that can be obtained in such systems when the actions of the processes have only a local impact. The DALGO team is interested in the computational power of several models of distributed computing, as well as in the complexity of fundamental problems in these models.

The members of the team are particularly interested in the following topics:

  • Design and analysis of distributed algorithms
  • Mobile Agent Systems
  • Shared memory systems and fault tolerance
  • Dynamic networks
  • Embedded systems and synchronous programming

 

Web Site

Pour plus de détail :

 

Scientific publications


19 documents

Article dans une revue8 documents

  • Jacques Demongeot, Sylvain Sené. Phase transitions in stochastic non-linear threshold Boolean automata networks on Z²: the boundary impact. Advances in Applied Mathematics, Elsevier, 2018, 98, pp.77--99. ⟨hal-01785459⟩
  • Mathilde Noual, Sylvain Sené. Synchronism versus asynchronism in monotonic Boolean automata networks. Natural Computing, Springer Verlag, 2018, 17 (2), pp.393-402. ⟨hal-01479438⟩
  • Giuseppe Di Molfetta, Diogo O. Soares-Pinto, S\'ılvio M. Duarte Queirós. Elephant quantum walk. Phys. Rev. A, 2018, 97, pp.062112. ⟨10.1103/PhysRevA.97.062112⟩. ⟨hal-02093396⟩
  • Pablo Arrighi, Giuseppe Di Molfetta, Stefano Facchini. Quantum walking in curved spacetime: discrete metric. Quantum, 2018, 2, pp.84. ⟨10.22331/q-2018-08-22-84⟩. ⟨hal-02093395⟩
  • Eurico L. P. Ruivo, Marco Montalva-Medel, Pedro P. B. Oliveira, Kévin Perrot. Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates. Chaos, Solitons & Fractals, 2018, 113, pp.209--220. ⟨10.1016/j.chaos.2018.06.004⟩. ⟨hal-02093397⟩
  • Pablo Arrighi, S. Martiel, V. Nesme. Cellular automata over generalized Cayley graphs. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 18, pp.340-383. ⟨hal-01785458⟩
  • Enrico Formenti, Kévin Perrot, Eric Rémila. Computational complexity of the avalanche problem for one dimensional decreasing sandpiles. Journal of Cellular Automata, Old City Publishing, 2018, 13 (3), pp. 215-228. ⟨halshs-01417248⟩
  • X. Li, L. Lachmanski, S. Safi, S. Sene, C. Serre, et al.. New insights into the degradation mechanism of metal-organic frameworks drug carriers. Scientific Reports, Nature Publishing Group, 2017, 7 (1), ⟨10.1038/s41598-017-13323-1⟩. ⟨hal-01868346⟩

Communication dans un congrès10 documents

  • José Luis Vilchis Medina, Pierre Siegel, Vincent Risch, Andrei Doncescu. Intelligent and Adaptive System based on a Non-monotonic Logic for an Autonomous Motor-glider. 15th International Conference on Control, Automation, Robotics and Vision (ICARCV 2018), Nov 2018, Singapore, Singapore. pp.442--447, ⟨10.1109/ICARCV.2018.8581107⟩. ⟨hal-02093392⟩
  • Pierre Siegel, Andrei Doncescu, Vincent Risch, Sylvain Sené. Towards a Boolean dynamical system representation in a nonmonotonic modal logic. International Workshop on Non-Monotonic Reasoning (NMR'18), Oct 2018, Tempe, United States. pp.53--62. ⟨hal-02093398⟩
  • Pablo Arrighi, Giuseppe Molfetta, Nathanaël Eon. A Gauge-Invariant Reversible Cellular Automaton. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.1-12, ⟨10.1007/978-3-319-92675-9_1⟩. ⟨hal-01824869⟩
  • Viet-Ha Nguyen, Kévin Perrot. Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.127-142, ⟨10.1007/978-3-319-92675-9_10⟩. ⟨hal-01824872⟩
  • Kévin Perrot, Cédric Berenger, Peter Niebert. Balanced Connected Partitioning of Unweighted Grid Graphs. Proceedings of MFCS'2018, 2018, Liverpool, United Kingdom. pp.39:1--39:18, ⟨10.4230/LIPIcs.MFCS.2018.39⟩. ⟨hal-02093978⟩
  • P. Arrighi, C. Chouteau, S. Facchini, S. Martiel. Causal dynamics of discrete manifolds. Proceedings of NCMA'2018, 2018, Kosice, Slovakia. ⟨hal-02093393⟩
  • Kévin Perrot, Pacôme Perrotin, Sylvain Sené. A framework for (de)composing with Boolean automata networks. International Conference on Machines, Computations, and Universality (MCU'2018), 2018, Fontainebleau, France. ⟨hal-01654221v2⟩
  • G. Ruz, E. Goles, S. Sené. Reconstruction of Boolean regulatory models of flower development through an evolution strategy. Proceedings of CEC'18, 2018, Unknown, Unknown Region. ⟨hal-01785460⟩
  • Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron. A Turing machine simulation by P systems without charges. Proceedings of ACMC'2018, 2018, Auckland, New Zealand. pp.213--221. ⟨hal-02093391⟩
  • Tarek Khaled, Belaid Benhamou, Pierre Siegel. Vers une nouvelle méthode de calcul de modèles stables et extensions en programmation logique. Actes des Quatorzièmes Journées Francophones de Programmation par Contraintes (JFPC'2018), 2018, Amiens, France. pp.63-72. ⟨hal-02093400⟩

Pré-publication, Document de travail1 document

  • Kévin Perrot, Marco Montalva-Medel, Pedro de Oliveira, Eurico Ruivo. Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations. 2019. ⟨hal-02179732⟩

Powered by HAL logo