Evangelos Bampas
- Laboratoire Interdisciplinaire des Sciences du Numérique (LISN)
- Systèmes Parallèles - LISN (ParSys)
Présentation
I completed my undergraduate studies in Electrical & Computer Engineering in 2004 and received my Ph.D. in 2009, both at the National Technical University of Athens, Greece. My research lies in the domain of networked systems, in particular distributed and mobile agent systems. I'm interested in all aspects of such systems that pertain to dynamicity, fault tolerance, and other related issues that emerge in large-scale systems, such as absence of centralized control, uncertainty, etc. I also maintain an active interest in resource allocation in optical networks, as well as in computational complexity theory. My work draws in particular on the fields of distributed algorithms, mobile agent computing, approximation algorithms, algorithmic game theory, and computational complexity. Research interests
Publications
Publications
|
|
Treasure Hunt with Volatile Pheromones37th International Symposium on Distributed Computing (DISC 2023), Oct 2023, L'Aquila, Italy. pp.8:1-8:21, ⟨10.4230/LIPIcs.DISC.2023.8⟩ |
|
|
Near-Gathering of Energy-Constrained Mobile Agents26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. pp.52-65, ⟨10.1007/978-3-030-24922-9_4⟩ |
Collaborative Delivery by Energy-Sharing Low-Power Mobile RobotsAlgorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2017, Sep 2017, Vienna, Austria. pp.1-12, ⟨10.1007/978-3-319-72751-6_1⟩ |
|
|
|
Maximal exploration of trees with energy-constrained agentsALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France |
|
|
On Mobile Agent Verifiable ProblemsLatin American Theoretical Informatics Symposium (LATIN 2016), Apr 2016, Ensenada, Mexico. pp.123-137, ⟨10.1007/978-3-662-49529-2_10⟩ |
|
|
Linear Search by a Pair of Distinct-Speed Robots23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), Jul 2016, Helsinki, Finland. pp.195 - 211, ⟨10.1007/978-3-319-48314-6_13⟩ |
|
|
Problèmes vérifiables par agents mobilesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France |
|
|
Beachcombing on Strips and IslandsALGOSENSORS 2015, Sep 2015, Patras, Greece. pp.155-168, ⟨10.1007/978-3-319-28472-9_12⟩ |
Self-Stabilizing Balancing Algorithm for Containment-Based Trees15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, Nov 2013, Osaka, Japan. pp.191-205, ⟨10.1007/978-3-319-03089-0_14⟩ |
|
Network Verification via Routing Table QueriesSIROCCO 2011, Jun 2011, Gdańsk, Poland. pp.270--281, ⟨10.1007/978-3-642-22212-2_24⟩ |
|
|
|
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional GridsDISC 2010, Sep 2010, United States. pp.297--311, ⟨10.1007/978-3-642-15763-9_28⟩ |
Robustness of the rotor-router mechanismOPODIS 2009, Dec 2009, France. pp.345--358 |
|
|
|
Euler Tour Lock-in Problem in the Rotor-Router ModelDISC 2009, Sep 2009, Spain. pp.421--433 |
|
|
Treasure hunt with volatile pheromonesUniversité Paris-Saclay. 2023 |
|
|
Self-Stabilizing Balancing Algorithm for Containment-Based Trees[Technical Report] ???. 2012 |