- 19
- 19
- 9
- 9
- 6
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Johanne Cohen
82
Documents
Presentation
I am currently "chargée de Recherche" of CNRS, and located, since November 2013, at LRI in the University of Paris Sud. I m the head of GALAC (*Graphs, Algorithmic and Combinatorics*) team since September 2014.
From 2011 to 2013, I was the leader of the research group "Algorithms, Analytical Combinatorics and applications" at laboratory PRISM in the University of Versailles. I received the Master degree in Computer Science from the Ecole Normale Superieure de Lyon, in 1995, and the Ph.D. degree in Computer Science from the University Paris Sud France, in 1998. From Sept. 1999 to Oct. 2008, I was member of LORIA at Nancy. Between Feb. 2000 and Sept. 2001, I was an associate professor of University Nancy I.
My research interests include algorithmics for telecommunication, graph theory, algorithmic game theory, distributed algorithmics, complexity and approximation theory.
Je suis directrice de Recherche au [CNRS](http://www.cnrs.fr/), au laboratoire [LISN](https://www.lisn.upsaclay.fr/), issu des 7 groupes de recherche du LIMSI et de 7 équipes de recherche du LRI. Depuis depuis septembre 2013, je suis membre de l'équipe [GALAC](https://galac.lri.fr/)
J'ai a obtenu son DEA à l'ENS de Lyon en 1995 et sa thèse en informatique à l'université de Paris XI en 1998. J'ai été maître de conférence à Nancy de 2000 à 2001, puis CR CNRS au LORIA entre 2001 et 2008. En 2008, j'ai muté au Laboratoire PRiSM (Versailles). J'ai obtenu mon habilitation à diriger les Recherches en 2009, à l'Université de Versailles Saint-quentin en Yvelines. En 2013, j'ai muté au Laboratoire LRI.
Mes domaines de recherche principaux concernent l'algorithmique pour IA, pour les télécommunications, la théorie des graphes, la théorie algorithmique des jeux, l'algorithmique distribuée, et la complexité/approximation.
Publications
- 2
- 7
- 1
- 3
- 3
- 5
- 10
- 6
- 2
- 2
- 4
- 1
- 5
- 5
- 4
- 1
- 4
- 6
- 5
- 2
- 2
- 1
- 1
- 11
- 9
- 9
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
On the delta-decidability of decision problems for neural network questionsContinuity, Computability, Constructivity. From Logic to Algorithms. CCC'23, 2023, Kyoto, Japan
Conference papers
hal-04338649v1
|
|
|
Physics-aware modelling of an accelerated particle cloudMLPS 2023 - Machine Learning and the Physical Sciences Workshop 23023 - At the 37th conference on Neural Information Processing Systems (NeurIPS), Dec 2023, New Orleans, United States
Conference papers
hal-04396175v1
|
Self-stabilization and Byzantine Tolerance for Maximal Independent SetStabilization, Safety, and Security of Distributed Systems, Nov 2023, Virtual Event, France. pp.479-483, ⟨10.1007/978-3-030-91081-5_33⟩
Conference papers
hal-04380490v1
|
|
From State to Link-Register Model: A transformer for Self-Stabilizing Distributed Algorithms25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2023, Nancy, France
Conference papers
hal-04388668v1
|
|
|
|
Bellman-Ford sous stéroïdes : Un algorithme de routage pour l'établissement automatique des tunnelsALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Conference papers
hal-02872209v1
|
|
|
Neural Representation and Learning of Hierarchical 2-additive Choquet IntegralsIJCAI-PRICAI-20 - Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence, Jul 2020, Yokohama, France. pp.1984-1991, ⟨10.24963/ijcai.2020/275⟩
Conference papers
hal-03017078v1
|
Anytime Backtrack Unimodal Bandits and Applications to Cloud Computing,IFIP Networking Conference (Networking), Jun 2020, Paris, France. pp.82-90, ⟨10.1007/s11276-017-1629-4⟩
Conference papers
hal-03008647v1
|
|
|
|
A stack-vector routing protocol for automatic tunnelingIEEE INFOCOM 2019 - IEEE Conference on Computer Communications, Apr 2019, Paris, France. pp.1675-1683, ⟨10.1109/INFOCOM.2019.8737536⟩
Conference papers
hal-01987354v1
|
|
|
Quelques bornes sur les chemins dans les réseaux multicouchesALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Conference papers
hal-02123183v1
|
Self-stabilization and Byzantine Tolerance for Maximal Matchingtabilization, Safety, and Security of Distributed Systems. SSS 2018, Nov 2018, Tokyo, Japan. pp.80-95, ⟨10.1007/978-3-030-03232-6_6⟩
Conference papers
hal-01974902v1
|
|
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register ModelSIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19
Conference papers
hal-01974891v1
|
|
Hedging under uncertainty: regret minimization meets exponentially fast convergenceSymposium on Algorithmic Game Theory (SAGT) 2017, Sep 2017, L'Aquila, Italy. ⟨10.1007/978-3-319-66700-3_20⟩
Conference papers
hal-01382290v1
|
|
|
|
Self-stabilizing Distributed Stable MarriageInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, Boston, United States. pp.46-61, ⟨10.1007/978-3-319-69084-1_4⟩
Conference papers
hal-01576055v1
|
Convex Stochastic Bounds and Stochastic Optimisation on GraphsNinth International Workshop on Practical Applications of Stochastic Modelling (PASM 2017), Sep 2017, Berlin, Germany
Conference papers
hal-01638313v1
|
|
Load Prediction for Energy-Aware Scheduling for Cloud Computing PlatformsThe 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017), Jun 2017, Atlanta, United States
Conference papers
hal-01566244v1
|
|
Learning with bandit feedback in potential gamesNIPS '17: Proceedings of the 31st International Conference on Neural Information Processing Systems, Dec 2017, Long Beach, CA, United States
Conference papers
hal-01643352v1
|
|
|
|
Complexité du calcul de chemins dans les réseaux multicouchesALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01516573v1
|
Tropical paths in vertex-colored graphsCOCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shangai, China. pp.291-305, ⟨10.1007/978-3-319-71147-8_20⟩
Conference papers
hal-01635425v1
|
|
|
|
Path computation in multi-layer networks: Complexity and algorithmsIEEE INFOCOM 2016, Apr 2016, San Francisco, United States
Conference papers
hal-01252609v2
|
Meta-algorithm to Choose a Good On-Line PredictionStabilization, Safety, and Security of Distributed Systems International Symposium (SSS), Nov 2016, Lyon, France
Conference papers
hal-01566270v1
|
|
Homonym Population Protocols, or Providing a Small Space of Computation Using a Few IdentifiersThird International Conference, NETYS 2015, May 2015, Agadir, Morocco
Conference papers
hal-01153806v1
|
|
Multi-Armed Bandit for distributed Inter-Cell Interference CoordinationEEE International Conference on Communications (ICC), 2015, Jun 2015, London, France. pp.3323 - 3328, ⟨10.1109/ICC.2015.7248837⟩
Conference papers
hal-01218806v1
|
|
Game theoretic framework for power control in intercell interference coordinationNetworking Conference, 2014 IFIP, Jun 2014, Trondheim, Norway. pp.1-8, ⟨10.1109/IFIPNetworking.2014.6857108⟩
Conference papers
hal-01078291v1
|
|
Distributed load balancing game for inter-cell interference coordination. European Wireless, May 2014, Barcelona, Spain
Conference papers
hal-01301184v1
|
|
Distributed selfish algorithms for the max-cut game. 28th International Symposium on Computer and Information Sciences (ISCIS), Oct 2013, Paris, France
Conference papers
hal-01301187v1
|
|
AP association in a IEEE 802.11 WLAN.24th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Sep 2013, London, United Kingdom
Conference papers
hal-01301196v1
|
|
Arrangement linéaire minimal des graphes d'intervallescongrès de la Société Francaise de Recherche Opérationnelle et d'Aide à la décision, Feb 2008, Clermont Ferrand, France
Conference papers
inria-00309041v1
|
|
On the Convergence of a Population Protocol When Population Goes to InfinityPhysics and Computations, Worshop of Unconventional Computation - UC 2008, Aug 2008, Vienne, Austria
Conference papers
inria-00308018v1
|
|
Distributed Learning of Wardrop Equilibria7th International Conference on Unconventional Computation - UC 2008), Aug 2008, Vienne, Austria. pp.19--32
Conference papers
inria-00308002v1
|
|
Playing With Population ProtocolsInternational Workshop on The Complexity of Simple Programs, Dec 2008, Cork, Ireland
Conference papers
inria-00330344v1
|
|
Optimisation du temps de broadcast dans un modèle de communication en ligne pondéréProgramme de la conférence conjointe Francoro V / Roadef 2007, Feb 2007, Grenoble, France
Conference papers
hal-00130084v1
|
|
|
|
Transit prices negotiation: Combined repeated game and distributed algorithmic approachFirst EuroFGI International Conference on Network Control and Optimization - NET-COOP 2007, Jun 2007, Avignon, France. pp.266-275, ⟨10.1007/978-3-540-72709-5_28⟩
Conference papers
inria-00180914v1
|
Convergences et dynamiques du routage dans les réseauxJournées Pôle ResCom, Sep 2007, Toulouse, France
Conference papers
inria-00182739v1
|
|
|
|
Optimal Linear Arrangement of Interval Graphs31st International Symposium on Mathematical Foundations of Computer Science - MFCS 2006, Aug 2006, Stara Lesna/Slovakia, pp.267-279, ⟨10.1007/11821069⟩
Conference papers
inria-00115249v1
|
Un problème d'ordonnancement de messages : Partie 1 Modélisations ; Partie 2 Approches de résolution6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF'05, Laboratoire d'Informatique de l'Université de Tours, Feb 2005, Tours/France, pp.54--57
Conference papers
inria-00001259v1
|
|
|
|
Shuffling biological sequencess with motifs constraintsAlgorithms and Computational Methods for Biochemical and Evolutionary Networks - CompBioNets'2004, Dec 2004, Recife, Brazil. 18 p
Conference papers
inria-00099891v1
|
Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and SimulationsComputer and Information Sciences - ISCIS 2004 19th International Symposium, Kemer-Antalya, Turkey, October 27-29, 2004. Proceedings, 2004, Kemer-Antalya, Turkey. pp.238-246
Conference papers
hal-00126506v1
|
|
|
|
Comparison of fixed size and variable size packet models in an optical ring network: Algorithms and performancesPhotonics in Switching - PS'2003, Sep 2003, Versailles, France, pp.89-91
Conference papers
inria-00107697v1
|
|
|
Optimisation des ressources utilisées pour une diffusion5ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF'2003, Feb 2003, Avignon, France, 2 p
Conference papers
inria-00107698v1
|
|
|
Algorithmes de répartition de charge pour des simulations distribuées5ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF'2003, Feb 2003, Avignon, France, 2 p
Conference papers
inria-00099495v1
|
Messages Scheduling for Data Redistribution between ClustersAlgorithms, models and tools for parallel computing on heterogeneous network - HeteroPar'03, workshop of SIAM PPAM 2003, Sep 2003, Czestochowa, Poland, 8 p
Conference papers
inria-00099574v1
|
|
Wavelengths assignment on a ring all-optical metropolitan area network3rd Workshop on Approximation and Randomization Algorithms in Communication Networks - ARACNE'2002, Sep 2002, Rome, Italy, 9 p
Conference papers
inria-00100801v1
|
|
|
|
JUMBO : protocole de routage unicast dans les réseaux ad-hoc2ièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications - ALGOTEL 2000, 2000, La Rochelle, France. pp.31-34
Conference papers
inria-00099028v1
|
Recognizing Bipartite Incident-Graphs of Circulant DigraphsInternational Workshop on Graph Theoretic Concepts in Computer Science - WG'99, 1999, Ascona, Switzerland, pp.215-227
Conference papers
inria-00098892v1
|
|
Optimal Deadlock-free Path-based Multicast Algorithms in Meshes5th International Colloquium on Structural Information & Communication Complexity (SIROCCO'98), 1998, Amalfi, Italy, 17 p
Conference papers
inria-00098443v1
|
|
|
Surrogate Model for Linear Accelerator: A fast Neural Network approximation of ThomX's simulatorIPAC 2023 - 14th International Particle Accelerator Conference, May 2023, Venice, Italy. JACoW Publishing, JACoW, IPAC2023, pp.4514-4517, 2023, ⟨10.18429/JACoW-IPAC2023-THPL039⟩
Conference poster
hal-04396183v1
|
|
|
Learning Equilibria in Games by Stochastic Distributed AlgorithmsGelenbe, Erol and Lent, Ricardo. Computer and Information Sciences III, Springer London, pp.31--38, 2013, ⟨10.1007/978-1-4471-4594-3_4⟩
Book sections
hal-00782034v1
|
|
|
Minimum colored Maximum Matchings in vertex-colored Graphs2024
Preprints, Working Papers, ...
hal-02157745v3
|
Acyclic colourings of graphs with obstructions2023
Preprints, Working Papers, ...
hal-04245454v1
|
|
|
|
Nonatomic Non-Cooperative Neighbourhood Balancing Games2023
Preprints, Working Papers, ...
hal-04380503v1
|