22 July 2013

Talks

Some recent talks:

  • Distributed Randomized Algorithms. IIT Jammu, Inde, February 23, 2019.
  • Les réseaux de neurones, des réseaux (et des graphes) comme les autres ? GT Algorithmes Distribués (LaBRI), 4 et 11 février, 2019.
  • Que peut faire le hasard quand on est dans le brouillard ? Rétrospective sur le distribué et 61 ans d’Yves Métivier, 27 novembre, 2018.
  • Whac-A-Mole: Smart node positioning in clone attack in wireless sensor networks. GT Algorithmes Distribués (LaBRI), April 23, 2018.
  • Preserving Privacy in Smart Cities. Ecole Jeunes Chercheurs Smart Cities. Bizerte, Tunisia. October 27-29, 2017.
  • Unraveling Reflection Induced Sensitive Leaks in Android Apps. The 12th International Conference on Risks and Security of Internet and Systems(CRISIS 2017). Dinard, France. September 19-21, 2017.
  • Design Patterns in Beeping Algorithms (pdf). The 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Madrid, Spain, 13-16 December 2016.
  • MimeoDroid: Large Scale Dynamic App analysis on Cloned Devices via Machine Learning Classifiers. (pdf). The 3rd IEEE International Workshop on Reliability & Security Data Analysis (RSDA 2016). Toulouse, France, June 28 – July 1st, 2016.
  • Randomised Distributed MIS and Colouring Algorithms for Rings with Oriented Edges in O(√log n) bit rounds. (pdf). GT Algorithmes Distribués (LaBRI), May 30, 2016.
  • Un algorithme distribué d’énumération des noeuds d’un réseau et application au calcul des distances entre 2 noeuds quelconques et du diamètre d’un réseau (pdf). AlgoTel 2016, Bayonne, France, May 25, 2016.
  • MCLSPM: Multi-constraints Link Stable Multicast Routing Protocol in Adhoc Networks. IFIP Wireless Days 2016. Toulouse, France, March 25, 2016.
  • Computing in Distributed Systems and Networks. MNIT, India. November 12, 2015.
  • Detecting Clone Attacks in Wireless Networks. Information Security & Challenges (ISC’15). Jaipur, India. November 2015.
  • DRACO:DRoid Analyst COmbo An Android Malware Analysis Framework. SIN 2015. Sochi, Russia, September 8-10, 2015.
  • On Distributed Computing with Beeps – Part II. GT Algorithmes Distribués (LaBRI), Mar. 16, 2015.
  • On Distributed Computing with Beeps – Part I. GT Algorithmes Distribués (LaBRI), Mar. 09, 2015.
  • Greedy Flooding in Redoubtable Sensor Networks. AINA 2014. Victoria, Canada, May 13 – 16, 2014.
  • Optimal Bit Complexity Randomised Distributed MIS and Maximal Matching Algorithms for Anonymous Rings (pdf). GT DALGO (LIF, Marseille), Mar. 27, 2014.
  • Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (pdf). SIROCCO 2013. Ischia, Italy, July 1–3, 2013.
  • Lightweight Source Authentication Mechanisms for Group Communications in Wireless Sensor Networks. AINA-2013. Barcelona, Spain, March 25 – 28, 2013.
  • Two Monte-Carlo Election Algorithms for Anonymous Graphs without any Initial Knowledge (pdf). GT Algorithmes Distribués (LaBRI), Jan. 14, 2013.
  • On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring Colouring: An Application of the Mellin Transform.(pdf). GT Combinatoire énumérative et algébrique (LaBRI), Jan. 6, 2012.
  • Analysis of Distributed Randomized Algorithms (pdf). GT Modélisation et Vérification (LIF, Marseille), Apr. 5, 2012.
  • The Bit Complexity of a Randomised Distributed (Delta+1) Colouring Algorithm on Ring Graphs (pdf). In GASCOM 2010, September 2-4, 2010. Montréal, UQAM, Canada.
  • Algorithmes distribués probabilistes (talk1, talk 2). GT AlgoProof (LaBRI), Sep. 2010
  • Algorithmique distribuée et probabilités (pdf). GT Probabilité et Informatique (LaBRI), Oct. 11, 2010.
  • An Optimal Bit Complexity Randomised Distributed MIS Algorithm (pdf). SIROCCO 2009. May 25-27, 2009. Piran, Slovenia.
  • About Randomised Distributed Graph Colouring and Graph Patition Algorithmes (pdf). GT Algorithmes Distribués (LaBRI), June 21, 2009.
  • Election Algorithms with Random Delays in Trees, FPSAC 2009. July 20-24, 2009. Hagenberg, Austria.