الوحدات الحالية : ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL
الفـرق السـابـقــة : ACASA
إصدارات APR20232024Total
كتـب000
إصدار كـتب000
مـنشـورات في مـجلات10010
فصـول في كـتب000
منشورات729
تراخيص101
مـذكرات202
LIP6
  • I. Adler, B.‑M. Bui‑Xuan, Y. Rabinovich, G. Renault, J. Telle, M. Vatshelle : “On the boolean-width of a graph: structure and applications”, Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, vol. 6410, Lecture Notes in Computer Science, Zarós, Crete, Greece, pp. 159-170, (Springer) [Adler 2010]
  • Ph. Aubry, A. Valibouze : “Calcul algébrique efficace de résolvantes relatives”, Journées Nationales du Calcul Formel 2010, Luminy, France [Aubry 2010a]
  • Ph. Aubry, A. Valibouze : “Parallel computation of Lagrange resolvents by multi-resolvents”, Parallel Computer Algebra 2010, vol. 15 (4), TSU, Ser. Natural & Technical Sciences, Tambov, Russian Federation, pp. 1328-1341 [Aubry 2010b]
  • O. Bodini, Th. Fernique, D. Regnault : “Stochastic Flips on Two-letter Words”, ANALCO 2010 - 7th Workshop on Analytic Algorithmics and Combinatorics, Austin, TX, United States, pp. 48-55, (SIAM) [Bodini 2010c]
  • O. Bodini, Y. Ponty : “Multi-dimensional Boltzmann Sampling of Languages”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings, Vienna, Austria, pp. 49-64, (Discrete Mathematics and Theoretical Computer Science) [Bodini 2010d]
  • A. Darrasse, H.‑K. Hwang, O. Bodini, M. Soria : “The connectivity-profile of random increasing k-trees”, Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Austin, United States, pp. 99-106, (Society for Industrial and Applied Mathematics) [Darrasse 2010a]
  • A. Darrasse, K. Panagiotou, O. Roussel, M. Soria : “Boltzmann generation for regular languages with shuffle”, GASCOM 2010 - Conference on random generation of combinatorial structures, Montréal, Canada [Darrasse 2010b]
  • J. Lumbroso : “An optimal cardinality estimation algorithm based on order statistics and its full analysis”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings, Vienna, Austria, pp. 489-504, (Discrete Mathematics and Theoretical Computer Science) [Lumbroso 2010]
  • F. Peschanski : “Principes et pratiques de la programmation en pi-calcul”, Journées Francophone des langages applicatifs (JFLA 2010), Studia Informatica Universalis, Vieux-Port La Ciotat, France, pp. 245-274, (Hermann) [Peschanski 2010a]
  • F. Peschanski, H. Klaudel, R. Devillers : “A Decidable Characterization of a Graphical Pi-calculus with Iterators”, Proc. of the 12th International Workshop on Verification of Infinite-State Systems (INFINITY 2010), vol. 39, EPTCS, Singapore, Singapore, pp. 47-61 [Peschanski 2010b]
  • Ch. Queinnec : “An Infrastructure for Mechanised Grading”, CSEDU 2010 - 2nd International Conference on Computer Supported Education, vol. 2, Valencia, Spain, pp. 37-45, (INSTICC – Institute for Systems and Technologies of Information, Control and Communication) [Queinnec 2010a]
  • Ph. Trébuchet : “A new certified numerical algorithm for solving polynomial systems”, SCAN2010, Lyon, France, pp. 1-8 [Trébuchet 2010]
  • A. Valibouze : “Galoiseries”, Workshop « Groups and languages » en l'honneur d'Antonio Machi, Rome, Italy [Valibouze 2010a]
  • X. Wang, M. Latapy, M. Soria : “Deciding on the type of a graph from a BFS”, Workshop on Complex Networks CompleNet 2010, vol. 116, Communications in Computer and Information Science, Rio de Janeiro, Brazil, pp. 68-74, (Springer) [Wang 2010]
Mentions légales
خـريـطـة المـوقـع