LIP6 CNRS Sorbonne Université Tremplin Carnot Interfaces
Direct Link LIP6 » Pesquisa » Publicações » Artigos de Conferencia
Livros
Livros Editados
Jornais
Capítulos de livros
Artigos de Conferencia
Outras publicações
Habilitações (Livre Docência)
Teses
Equipes atuais : ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Antigos grupos : AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Antigos tópicos de pesquisa : ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF
Publicações APR201420152016201720182019Total
Livros0000000
Livros Editados0010001
Jornais311953334
Capítulos de livros1000001
Artigos de Conferencia1112121212564
Habilitações (Livre Docência)0001001
Teses1011249
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”, 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10), 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, Russia, pp. 1328-1341 [Aubry 2010b]
  • O. Bodini, D. Gardy, O. Roussel : “Boys-and-girls birthdays and Hadamard products”, 7th International Conference on Lattice Path Combinatorics and Applications, vol. 117 (1-4), Fundamenta Informaticae, Siena, Italy, pp. 85-101, (IOS Press) [Bodini 2010b]
  • O. Bodini, Th. Fernique, D. Regnault : “Stochastic flips on two-letter words”, ANALCO 2010 - 7th Workshop on Analytic Algorithmics and Combinatorics, Austin, TX, USA, pp. 48-55, (SIAM), (ISBN: 978-0-898719-33-8) [Bodini 2010d]
  • O. Bodini, Y. Ponty : “Multi-dimensional Boltzmann Sampling of Languages”, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 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, (DMTCS) [Bodini 2010e]
  • 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, USA, 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”, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 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, (DMTCS) [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”, 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, (SCITEPRESS), (ISBN: 978-989-674-024-5) [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]
  • Ph. Wang, A. Jonquet, E. Chailloux : “Non-Intrusive Structural Coverage for Objective Caml”, 5th Workshop on Bytecode Semantics, Verification, Analysis and Transformation, vol. 264 (4), Electronic Notes in Theoretical Computer Science, Paphos, Cyprus, pp. 59-73, (Elsevier) [Wang 2010]
 Mentions légales
Mapa do site |