Johanne Cohen

According to our database1, Johanne Cohen authored at least 91 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Anytime Backtrack Unimodal Bandits and Applications to Cloud Computing.
Proceedings of the 2020 IFIP Networking Conference, 2020

Neural Representation and Learning of Hierarchical 2-additive Choquet Integrals.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs.
Theor. Comput. Sci., 2019

Detecting service provider alliances.
CoRR, 2019

A stack-vector routing protocol for automatic tunneling.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

2018
Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks.
IEEE/ACM Trans. Netw., 2018

Domain clustering for inter-domain path computation speed-up.
Networks, 2018

Homonym Population Protocols.
Theory Comput. Syst., 2018

Convex Stochastic Bounds and Stochastic Optimisation on Graphs.
Electron. Notes Theor. Comput. Sci., 2018

Self-stabilization and Byzantine Tolerance for Maximal Matching.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Tropical matchings in vertex-colored graphs.
Electron. Notes Discret. Math., 2017

A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves.
CoRR, 2017

GARN2: coarse-grained prediction of 3D structure of large RNA molecules by regret minimization.
Bioinform., 2017

Self-stabilizing Distributed Stable Marriage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Hedging Under Uncertainty: Regret Minimization Meets Exponentially Fast Convergence.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Learning with Bandit Feedback in Potential Games.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Load Prediction for Energy-Aware Scheduling for Cloud Computing Platforms.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Tropical Paths in Vertex-Colored Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
A packing problem approach to energy-aware load distribution in Clouds.
Sustain. Comput. Informatics Syst., 2016

A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks.
Parallel Process. Lett., 2016

Learning techniques for cloud demands aggregation in cloud service brokering.
Int. J. Cloud Comput., 2016

Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching.
CoRR, 2016

The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential.
CoRR, 2016

Self-Stabilizing Maximal Matching and Anonymous Networks.
CoRR, 2016

Exponentially fast convergence to (strict) equilibrium via hedging.
CoRR, 2016

Detecting service provider alliances on the choreography enactment pricing game.
CoRR, 2016

Meta-algorithm to Choose a Good On-Line Prediction (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Path computation in multi-layer networks: Complexity and algorithms.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Coordination mechanisms for decentralized parallel systems.
Concurr. Comput. Pract. Exp., 2015

Multi-Armed Bandit for distributed Inter-Cell Interference Coordination.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Scheduling Tasks from Selfish Multi-tasks Agents.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2014
Game theoretic framework for inter-cell interference coordination.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2014

Game theoretic framework for power control in intercell interference coordination.
Proceedings of the 2014 IFIP Networking Conference, Trondheim, 2014

Replicator dynamics for distributed Inter-Cell Interference Coordination.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Energy-Aware Multi-Organization Scheduling Problem.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

2013
Population Protocols that Correspond to Symmetric Games.
Int. J. Unconv. Comput., 2013

Risk-aware SLA negotiation.
Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013

AP association in a IEEE 802.11 WLAN.
Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

Distributed Selfish Algorithms for the Max-Cut Game.
Proceedings of the Information Sciences and Systems 2013, 2013

SLA learning from past failures, a Multi-Armed Bandit approach.
Proceedings of the 9th International Conference on Network and Service Management, 2013

2012
Scheduling in the presence of processor networks : complexity and approximation.
RAIRO Oper. Res., 2012

Optimal configuration of an optical network providing predefined multicast transmissions.
Comput. Networks, 2012

Accuracy vs. complexity: The stochastic bound approach.
Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Semi-distributed radio resource management for elastic traffic in a hybrid network.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Elastic Game Based Radio Resource Management.
Proceedings of the 75th IEEE Vehicular Technology Conference, 2012

Reputation-Aware Learning for SLA Negotiation.
Proceedings of the NETWORKING 2012 Workshops, 2012

On the distributed learning of Nash equilibria with minimal information.
Proceedings of the 6th International Conference on Network Games, 2012

Learning Equilibria in Games by Stochastic Distributed Algorithms.
Proceedings of the Computer and Information Sciences III, 2012

2011
Non-clairvoyant Scheduling Games.
Theory Comput. Syst., 2011

Asymetric Pavlovian Populations
CoRR, 2011

Multi-organization scheduling approximation algorithms.
Concurr. Comput. Pract. Exp., 2011

Model for sharing femto access.
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools Communications, 2011

Computing with Pavlovian Populations.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Techno-economics of small cell networks: The AWARE project.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Competition among online-gaming service providers.
Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

Performance Improvement of an Optical Network Providing Services Based on Multicast.
Proceedings of the Computer and Information Sciences II, 2011

File Transfer Application For Sharing Femto Access.
Proceedings of the Computer and Information Sciences II, 2011

Individual vs. Global Radio Resource Management in a Hybrid Broadband Network.
Proceedings of IEEE International Conference on Communications, 2011

Coordination mechanisms for selfish multi-organization scheduling.
Proceedings of the 18th International Conference on High Performance Computing, 2011

Coalition Stability under QoS Based-Market Segmentation.
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010
Analysis of Multi-Organization Scheduling Algorithms.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Distributed Learning of Equilibria in a Routing Game.
Parallel Process. Lett., 2009

Population Protocols that Correspond to Symmetric Games
CoRR, 2009

On the convergence of population protocols when population goes to infinity.
Appl. Math. Comput., 2009

A dynamic approach for load balancing.
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2008
An exercise in selfish stabilization.
ACM Trans. Auton. Adapt. Syst., 2008

Shuffling biological sequences with motif constraints.
J. Discrete Algorithms, 2008

Playing With Population Protocols
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Distributed Learning of Wardrop Equilibria.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

2007
On the b-continuity property of graphs.
Discret. Appl. Math., 2007

Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach.
Proceedings of the Network Control and Optimization, 2007

2006
Messages Scheduling for Parallel Data Redistribution between Clusters.
IEEE Trans. Parallel Distributed Syst., 2006

Multicast tree allocation algorithms for Distributed Interactive Simulation.
Int. J. High Perform. Comput. Netw., 2006

Optimal Linear Arrangement of Interval Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004
The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing.
J. Interconnect. Networks, 2004

Fixed Size and Variable Size Packet Models in an Optical Ring Network: Complexity and Simulations.
Proceedings of the Computer and Information Sciences, 2004

2003
Messages Scheduling for Data Redistribution between Clusters.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

2002
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees.
Theory Comput. Syst., 2002

Recognizing Knödel graphs.
Discret. Math., 2002

2001
Unslotted deflection routing: a practical and efficient protocol for multihop optical networks.
IEEE/ACM Trans. Netw., 2001

Gossiping in chordal rings under the line model.
Theor. Comput. Sci., 2001

1999
Recognizing Bipartite Incident-Graphs of Circulant Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Scheduling Calls for Multicasting in Tree-Networks.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.
IEEE Trans. Parallel Distributed Syst., 1998

Broadcasting, Multicasting and Gossiping in Trees Under the All-Port Line Model.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Minimal contention-free matrices with application to multicasting.
Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997
Embedding Tori in Partitioned Optical Passive Star Networks.
Proceedings of the SIROCCO'97, 1997

Broadcasting and Multicasting in Cut-through Routed Networks.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997


  Loading...