Evangelos Bampas
Associate Professor of Computer Science
100%
Libre accès
11
Documents
Affiliations actuelles
- 1061259
- 1062149
Identifiants chercheurs
evangelos-bampas- Arxiv : bampas_e_1
- Google Scholar : http://scholar.google.com/citations?user=kdGbgIQAAAAJ
Site web
- https://www.lri.fr/~bampas/
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**
* Distributed algorithms: mobile agents, rendezvous, exploration, fault tolerance, self-stabilization.
* Communication networks: optical networks, WDM, routing, wavelength assignment, decentralized and noncooperative models.
* Computability and complexity: counting complexity, computability and complexity models for mobile agents.
Publications
- 11
- 6
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 2
- 1
- 1
- 2
- 2
- 1
- 1
|
|
Beachcombing on strips and islandsTheoretical Computer Science, 2020, 806, pp.236-255. ⟨10.1016/j.tcs.2019.04.001⟩
Article dans une revue
hal-02127575v1
|
|
|
Linear Search by a Pair of Distinct-Speed RobotsAlgorithmica, 2019, 81 (1), pp.317-342. ⟨10.1007/s00453-018-0447-0⟩
Article dans une revue
hal-01872346v1
|
|
|
On asynchronous rendezvous in general graphsTheoretical Computer Science, 2019, 753, pp.80-90. ⟨10.1016/j.tcs.2018.06.045⟩
Article dans une revue
hal-01900843v1
|
|
|
On mobile agent verifiable problemsInformation and Computation, 2018, 260, pp.51 - 71. ⟨10.1016/j.ic.2018.03.003⟩
Article dans une revue
hal-01820407v1
|
|
|
Robustness of the Rotor–Router MechanismAlgorithmica, 2017, 78 (3), pp.869-895. ⟨10.1007/s00453-016-0179-y⟩
Article dans une revue
hal-01416012v1
|
|
|
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⟩
Communication dans un congrès
hal-01393792v1
|
|
|
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⟩
Communication dans un congrès
hal-01323114v1
|
|
|
Problèmes vérifiables par agents mobilesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01148475v1
|
|
|
Beachcombing on Strips and IslandsALGOSENSORS 2015, Sep 2015, Patras, Greece. pp.155-168, ⟨10.1007/978-3-319-28472-9_12⟩
Communication dans un congrès
hal-01283086v1
|
|
|
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional GridsDISC 2010, Sep 2010, United States. pp.297--311, ⟨10.1007/978-3-642-15763-9_28⟩
Communication dans un congrès
hal-00534263v1
|
|
|
Euler Tour Lock-in Problem in the Rotor-Router ModelDISC 2009, Sep 2009, Spain. pp.421--433
Communication dans un congrès
hal-00402749v1
|