[[users:blin:index|Page principale]]

====== Enseignements ======

===== M2 UPCité Algorithmique répartie ======
  * Introduction {{:users:blin:upc_alre_m2_introduction.pdf |(download pdf) }}
  * Horloges {{ :users:blin:upc_alre_m2_horloges.pdf | (download pdf)}}
  * Partage de ressources {{ :users:blin:partage_de_resssource.pdf |(download pdf)}}
  * Coloration {{ :users:blin:upc_alre_coloration.pdf |(download pdf)}}
  * Construction d'arbres (BFS,DFS) {{ :users:blin:tree_construction.pdf |(download pdf}}
  * Election de leader {{ :users:blin:m2_alre_leader_election.pdf |(download pdf)}}
  * Arbre couvrant de poids minimum {{ :users:blin:mst.pdf |(download pdf)}}
  * Introduction à l'auto-stabilisation {{ :users:blin:m2_upc_auto-stab_introduction.pdf |(download pdf)}}
  * Construction d'arbres couvrants auto-stabilisants {{ :users:blin:m2_upc_st_sss.pdf |(download pdf}})
===== M2 MPRI =====

  * Introduction to Self-Stabilization {{  :users:blin:self-stabilization_introduction.pdf | (download pdf) }}
  * Dijkstra's Token ring algorithm {{ :users:blin:dijkstra_s_token_ring.pdf | (download pdf)	}}
  * Self-stabilizing Tree construction {{ :users:blin:spanning_tree_construction.pdf |(download pdf)}}
  * Unisson {{ :users:blin:unisson.pdf  |(download pdf)}}
  * Self-Stabilizing Leader Election {{ :users:blin:leader_election.pdf |(download pdf)}}


===== UFR Informatique UPCité =====

== Initiation à la Programmation 1 (IP1) ==

  * 1er cour en amphi {{ :users:blin:ip1_cours_amphi.pdf | Transparents}}
  * Support de cours :[[https://moodle.u-paris.fr/course/view.php?id=1620| Moodle]]

===== Université d'Evry (Anciens cours) =====
[[https://www-npa.lip6.fr/blin/enseignements/|Enseignements passés]] 


== Introduction à l'algorithmique ==

  * Introduction {{ :users:blin:inal_1.pdf |(Download PDF)}}
  * Structures de données {{ :users:blin:inal_2.pdf |(Download PDF)}}
  * Algorithmes de tri {{ :users:blin:inal_3.pdf |(Download PDF)}}
  * Structures d'Arbres {{ :users:blin:inal_4.pdf |(Download PDF)}}
  * Arbres binaires de recherches {{ :users:blin:inal_5.pdf |(Download PDF)}}
  * Algorithmes gloutons {{ :users:blin:inal_6.pdf |(Download PDF)}}
 

== Algorithmique des graphes ==

  *   Introduction {{ :users:blin:2019_algr1.pdf | (Download PDF)}}
  *   Algorithme élémentaires pour les graphes {{ :users:blin:2019_algr2.pdf | (Download PDF)}}
  *   Arbre couvrants de poids minimum {{ :users:blin:algr_3_mst.pdf | (Download PDF)}} [[https://www.youtube.com/@leliaBlin|Video]]
  *   Plus court chemin à origine unique {{ :users:blin:algr_4_pcc.pdf | (Download PDF)}}
  *   Plus court chemin entre toutes paires de sommets {{ :users:blin:algr5.pdf | (Download PDF) }}
  *   Flots {{ :users:blin:algr_6_flots.pdf | (Download PDF)}}

== Algorithmique répartie ==

    * Introduction {{ :users:blin:alre_cours1_intro.pdf | (Download PDF)}}
  *   Horloges {{ :users:blin:alre_cours2_horloges.pdf | (Download PDF)}}
  *   Communications {{ :users:blin:alre_cours3_communications.pdf | (Download PDF)}}
  *   Etats globaux consistants {{ :users:blin:alre_cours4_etats.pdf | (Download PDF)}}
  *   Partage de ressources {{ :users:blin:alre_cours5_partages.pdf | (Download PDF)}}
  *   Coloration {{ :users:blin:alre_coloration.pdf | (Download PDF)}}
  *   Arbres couvrants de poids minimum {{ :users:blin:are_mst.pdf | (Download PDF)}}
  *   Tolérance aux fautes transitoires {{ :users:blin:pannes2.pdf | (Download PDF)}}