Publications du LRI pour la période 2005 - 2008

Transcription

Publications du LRI pour la période 2005 - 2008
16 juillet 2008
Table des matières
Algorithmique et complexité
2
Architectures parallèles
12
Bases de données
20
Bioinformatique
26
Démonstration et programmation
35
Test formel et exploration de systèmes
44
Théorie des graphes et optimisation combinatoire
49
Réseaux
56
Apprentissage et optimisation
61
Intelligence artificielle et systèmes d’inférence
72
Interaction Située
83
Parallélisme
93
1
Algorithmique et complexité
Articles de revues internationales majeures : 56
1. A. Abouelaoualim, K. C. Das, W. F. de la Vega, M. Karpinski, Y. Manoussakis, C. Martinhon and R. Saad. “Cycles and paths in edge-colored graphs with given degrees”.
Journal of Graph Theory, 2008.
2. Z. Bar-Yossef, T. S. Jayram and I. Kerenidis. “Exponential separation of quantum
and classical one-way communication complexity”. Siam J. C., 2008. Earlier version
in STOC’03. quant-ph/0208062.
3. S. Corteel and P. Nadeau. “Bijections for permutation tableaux”. European J. Combin.,
2008. To appear.
4. L. Esperet, A. Labourel and P. Ochem. “On induced-universal graphs for the class of
bounded-degree graphs”. Inform. Process. Lett., 2008. In press.
5. L. Esperet and P. Ochem. “On circle graphs with girth at least five”. Discrete Math., 2008.
In press.
6. K. Friedl, G. Ivanyos, M. Santha and Y. Verhoeven. “On the black-box Complexity of
Sperner’s Lemma”. Theory of Computing Systems, 2008. To appear.
7. D. Goncalves and P. Ochem. “On star and caterpillar arboricity”. Discrete Math., 2008.
In press.
8. M. E. Haddad, Y. Manoussakis and R. Saad. “On Antisymetric routings of Networks”.
JCMCC, 2008.
9. S. Laplante and F. Magniez. “Lower bounds for randomized and quantum query complexity using Kolmogorov arguments”. SIAM Journal on Computing, 38(1), 2008.
10. Y. Manoussakis. “Longest cycles in 3-connected graphs”. Graphs and Combinatorics, 2008.
11. M. Montassier, P. Ochem and A. Pinlou. “Strong oriented chromatic number of planar
graphs without short cycles”. DMTCS, 10(1) :1-24, 2008.
12. P. Ochem and A. Pinlou. “Oriented colorings of partial 2-trees”. Inform. Process. Lett.,
2008. In press.
13. P. Ochem, A. Pinlou and E. Sopena. “On the oriented chromatic index of oriented
graphs”. J. Graph Theory, 57(4) :313-332, 2008.
14. P. Ochem, N. Rampersad and J. Shallit. “Avoiding approximate squares”. IJFCS,
19(3) :633-648, 2008.
15. M. Santha and M. Szegedy. “Quantum and classical query complexities of local search
are polynomially related”. Algorithmica, 2008. To appear.
2
16. B. Adamczewski and J-P. Allouche. “Reversals and palindromes in continued fractions”. Theoret. Comput. Sci., 380 :220-237, 2007.
17. D. Aharonov, J. Kempe, Z. Landau, S. Lloyd, O. Regev and W. van Dam. “Adiabatic
Quantum Computation is Equivalent to Standard Quantum Computation”. SIAM J.
Comput., 37(1) :166-194, 2007.
18. S. Corteel and O. Mallet. “Overpartitions, lattice paths, and Rogers-Ramanujan identities”. J. Combin. Theory Ser. A, 114(8) :1407–1437, 2007.
19. W. V. Dam, F. Magniez, M. Mosca and M. Santha. “Self-testing of universal and faulttolerant sets of quantum gates”. SIAM Journal on Computing, 37(2) :611-629, 2007.
20. J. Degorre, S. Laplante and J. Roland. “Simulation of bipartite qudit correlations”. Phys.
Rev. A, 75(1), 2007.
21. E. Kashefi and I. Kerenidis. “Statistical Zero Knowledge and quantum one-way functions”. Theoretical Computer Science, 378(1) :101–116, 2007.
22. F. Magniez and A. Nayak. “Quantum Complexity of Testing Group Commutativity”.
Algorithmica, 48(3) :221-232, 2007.
23. F. Magniez and M. de Rougemont. “Property testing of regular tree languages”. Algorithmica, 49(2) :127-146, 2007.
24. F. Magniez, M. Santha and M. Szegedy. “Quantum Algorithms for the Triangle Problem”. SIAM Journal on Computing, 37(2) :413-424, 2007.
25. P. Ochem. “Letter frequency in infinite repetition-free words”. Theoret. Comput. Sci.,
380(3) :388-392, 2007.
26. P. C. Richter. “Quantum speedup of classical mixing processes”. Physical Review A,
76 :042306, 2007.
27. M. de Rougemont, S. Laplante, R. Lassaigne, F. Magniez and S. Peyronnet. “Probabilistic abstraction for model checking : An approach based on property testing”. ACM
Transaction on Computational Logic, 2007.
28. J. Sudjana, L. Magnin, R. García-Patrón Sánchez and N. J. Cerf. “Tight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis
switching”. Physical Review A, 76 :052301, 2007.
29. R. Brak, S. Corteel, J. Essam, R. Parviainen and A. Rechnitzer. “A combinatorial derivation of the PASEP stationary state”. Electron. J. Combin., 13(1), 2006. Research Paper 108,
23 pp. (electronic).
30. M-P. Béal, F. Fiorenzi and D. Perrin. “The syntactic graph of a sofic shift is invariant
under shift equivalence”. Int. J. Algebra Comput., 16(3) :443-460, 2006.
31. S. Corteel, W. M. Y. Goh and P. Hitczenko. “A local limit theorem in the theory of
overpartitions”. Algorithmica, 46(3-4) :329–343, 2006.
32. S. Corteel and J. Lovejoy. “An iterative-bijective approach to generalizations of Schur’s
theorem”. European J. Combin., 27(4) :496–512, 2006.
33. L. Esperet and P. Ochem. “Oriented colorings of 2-outerplanar graphs”. Inform. Process.
Lett, 101(5) :215-219, 2006.
34. J. Kempe, A. Kitæv and O. Regev. “The Complexity of the Local Hamiltonian Problem”.
SIAM Journal of Computing, 35(5) :1070-1097, 2006.
35. I. Kerenidis and D. Nagaj. “On the optimality of quantum encryption schemes”. Journal
of Mathematical Physics, 47(092102), 2006.
3
36. A. Kesselman and A. Rosén. “Scheduling policies for CIOQ switches”. J. Algorithms,
60(1) :60-83, 2006.
37. S. Laplante, T. Lee and M. Szegedy. “The quantum adversary method and formula size
lower bounds”. Computational Complexity, Special Issue on Complexity 2005, 15(2) :163–196,
2006.
38. X. Le Breton. “Linear independence of automatic formal power series”. Discrete Math.,
306 :1776-1780, 2006.
39. M. Montassier, P. Ochem and A. Raspaud. “On the acyclic choosability of graphs”. J.
Graph Theory, 51(4) :281-300, 2006.
40. A. Rosén and M. S. Tsirkin. “On Delivery Times in Packet Networks under Adversarial
Traffic”. Theory Comput. Syst., 39(6) :805-827, 2006.
41. M. de Rougemont and D. Gross-Amblard. “Uniform generation in spatial constraint
databases and applications”. J. Comput. Syst. Sci., 72(4) :576-591, 2006.
42. Y. Verhoeven. “A lower bound on the competitivity of memoryless algorithms for a
generalization of the CNN problem”. Theor. Comput. Sci., 359 (1-3) :58-68, 2006.
43. Y. Verhoeven. “Enhanced algorithms for Local Search”. Inf. and Process. Lett., 97 (5) :171176, 2006.
44. M. Adler and A. Rosén. “Tight bounds for the performance of Longest In System on
DAGs”. J. Algorithms, 55(2) :101-112, 2005.
45. W. Aiello, Y. Mansour, S. Rajagopolan and A. Rosén. “Competitive queue policies for
differentiated services”. J. Algorithms, 55(2) :113-141, 2005.
46. J-P. Allouche, J. Shallit and G. Skordev. “Self-generating sets, integers with missing
blocks and substitutions”. Discrete Math., 292 :1-15, 2005.
47. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha and R. de
Wolf. “Quantum Algorithms for Element Distinctness”. SIAM Journal on Computing,
34(6) :1324-1330, 2005.
48. M-P. Béal, F. Fiorenzi and F. Mignosi. “Minimal forbidden patterns of multidimensional shifts”. Int. J. Algebra Comput., 15(1) :73-93, 2005.
49. M-P. Béal, F. Fiorenzi and D. Perrin. “A hierarchy of shift equivalent sofic shifts”. Theor.
Comput. Sci., 345(2-3) :190-205, 2005.
50. F. Caselli, C. Krattenthaler, B. Lass and P. Nadeau. “On the Number of Fully Packed
Loop Configurations with a Fixed Associated Matching”. Electronic Journal of Combinatorics, 11(2), 2005.
51. S. Corteel, M. Valencia-Pabon and J-C. Vera. “On approximating the b-chromatic number”. Discrete Appl. Math., 146(1) :106–110, 2005.
52. J. Degorre, S. Laplante and J. Roland. “Simulating quantum correlations as a distributed sampling problem”. Phys. Rev. A, 72, 2005.
53. D. Gouyou-Beauchamps and P. Leroux. “Enumeration of symmetry classes of convex
polyominoes on the honeycomb lattice”. Theoretical Computer Science, 346(2-3) :307-334,
2005.
54. A. Gál and A. Rosén. “Omega(log n) Lower Bounds on the Amount of Randomness in
2-Private Computation”. SIAM J. Comput., 34(4) :946-959, 2005.
55. F. Magniez. “Multi-linearity self-testing with relative error”. Theory of Computing Systems (TOCS), 38(5) :573-591, 2005.
56. P. Ochem, L. Ilie and J. Shallit. “A generalization of repetition threshold”. Theoret. Comput. Sci., 345(2-3) :359-369, 2005.
4
Articles d’autres revues : 36
57. J-P. Allouche. “A note on univoque self-Sturmian numbers”. RAIRO, Informatique Théorique et Applications, 2008. À paraître.
58. J-P. Allouche and M. Mendès France. “Euler, Pisot, Prouhet-Thue-Morse, Wallis and
the duplication of sines”. Monatsh. Math., 2008. À paraître.
59. G. Andrews, S. Corteel and C. Savage. “On q-series identities arising from Lecture Hall
partitions”. Int. J. Number Theory, 2008. To appear.
60. J. Chalopin and P. Ochem. “Dejean’s conjecture and letter frequency”. RAIRO : Theoret.
Informatics Appl., 42(3) :477-480, 2008.
61. S. Corteel and J. Lovejoy. “Overpartitions and the q-Bailey identity”. Proc. Edinburgh
Math. Soc., 2008. To appear.
62. S. Corteel, J. Lovejoy and O. Mallet. “An extension to overpartitions of the RogersRamanujan identities for even moduli”. J. Number Theory, 2008. To appear.
63. F. Fiorenzi. “Periodic configurations of subshifts on groups”. 2008. Submitted.
64. M. de Rougemont and A. Vieilleribière. “Approximate Schemas, Source-Consistency
and Query Answering”. International Journal on Intelligent Database Systems, 2008. To
appear.
65. J-P. Allouche. “Note on an integral of Ramanujan”. Ramanujan J., 14 :39-42, 2007.
66. J-P. Allouche, C. Frougny and K. Hare. “On univoque Pisot numbers”. Math. Comp.,
76 :1639-1660, 2007.
67. J-P. Allouche, J. Shallit and J. Sondow. “Summation of series defined by counting blocks
of digits”. J. Number Theory, 123 :133-143, 2007.
68. J-P. Allouche and G. Skordev. “Von Koch and Thue-Morse revisited”. Fractals, 15 :405409, 2007.
69. A. Chailloux and I. Kerenidis. “Increasing the Power of the Verifier in Quantum Zero
Knowledge”. 2007. quant-ph/0711.4032.
70. A. Chailloux and I. Kerenidis. “The role of Help in classical and quantum Zero Knowledge”. 2007. Cryptology ePrint 2007/421 and quant-ph/0711.4251.
71. S. Corteel. “Crossings and alignments of permutations”. Adv. in Appl. Math.,
38(2) :149–163, 2007.
72. S. Corteel, I. M. Gessel, C. D. Savage and H. S. Wilf. “The joint distribution of descent
and major index over restricted sets of permutations”. Ann. Comb., 11(3-4) :375–386,
2007.
73. S. Corteel, S. Lee and C. D. Savage. “Five guidelines for partition analysis with applications to lecture hall-type theorems”. In Combinatorial number theory, pages 131–155,
de Gruyter, Berlin, 2007.
74. S. Corteel and L. K. Williams. “Tableaux combinatorics for the asymmetric exclusion
process”. Adv. in Appl. Math., 39(3) :293–310, 2007.
75. S. Corteel and L. K. Williams. “A Markov chain on permutations which projects to the
PASEP”. Int. Math. Res. Not. IMRN, (17), 2007. Art. ID rnm055, 27.
76. K. Djemal, D. Goularas and Y. Mannoussakis. “3D image modeling and specific treatments in orthodontics domain”. Journal of Applied Bionics and Biomechanics, 4/3 :111-124,
2007.
5
77. J. Kempe, L. Pyber and A. Shalev. “Permutation groups, minimal degrees and quantum
computing”. Groups, Geometry, and Dynamics, 1(4) :553–584, 2007.
78. P. C. Richter. “Almost uniform sampling via quantum walks”. New Journal of Physics,
9 :72, 2007.
79. G. Allouche, J-P. Allouche and G. Skordev. “Kolam indiens, dessins sur le sable aux
îles Vanuatu, courbe de Sierpinski et morphismes de monoïde”. Ann. Inst. Fourier,
56 :2115-2130, 2006.
80. J. Fern, J. Kempe, S. Sastry and S. Simic. “Fault-tolerant quantum computation - a
dynamical systems approach”. IEEE Transactions on Automated Control, 51(3) :448-459,
2006. quant-ph/0409084.
81. C. Hess. “Trust-Based Recommendations for Publications - A Multi-Layer Network
Approach”. IEEE Technical Committee on Digital Libraries (TCDL) Bulletin, 2(2), 2006. Online available at http ://www.ieee-tcdl.org/Bulletin/v2n2/hess/hess.html, Revised Paper from the Doctoral Consortium at the 9th European Conference on Research and
Advanced Technology for Digital Libraries (ECDL 2005), Vienna, Austria.
82. J. Kempe, S. Laplante and F. Magniez. “Comment calculer quantique”. La Recherche,
(398) :30-37, 2006.
83. I. Kerenidis and R. Raz. “The one-way communication complexity of the Boolean Hidden Matching Problem”. 2006. quant-ph/0607173.
84. P. Ochem. “A generator of morphisms for infinite words”. RAIRO : Theoret. Informatics
Appl., 40(3) :427-441, 2006.
85. J-P. Allouche. “Automates et algébricités”. J. Théorie des Nombres Bordeaux, 17 :1-11, 2005.
86. J-P. Allouche, N. Rampersad and J. Shallit. “On integer sequences whose first iterates
are linear”. Aequ. Math., 69 :114-127, 2005.
87. K. Brown, J. Kempe, M. Storcz, J. Vala, K. Whaley and F. Wilhelm. “Full protection of
superconducting qubit systems from coupling errors”. Phys. Rev. B, 72 :064511, 2005.
cond-mat/0407780.
88. S. Corteel, S. Lee and C. D. Savage. “Enumeration of sequences constrained by the ratio
of consecutive parts”. Sém. Lothar. Combin., 54A, 2005. Art. B54Aa, 12 pp. (electronic).
89. S. Corteel, C. D. Savage and H. S. Wilf. “A note on partitions and compositions defined
by inequalities”. Integers, 5(1), 2005. A24, 11 pp. (electronic).
90. C. Hess. “Trust-Based Recommendations for Publications - A Multi-Layer Network
Approach”. Doctoral Consortium at the 9th European Conference on Research and Advanced Technology for Digital Libraries (ECDL 2005), Vienna, Austria, September 2005.
91. J. Kempe. “Discrete Quantum Walks Hit Exponentially Faster”. Probability Theory and
Related Fields, 133(2) :215–235, 2005.
92. P. Zoller, T. Beth, D. Binosi, R. Blatt, H. Briegel, D. Bruss, T. Calarco, J. Cirac, D. Deutsch,
J. Eisert, A. Ekert, C. Fabre, N. Gisin, P. Grangier, M. Grassl, S. Haroche, A. Imamoglu, A.
Karlson, J. Kempe, L. Kouwenhoven, S. Kröll, G. Leuchs, M. Lewenstein, D. Loss, N. Lütkenhaus, S. Massar, J. Mooij, M. Plenio, E. Polzik, S. Popescu, G. Rempe, A. Sergienko,
D. Suter, J. Twamley, G. Wendin, R. Werner, A. Winter, J. Wrachtrup and A. Zeilinger.
“Quantum information processing and communication”. Eur. Phys. J. D, 36 :203-228,
2005.
6
Articles de conférences et workshops internationaux majeurs : 44
93. A. Abouelaoualim, K. C. Das, L. Faria, Y. Manoussakis, C. Martinhon and R. Saad. “Paths
and Trails in Edge-Colored Graphs”. In Proceedings of LATIN 2008, Brazil, 2008.
94. A. Chailloux, D. F. Ciocan, I. Kerenidis and S. Vadhan. “Interactive and Noninteractive
Zero Knowledge are Equivalent in the Help Model”. In Proceedings of IACR Fifth Theory
of Cryptography Conference (TCC), 2008.
95. G. Ivanyos, L. Sanselme and M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups”. In Proceedings of 8th Latin American Symposium
on Theoretical Informatics, Buzios, Brazil, LNCS 4957, pages 759-771, 2008. Springer, Berlin.
96. P. C. Richter. “The quantum complexity of Markov chain Monte Carlo”. In A. Beckmann, C. Dimitracopoulos and B. Löwe, editors, Proceedings of 3rd Conference on Computability in Europe, Athens, Greece, 2008, volume 5028 of LNCS, 2008. Springer, Berlin.
97. M. de Rougemont, S. Hemon and M. Santha. “Approximate Nash Equilibria for Multiplayer Games”. In Proceedings of 1st International Symposium on Algorithmic Game Theory,
LNCS 4997, pages 267-278, 2008. Springer, Berlin.
98. D. Aharonov, D. Gottesman, S. Irani and J. Kempe. “The Power of Quantum Systems
on a Line”. In FOCS, pages 373-383, 2007.
99. L. Antunes, S. Laplante, A. Pinto and L. Salvador. “Cryptographic security of individual
instances”. In Proceedings of International Conference on Information Theoretic Security 2007,
2007. To appear.
100. J. Chalopin, D. Goncalves and P. Ochem. “Planar graphs are in 1-STRING”. In Proceedings of SODA’07, pages 609-617, 2007.
101. M. Dah and Y. Manoussakis. “On the Network security games”. In 22nd European Conference on Operations Research, Prague, 2007.
102. D. Gouyou-Beauchamps and P. Nadeau. “Signed Enumeration of Ribbon Tableaux
With Local Rules and Generalizations of the Schensted Correspondence”. In Proceedings of 19th International Conference on Formal Power Series &Algebraic Combinatorics, July
2-6, 2007, Nankai University, Tianjin, China, 2007.
103. C. Hess and K. Stein. “Efficient Calculation of Personalized Document Rankings”. In
Proceedings of the Twentieth International Conference on Artificial Intelligence (IJCAI 2007),
January 2007.
104. G. Ivanyos, L. Sanselme and M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups”. In Proceedings of 24th Symposium on
Theoretical Aspects of Computer Science, Aachen, Germany, LNCS 4393, pages 586-597, 2007.
Springer, Berlin.
105. I. Kerenidis. “Quantum multiparty communication complexity and circuit lower
bounds”. In Proceedings of 4th Annual Conference on Theory and Applications of Models of
Computation (TAMC), 2007. quant-ph/0504087.
106. I. Kerenidis. “Quantum multiparty communication complexity and circuit lower
bounds”. Mathematical Structures in Computer Science, 2007. To appear. Special issue for
TAMC 2007.
107. Z. Lotker, B. Patt-Shamir and A. Rosén. “Distributed approximate matching”. In PODC,
pages 167-174, 2007.
108. F. Magniez, A. Nayak, J. Roland and M. Santha. “Search via quantum walk”. In Proceedings of 39th ACM Symposium on Theory of Computing, pages 575-584, 2007.
7
109. RD de Wolf, Gavinsky, J. Kempe, I. Kerenidis and R. Raz. “Exponential separations for
one-way quantum communication complexity, with applications to cryptography”. In
Proceedings of 39th ACM STOC, pages 516–525, 2007. quant-ph/0611209.
110. A. Rosén and G. Scalosub. “Rate vs. buffer size : greedy information gathering on the
line”. In SPAA, pages 305-314, 2007.
111. M. de Rougemont and C. Hess. “A Model of Uncertainty for Near-Duplicates in Document Reference Networks”. In ECDL, pages 449-453, 2007.
112. M. de Rougemont and A. Vieilleribière. “Approximate Data Exchange”. In International
Conference on Database Technology, (ICDT), pages 44-58, 2007.
113. M. de Rougemont and A. Vieilleribière. “Property Testing for Approximate Search and
Integration”. In Third Franco-Japanese Workshop on Information Search, Integration and Personalization, ISIP’07, 2007.
114. W. F. de la Vega and C. Kenyon-Mathieu. “Linear programming relaxations of maxcut”.
In SODA, pages 53-61, 2007.
115. K. Friedl, G. Ivanyos, M. Santha and Y. Verhoeven. “Locally 2-dimensional Sperner
problem complete for the Polynomial Parity Argument classes”. In Proceedings of 6th
Italian Conference on Algorithms and Complexity, Roma, Italy, LNCS 3998, pages 380-391,
2006. Springer, Berlin.
116. C. Hess, K. Stein and C. Schlieder. “Trust-Enhanced Visibility for Personalized Document Recommendations”. In Proceedings of the 21st Annual ACM Symposium on Applied
Computing, Dijon, France, April 2006.
117. S. Laplante. “Lower bounds using Kolmogorov complexity”. In Logical Approaches to
Computational Barriers, Second Conference on Computability in Europe, CiE 2006, pages
297–306, 2006.
118. F. Magniez, D. Mayers, M. Mosca and H. Ollivier. “Self-Testing of quantum circuits”.
In Proceedings of 33rd International Colloquium on Automata, Languages and Programming,
volume 4051 of Lecture Notes in Computer Science, pages 72-83, Verlag, 2006.
119. P. Nadeau. “A General Bijection for Walks on the Slit Plane”. In Proceedings of 18th
International Conference on Formal Power Series &Algebraic Combinatorics, June 2006, San
Diego, CA, USA, 2006.
120. M. de Rougemont, E. Fischer and F. Magniez. “Approximate Satisfiability and Equivalence”. In IEEE Logic in Computer Science, pages 421-430, 2006.
121. R. de Wolf, D. Gavinsky and J. Kempe. “Strength and Weaknesses of Quantum Fingerprinting”. In Proc. 21st IEEE CCC, pages 288-295, 2006. IEEE.
122. R. de Wolf, D. Gavinsky, J. Kempe and O. Regev. “Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity”. In Proc. 38th
STOC, pages 594-603, 2006. ACM. quant-ph/0511013.
123. J-P. Allouche and A. Sapir. “Restricted towers of Hanoi and morphisms”. In DLT (Palermo, 2005), volume 3572 of Lecture Notes in Comput. Sci., pages 1-10, Springer, 2005.
124. A. Ambainis, J. Kempe and A. Rivosh. “Coins Make Quantum Walks Faster”. In Proc.
16th ACM SODA, pages 1099-1108, 2005. ACM. quant-ph/0402107.
125. K. Friedl, G. Ivanyos and M. Santha. “Efficient testing of groups”. In Proceedings of 36th
ACM Symposium on Theory of Computing, Baltimore, USA, pages 157-166, 2005. ACM.
126. K. Friedl, G. Ivanyos, M. Santha and Y. Verhoeven. “On the black-box complexity of
Sperner’s Lemma”. In Proceedings of 15th International Symposium on Fundamentals of Computation Theory, Lübeck, Germany, LNCS 3623, pages 245-257, 2005. Springer, Berlin.
8
127. E. Gordon and A. Rosén. “Competitive weighted throughput analysis of greedy protocols on DAGs”. In PODC, pages 227-236, 2005.
128. J. Kempe and A. Shalev. “The hidden subgroup problem and permutation group
theory”. In Proc. 16th ACM SODA, pages 1118-1125, 2005. ACM. quant-ph/0406046.
129. S. Laplante, T. Lee and M. Szegedy. “The quantum adversary method and formula
size lower bounds”. In Proceedings of IEEE Conference on Computational Complexity, pages
76-90, 2005.
130. F. Magniez and A. Nayak. “Quantum Complexity of Testing Group Commutativity”.
In Proceedings of 32nd International Colloquium on Automata, Languages and Programming,
volume 1770 of Lecture Notes in Computer Science, pages 1312-1324, Verlag, 2005.
131. F. Magniez, M. Santha and M. Szegedy. “Quantum Algorithms for the Triangle Problem”. In Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms, pages 11091117, 2005.
132. P. Nadeau. “Walks Reaching a Line”. In S. Felsner, editor, Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), Berlin, volume AE
of DMTCS Proceedings, pages 401-406, 2005. Discrete Mathematics and Theoretical Computer Science.
133. J. Naor, A. Rosén and G. Scalosub. “Online time-constrained scheduling in linear networks”. In INFOCOM, pages 855-865, 2005.
134. M. de Rougemont. “Approximate schemas and Query Answering”. In Second FrancoJapanese Workshop on Information Search, Integration and Personalization, ISIP’05, 2005.
135. H. Räcke and A. Rosén. “Distributed online call control on general networks”. In
SODA, pages 791-800, 2005.
136. W. F. de la Vega, R. Kannan, M. Karpinski and S. Vempala. “Tensor decomposition and
approximation schemes for constraint satisfaction problems”. In STOC ’05 : Proceedings
of the thirty-seventh annual ACM symposium on Theory of computing, pages 747–754, New
York, NY, USA, 2005. ACM.
Articles d’autres conférences et workshops : 11
137. H. Cheng, M. de Rougemont and L. Jun. “Approximate validity of XML Streaming
Data”. In 9th International Conference on Web-age Information Management, 2008.
138. C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis. “Adaptive Triangulation Method for Management of the Topology Changes in 3D boundary Reconstruction”. In
Proceeeding of the 4th IEEE Conference on Systems Signals and Devices, 2007, Hammamet,
Tynisia, 2007.
139. C. Hess and K. Stein. “Personalized Document Rankings by Incorporating Trust Information From Social Network Data into Link-Based Measures”. In Proceedings of the
IJCAI 2007 Workshop on Text Mining &Link Analysis, Jan 2007.
140. P. Ochem. “Unequal letter frequencies in ternary square-free words”. In Proceedings of
WORDS 2007, 2007.
141. C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis. “Specific 3D Treatement in
orthodontic domain”. In International Symposium on Robotics and Automation (ISRA 2006),
2006, Mexico, ISBN : 970-769-070-4,, 2006.
9
142. E. Kashefi and I. Kerenidis. “Statistical Zero Knowledge and quantum one-way functions”. In Proceedings of PQCrypto 2006 : International Workshop on Post-Quantum Cryptography, 2006.
143. P. Ochem and T. Reix. “Upper bound on the number of ternary square-free words”. In
Proceedings of the workshop on Words and Automata WOWA’06, 2006.
144. P. Baptiste, M. Chrobak, C. Dürr and F. Sourd. “Preemptive Multi-Machine Scheduling
of Equal-Length Jobs to Minimize the Average Flow Time”. In Proc. of the 7th Workshop
on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2005.
145. C. Cosenza, K. Djemal, D. Goularas and Y. Manoussakis. “DIVITOR Client/Server Application (DIgitalization, VIsualisation and Treatment in Orthodontics)”. In Proceedings of the 5th International Network Conference (INC05), 2005, Samos, Greece, 2005.
146. J. Degorre and J. Roland. “An intuitive approach for the simulation of quantum correlations”. In 26th Symposium on Information Theory in the Benelux, 2005.
147. A. Vieilleribière and D. Forge. “Some Properties of Directed Switching Games on
Oriented Matroids”. In Oriented Matroids and matroids, 2005.
Direction d’ouvrages : 1
148. Y. Manoussakis Eds. Combinatorics, Geometry and Computer Science, Elsevier Science, 2008.
To appear.
Thèses et Habilitations : 3
149. J. Degorre. “Quantifier la non-localité”. Université Paris-Sud XI, 2007.
150. F. Magniez. “Vérification approchée - Calcul quantique”. Habilitation, Université ParisSud, France, 2007. Record number 1018.
151. S. Laplante. “Applications de la complexité de Kolmogorov à la complexité classique
et quantique”. Habilitation, Université Paris-Sud, France, 2005.
Autres publications : 10
152. P. C. Richter. “Quantum algorithms for triangle finding”. In Encyclopedia of Algorithms,
Springer, 2008.
153. P. C. Richter and M. Szegedy. “Quantization of Markov chains”. In Encyclopedia of Algorithms, Springer, 2008.
154. M. Santha. “Quantum walk based search algorithms”. In Proceedings of 5th International
Conference on Theory and Applications of Models of Computation, Xian, China, LNCS 4978,
pages 31-46, 2008. Springer, Berlin.
155. S. Corteel and P. Hitczenko. “Generalizations of Carlitz compositions”. J. Integer Seq.,
10(8) :Article 07.8.8, 13 pp. (electronic), 2007.
156. P. C. Richter. “Two remarks on the local Hamiltonian problem”. 2007. arXiv :0712.4274
[quant-ph].
10
157. S. Corteel, G. Louchard and R. Pemantle. “Common intervals in permutations”. Discrete
Math. Theor. Comput. Sci., 8(1) :189–216 (electronic), 2006.
158. J. Kempe. Decoherence, chapter Approaches to Quantum Error Correction, pages 85–123,
Progress in Mathematical Physics, Birkhäuser, 2006.
159. J. Kempe. Lecture Notes on Quantum Information, chapter Quantum Algorithms, pages
87–102, Whiley-VCH, 2006.
160. K. Stein and C. Hess. “Information Retrieval in Trust-enhanced Document Networks”.
In M. Ackermann, B. Berendt, M. Grobelnik, A. Hotho, D. Mladenic, G. Semeraro, M.
Spiliopoulou, G. Stumme, V. Svatek and M. van Someren, editors, Semantics, Web, and
Mining. European Web Mining Forum, EMWF 2005, and Knowledge Discovery and Ontologies,
KDO 2005, Porto, Portugal, October 2005, Revised Selected and Invited Papers, LNAI 4289,
Springer, 2006.
161. J-P. Allouche and V. Berthé. “Some applications of combinatorics on words in number
theory”. In Applied Combinatorics on Words, pages 520-578, Cambridge University Press,
2005.
11
Architectures parallèles
1. P. Carribault, S. Zuckerman, A. Cohen and W. Jalby. “Deep jam : Conversion of coarsegrain parallelism to fine-grain and vector parallelism”. Journal of Instruction-Level Parallelism, 2008.
2. F. Gruau, C. Eisenbeis and L. Maignan. “The foundation of self-developing blob machines for spatial computing”. Physica D : Nonlinear Phenomena, 237(1) :1282-1301, July
2008. Special issue : "Novel Computing Paradigms : Quo Vadis ?".
3. S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler and O. Temam. “SemiAutomatic Composition of Loop Transformations for Deep Parallelism and Memory
Hierarchies”. International Journal of Parallel Programming, 34(3) :261–317, June 2006.
4. D. Gracia-Pérez, H. Berry and O. Temam. “The Practicality Dimension of Sampling”.
IEEE micro, 26 :14-28, 2006.
5. S. Yehia, J-F. cois Collard and O. Temam. “Load Squared : Adding Logic Close to Memory to Reduce the Latency of Indirect Loads in Embedded and General Systems”.
Journal of Embedded Computing, 2(1), January 2006.
6. B. Siri, H. Berry, B. Cessac, B. Delord and M. Quoy. “A mathematical analysis of the
effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks”. Neural Computation, 2008. in press.
7. D. August, J. Chang, S. Girbal, D. Gracia-Pérez, G. Mouchard, D. Penry, O. Temam
and N. Vachharajani. “An Open Simulation Environment and Library for Complex
Architecture Design and Collaborative Development”. Computer Architecture Letters,
6(2) :45–48, February 2007.
8. H. Berry and O. Temam. “Modeling Self-Developping Biological Neural Network”.
Neurocomputing, 70(16-18) :2723–2734, 2007.
9. B. Delord, H. Berry, E. Guigon and S. Genet. “A New Principle for Information Storage
in an Enzymatic Pathway Model”. PLoS Computational Biology, 3(6 :e124), June 2007.
10. G. Fursin, A. Cohen, M. O’Boyle and O. Temam. “Quick and practical run-time evaluation of multiple program optimizations”. Trans. on High Performance Embedded Architectures and Compilers, 1(1) :13-31, January 2007.
12
11. B. Siri, M. Quoy, B. Delord, B. Cessac and H. Berry. “Effects of Hebbian learning on the
dynamics and structure of random networks with inhibitory and excitatory neurons”.
Journal of Physiology, 101 :138–150, 2007.
12. H. Berry, D. Gracia-Pérez and O. Temam. “Chaos in computer performance”. Chaos,
16(1) :013110, 2006.
13. H. Berry, D. Pellenc and O. Gallet. “Adsorption-induced fibronectin aggregation and
fibrillogenesis”. Journal of Colloid and Interface Science, 2006.
14. H. Berry and M. Quoy. “Structure and dynamics of random recurrent neural networks”. Adaptive Behavior, 14 :129-137, 2006.
15. S. Long and G. Fursin. “Systematic search within an optimisation space based on Unified Transformation Framework”. Special issue of the International Journal of Computational
Science and Engineering (IJCSE), 2006.
16. C. Bastoul and P. Feautrier. “Adjusting a program transformation for legality”. Parallel
processing letters, 15(1) :3–17, March 2005.
17. J. Cohen. “Typage des collections topologiques hétérogènes et des transformations”.
Technique et Science Informatique, 24(9) :1081-1111, 2005.
18. D. Pellenc, O. Gallet and H. Berry. “Adsorption-induced conformational changes in
protein diffusion-aggregation surface assemblies”. Physical Review E, 72 :051904 051904,
2005.
19. D. Etiemble and L. Lacassagne. “Des flottants 16 bits sur microprocesseurs d’usage
général pour images et multimédia”. Techniques et Science Informatique., 24(5).
20. O. Certner, Z. Li, P. Palatin and O. Temam. “A Practical Approach for Reconciling
High and Predictable Performance in Non-Regular Parallel Programs”. In DATE 2008,
Munich, Germany, March 2008.
21. F. Jiang, H. Berry and M. Schoenauer. “Unsupervised Learning of Echo State Networks : Balancing the Double Pole”. In Genetic and Evolutionary Computation Conference,
GECCO-2008, Atlanta, GA, USA, July 2008.
22. F. Jiang, H. Berry and M. Schoenauer. “Supervised and Unsupervised Evolutionary
Learning of Echo State Networks”. In 10th International Conference on Parallel Problem
Solving From Nature, PPSN-2008, Dortmund, Germany, September 2008.
23. L-N. Pouchet, C. Bastoul, A. Cohen and J. Cavazos. “Iterative optimization in the polyhedral model : Part II, multidimensional time”. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’08), Tucson, Arizona, June 2008.
24. J. Cavazos, G. Fursin, F. Agakov, E. Bonilla, M. O’Boyle and O. Temam. “Rapidly Selecting Good Compiler Optimizations using Performance Counters”. In ACM International Conference on Code Generation and Optimization (CGO’07), pages 185–197, San Jose,
California, March 2007.
25. F. Jiang, H. Berry and M. Schoenauer. “Optimizing the topology of complex neural
networks”. In European Conference on Complex Systems (ECCS’07), Dresden, Germany,
October 2007.
13
26. L-N. Pouchet, C. Bastoul, A. Cohen and N. Vasilache. “Iterative optimization in the
polyhedral model : Part I, one-dimensional time”. In ACM International Conference on
Code Generation and Optimization (CGO’07), pages 144–156, San Jose, California, March
2007.
27. B. Siri, H. Berry, B. Cessac, B. Delord and M. Quoy. “Local learning rules and bifurcations in the global dynamics of random recurrent neural networks”. In European
Conference on Complex Systems (ECCS’07), Dresden, Germany, October 2007.
28. N. Vasilache, A. Cohen and L-N. Pouchet. “Automatic correction of loop transformations”. In Parallel Architectures and Compilation Techniques (PACT’07), pages 292–304, Brasov, Romania, September 2007. IEEE Computer Society Press.
29. F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin, M. O’Boyle, J. Thomson, M. Toussaint and C. Williams. “Using Machine Learning to Focus Iterative Optimization”. In
Proceedings of the 4th Annual International Symposium on Code Generation and Optimization
(CGO), 2006.
30. P. Amiranoff, A. Cohen and P. Feautrier. “Beyond Iteration Vectors : Instancewise Relational Abstract Domains”. In Static Analysis Symposium (SAS’06), pages 161–180, Seoul,
Corea, August 2006.
31. J. Cavazos, C. Dubach, F. Agakov, E. Bonilla, M. O’Boyle, G. Fursin and O. Temam. “Automatic Performance Model Construction for the Fast Software Exploration of New
Hardware Designs”. In International Conference on Compilers, Architecture, And Synthesis For Embedded Systems (CASES 2006), pages 24–34, Seoul, Korea, October 2006. ACM
Press.
32. A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau and M. Pouzet. “NSychronous Kahn Networks”. In 33th ACM Symp. on Principles of Programming Languages
(PoPL’06), pages 180–193, Charleston, South Carolina, January 2006.
33. P. Palatin, Y. Lhuillier and O. Temam. “Capsule : Hardware-Assisted Parallel Execution
of Component-Based Programs”. In The 39th Annual IEEE/ACM International Symposium
on Microarchitecture, 2006, Orlando, Florida, December 2006.
34. N. Vasilache, C. Bastoul and A. Cohen. “Polyhedral Code Generation in the Real
World”. In Proceedings of the International Conference on Compiler Construction (ETAPS
CC’06), LNCS 3923, pages 185–201, Vienna, Austria, March 2006. Springer-Verlag.
35. N. Vasilache, C. Bastoul, S. Girbal and A. Cohen. “Violated dependence analysis”. In
Proceedings of the ACM International Conference on Supercomputing (ICS’06), pages 335–344,
Cairns, Australia, June 2006. ACM.
36. H. Berry and O. Temam. “Characterizing Self-Developing Biological Neural Networks : A First Step Towards their Application To Computing Systems”. In 8th International Work-Conference on Artificial Neural Networks, IWANN 2005, LNCS 3512, pages
306-317, June 2005. Springer.
37. P. Carribault, A. Cohen and W. Jalby. “Deep Jam : Conversion of Coarse-Grain Parallelism to Instruction-Level and Vector Parallelism for Irregular Applications”. In Parallel Architectures and Compilation Techniques (PACT’05), pages 291–300, St-Louis, Missouri,
September 2005. IEEE Computer Society.
38. A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau and M. Pouzet. “Synchronization of Periodic Clocks”. In ACM Conf. on Embedded Software (EMSOFT’05), pages
339–342, Jersey City, New York, September 2005.
14
39. A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam and N. Vasilache. “Facilitating the
Search for Compositions of Program Transformations”. In ACM Intl. Conf. on Supercomputing (ICS’05), pages 151–160, Boston, Massachusetts, June 2005.
40. B. Franke, M. O’Boyle, J. Thomson and G. Fursin. “Probabilistic Source-Level Optimisation of Embedded Systems Software”. In Proceedings of the Conference on Languages,
Compilers, and Tools for Embedded Systems (LCTES’05), pages 78-86, June 2005.
Articles de conférences et workshops nationaux majeurs : 1
41. J. Cohen. “Interprétation par SK-traduction et syntaxe abstraite d’ordre supérieur”. In
O. Michel, editor, Journées Francophones des Langages Applicatifs (JFLA 2005), pages 17-34,
2005. INRIA.
42. O. Certner, Z. Li and O. Temam. “A Practical Approach for Reconciling High and
Predictable Performance in Non-Regular Parallel Programs”. In First Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG), within HiPEAC International
Conference, Göteborg, Sweden, Jan 2008.
43. G. Fursin, C. Miranda, O. Temam, M. Namolaru, E. Yom-Tov, A. Zaks, B. Mendelson, P.
Barnard, E. Ashton, E. Courtois, F. Bodin, E. Bonilla, J. Thomson, H. Leather, C. Williams
and M. O’Boyle. “MILEPOST GCC : machine learning based research compiler”. In
Proceedings of the GCC Developers’ Summit, June 2008.
44. N. Inglart, S. Niar and A. Cohen. “Hybrid performance analysis to accelerate compiler
optimization space exploration for in-order processors”. In 2nd Workshop on Statistical
and Machine learning approaches to ARchitectures and compilaTion (SMART’08), Göteborg,
Sweden, January 2008.
45. L-N. Pouchet, C. Bastoul, J. Cavazos and A. Cohen. “A Note on the Performance Distribution of Affine Schedules”. In 2nd Workshop on Statistical and Machine learning approaches to ARchitectures and compilaTion (SMART’08), Göteborg, Sweden, January 2008.
46. C. Dubach, J. Cavazos, B. Franke, M. O’Boyle, G. Fursin and O. Temam. “Fast Compiler
Optimisation Evaluation Using Code-Feature Based Performance Prediction”. In Proceedings of the ACM International Conference on Computing Frontiers, pages 131–142, Ischia,
Italy, May 2007.
47. M. Fellahi, A. Cohen and S. Touati. “Code-Size Conscious Pipelining of Imperfectly
Nested Loops”. In MEDEA Workshop (MEmory performance DEaling with Applications,
systems and architecture), held in conjunction with PACT 2007 Conference, Brasov, Romania,
September 2007.
48. G. Fursin, J. Cavazos, M. O’Boyle and O. Temam. “MiDataSets : Creating The Conditions For A More Realistic Evaluation of Iterative Optimization”. In International
Conference on High Performance Embedded Architectures &Compilers (HiPEAC 2007), pages
245–260, January 2007.
49. G. Fursin and A. Cohen. “Building a Practical Iterative Interactive Compiler”. In 1st
Workshop on Statistical and Machine Learning Approaches Applied to Architectures and Compilation (SMART’07), colocated with HiPEAC 2007 conference, Ghent, Belgium, January 2007.
15
50. G. Fursin, C. Miranda, S. Pop, A. Cohen and O. Temam. “Practical run-time adaptation
with procedure cloning to enable continuous collective compilation”. In Proc. of the 5th
GCC Developper’s Summit, Ottawa, Canada, July 2007.
51. P. Lesnicki, A. Cohen, G. Fursin, M. Cornero, A. Ornstein and E. Rohou. “Split Compilation : an Application to Just-in-Time Vectorization”. In International Workshop on
GCC for Research in Embedded and Parallel Systems in conjunction with PACT’07, Brasov,
Romania, September 2007.
52. S. Long, G. Fursin and B. Franke. “A Cost-Aware Parallel Workload Allocation Approach based on Machine Learning Techniques”. In Proceedings of the IFIP International
Conference on Network and Parallel Computing (NPC 2007), number 4672 in LNCS, pages
506-515, Dalian, China, September 2007. Springer Verlag.
53. S. Salva, C. Delamare and C. Bastoul. “Web Service Call Parallelization Using
OpenMP”. In 3rd International Workshop on OpenMP, LNCS, Beijing, China, June 2007.
54. H. Berry. “Structure complexe et émergence dans les réseaux de neurones biologiques”. In 3ème Workshop Applications Médicales de l’Informatique : Nouvelles Approches,
AMINA 2006, Monastir, Tunisia, November 2006.
55. H. Berry, D. Gracia-Pérez and O. Temam. “Caractérisation de la performance des microprocesseurs pendant l’exécution de programmes”. In 9emes Rencontres du Non Linéaire,
Paris, France, March 2006.
56. H. Berry, D. Gracia-Pérez and O. Temam. “Complex dynamics of microprocessor performances during program execution : Regularity, chaos, and others”. In NKS2006
Wolfram Science Conference, Washington D.C., USA, June 2006.
57. S. Genet, B. Delord, L. Sabarly, E. Guigon and H. Berry. “On the propagation of Cadependent plateau and valley potentials in cerebellar Purkinje cells and how they
drive the cell output”. In Proceedings of NeuroComp’06, pages 167–170, Pont-à-Mousson,
France, October 2006.
58. D. Gracia-Pérez, H. Berry and O. Temam. “Budgeted Region Sampling (BeeRS) : Do
Not Separate Sampling From Warm-Up, And Then Spend Wisely Your Simulation
Budget”. In 5th IEEE International Symposium on Signal Processing and Information Technology, Athens, Greece, 2006.
59. S. Pop, A. Cohen, C. Bastoul, S. Girbal, P. Jouvelot, G-A. Silber and N. Vasilache. “GRAPHITE : Loop optimizations based on the polyhedral model for GCC”. In Proc. of the
4th GCC Developper’s Summit, pages 179-198, Ottawa, Canada, June 2006.
60. S. Pop, A. Cohen, P. Jouvelot and G-A. Silber. “The New Framework for Loop Nest
Optimization in GCC : from Prototyping to Evaluation”. In Proc. of the 12th Workshop
Compilers for Parallel Computers (CPC’06), A Coruña, Spain, January 2006.
61. B. Siri, H. Berry, B. Cessac, B. Delord and M. Quoy. “Topological and dynamical structures induced by Hebbian learning in random neural networks”. In International Conference on Complex Systems, ICCS 2006, Boston, MA, USA, June 2006.
62. B. Siri, H. Berry, B. Cessac, B. Delord, M. Quoy and O. Temam. “Learning-induced
topological effects on dynamics in neural networks”. In Proceedings of NeuroComp’06,
pages 206–209, Pont-à-Mousson, France, October 2006.
63. H. Berry and M. Quoy. “Structure and dynamics of random recurrent neural networks”. In activate.d : active agents and their environments as dynamical systems, Canterbury,
UK, 09 2005.
16
64. A. Cohen and C. Herrmann. “Towards a High-Productivity and High-Performance
Marshaling Library for Compound Data”. In 2nd MetaOCaml Workshop (associated with
GPCE), Tallinn, Estonia, October 2005.
65. S. Donadio, J. Brodman, T. Roeder, K. Yotov, D. Barthou, A. Cohen, M. Garzaran, D.
Padua and K. Pingali. “A Language for the Compact Representation of Multiple Program Versions”. In Workshop on Languages and Compilers for Parallel Computing (LCPC’05),
LNCS, Hawthorne, New York, October 2005. Springer-Verlag.
66. G. Fursin, A. Cohen, M. O’Boyle and O. Temam. “A Practical Method For Quickly
Evaluating Program Optimizations”. In Intl. Conf. on High Performance Embedded Architectures and Compilers (HiPEAC’05), number 3793 in LNCS, pages 29–46, Barcelona, Spain,
November 2005. Springer-Verlag.
67. D. Gracia-Pérez, H. Berry and O. Temam. “IDDCA : A New Clustering Approach For
Sampling”. In MoBS : Workshop on Modeling, Benchmarking, and Simulation MoBS : Workshop on Modeling, Benchmarking, and Simulation, Madison, Wisconsin, 2005.
68. Y. Lhuillier, P. Palatin and O. Temam. “Symbiotic Processing : Toward a Better Balance
Between Architecture, Compiler and User Efforts”. In Proceedings of the 1st International
Workshop on Reconfigurable Communication-centric Systems-on-Chip, ReCoSoC 2005, pages
9–18, Montpellier, France, June 2005.
69. S. Long and G. Fursin. “A heuristic search algorithm based on Unified Transformation
Framework”. In Proceedings of the 7th International Workshop on High Performance Scientific
and Engineering Computing (HPSEC-05), pages 137–144, June 2005.
70. D. Padua, W-Y. Chen, A. Cohen, G. Gao, L. Rauchwerger and P-C. Yew. “Panel on Automatic Program Optimization”. In Computer Innovation 6016, IFIP Intl. Conf. on Network
and Parallel Computing (NPC’05), number 3779 in LNCS, Beijing, China, December 2005.
Springer-Verlag.
71. D. Pellenc, O. Gallet and H. Berry. “Two-dimensional protein aggregation : Effect of
surface- and neighbour-induced conformational changes”. In European Conference on
Mathematical and Theoretical Biology (ECMTB), Dresden, Germany, July 2005.
72. S. Pop, A. Cohen and G-A. Silber. “Induction Variable Analysis with Delayed Abstractions”. In Intl. Conf. on High Performance Embedded Architectures and Compilers (HiPEAC’05), number 3793 in LNCS, pages 218–232, Barcelona, Spain, November 2005.
Springer-Verlag.
Autres communications dans des conférences et workshops : 2
73. M. Bahi, C. Eisenbeis, B. Dauvergne and A. Cohen. “Spatial complexity of reversible
computing”. In Third International Summer School on Advanced Computer Architecture and
Compilation for Embedded Systems (ACACES’08), L’Aquila, Italy, July 2008.
74. L-N. Pouchet, C. Bastoul and A. Cohen. “LetSee : the LEgal Transformation SpacE
Explorator”. In Third International Summer School on Advanced Computer Architecture and
Compilation for Embedded Systems (ACACES’07), L’Aquila, Italy, July 2007. pages 247–251.
17
75. A. Cohen. “Contributions à la conception de systèmes programmables, performants
et sûrs : principes, interfaces, algorithmes et outils”. Habilitation Thesis, University
Paris-Sud 11, Orsay, France, March 2007.
76. N. Vasilache. “Scalable optimization techniques in the polyhedral model”. PhD Thesis,
University Paris-Sud 11, Orsay, France, September 2007.
77. S. Girbal. “Optimisation d’applications - Composition de transformations de programme : modle et outils”. PhD Thesis, University Paris-Sud 11, Orsay, France, September 2005.
78. D. Gracia-Pérez. “Towards the Adoption of Structural Simulation”. PhD Thesis, University Paris-Sud 11, Orsay, France, October 2005.
79. Y. Lhuillier. “Architecture et programmation spatiale”. PhD Thesis, University ParisSud 11, Orsay, France, September 2005.
80. L. L. Joel Falcou and D. Etiemble. “Programmation par squelettes algorithmiques pour
le processeur CELL”. In SYMPAAA : SYMPosium en Architectures nouvelles de machines,
Fribourg, Switzerland, February 2008.
81. T. Saidani, S. Piskorski, L. Lacassagne and S. Bouaziz. “Efficient Altivec Customization
for Embedded Systems”. In ICTIS ’07 : Proceedings of the 2007 Information and Communication Technologies International Symposium, Fez, Morocco, April 2007.
82. T. Saidani, S. Piskorski, L. Lacassagne and S. Bouaziz. “Parallelization Schemes for
Memory Optimization on the Cell Processor : A Case Study of Image Processing
Algorithm”. In MEDEA ’07 : Proceedings of the 2007 workshop on MEmory performance,
Brasov, Romania, September 2007.
83. L. Duflot, D. Etiemble and O. Grumelard. “Using CPU System Management Mode to
Circumvent Operating System Security Functions”. In CanSecWest, Vancouver, Canada,
2006.
84. L. Duflot, D. Etiemble and O. Grumelard. “Utiliser les fonctionnalités des cartes mères
ou des processeurs pour contourner les mécanismes de sécurité des systèmes d’exploitation”. In SSTIC, Rennes, June 2006.
85. D. Etiemble and L. Lacassagne. “Introducing image processing and SIMD computations with FPGA soft-cores and customized instructions”. In International Workshop on
Reconfigurable Computing Education, Karshruhe, Germany, March 2006.
86. S. Pikorski, L. Lacassagne, M. Kieffer and D. Etiemble. “Efficient 16-bit floating point
interval processor for embedded systems and applications”. In SCAN, pages 141 - 144,
2006.
87. S. Piskorski, L. Lacassagne and D. Etiemble. “Instructions SIMD flottantes 16 bits pour
réduire la consommation dans les processeurs embarques à jeux d’instructions spécialisables”. In SYMPAAA : SYMPosium en Architectures nouvelles de machines, Perpignan,
October 2006.
88. D. Etiemble, S. Bouaziz and L. Lacassagne. “Customizing 16-bit floating point instructions on a NIOS II processor for FPGA image and media processing”. In IEEE Workshop
18
on Embedded Systems for Real Time Media Processing (Estimedia), Jersey City, USA, September 2005.
89. L. Lacassagne and D. Etiemble. “16-bit floating point operations for low-end and highend embedded processors”. In ODES3, San Jose, California, March 2005.
90. L. Lacassagne, D. Etiemble and S. O. Kablia. “16-bit floating point instructions for
embedded multimedia applications”. In International Workshop on Computer Architecture
for Machine Perception, July 2005.
19
Bases de données
1. N. Bidoit and D. Colazzo. “Testing XML constraint satisfiability”. Electr. Notes Theor.
Comput. Sci., 174(6) :45-61, 2008.
2. N. Bidoit and M. Objois. “Fixpoint and While temporal query languages”. accepted with
minor revision in Journal of Logic and Computation, 2008.
3. A. Analyti, M. Theodorakis, N. Spyratos and P. Constantopoulos. “Contextualization as
an independent abstraction mechanism for conceptual modeling”. Inf. Syst., 32(1) :2460, 2007.
4. Y. Tzitzikas, A. Analyti, N. Spyratos and P. Constantopoulos. “An algebra for specifying
valid compound terms in faceted taxonomies”. Data Knowl. Eng., 62(1) :1-40, 2007.
5. Y. Tzitzikas, C. Meghini and N. Spyratos. “A unified interaction scheme for information
sources”. J. Intell. Inf. Syst., 26(1) :75-93, 2006.
6. Y. Tzitzikas, A. Analyti and N. Spyratos. “Compound Term Composition Algebra : The
Semantics”. J. Data Semantics, 3360 :58-84, 2005.
7. Y. Tzitzikas, N. Spyratos and P. Constantopoulos. “Mediators over taxonomy-based information sources”. VLDB J., 14(1) :112-136, 2005.
8. D. Colazzo, G. Ghelli and C. Sartiani. “Efficient Inclusion for a Class of XML Types
with Interleaving and Counting”. Information Systems, 2008. Accepted for publication.
9. A. Frisch, G. Castagna and V. Benzaken. “Semantic Subtyping : dealing settheoretically with function, union, intersection and negation types”. Journal of the ACM
2008 to appear., 2008.
10. N. Bidoit and D. Colazzo. “Testing XML constraint satisfiability”. Electr. Notes Theor.
Comput. Sci., 174(6) :45-61, 2007.
11. M. Nguer, V. Christophides, P. Georgiadis and I. Kapantaidakis. “Efficient Rewriting
Algorithms for Preference Queries”. 2007.
12. D. Colazzo, G. Ghelli, P. Manghi and C. Sartiani. “Static analysis for path correctness
of XML queries”. Journal of Functional Programming, 16(4-5) :621-661, 2006.
13. Y. Tzitzikas, V. Christophides, G. Flouris, D. Kotzinos, H. Markkanen, D. Plexousakis and
N. Spyratos. “Trialogical E-Learning and Emergent Knowledge Artifacts”. LECTURE
NOTES IN COMPUTER SCIENCE, (4227) :703-708, 2006.
20
14. D. Colazzo and G. Ghelli. “Subtyping recursion and parametric polymorphism in kernel fun”. Information and Computation, 198(2) :71-147, 2005.
15. V. Benzaken, G. Castagna, D. Colazzo and C. Miachon. “Pattern by Example : typedriven visual programming of XML queries”. In Proceedings of the 8th International ACM
SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP, 2008.
ACM. To appear.
16. G. Castagna and K. Nguyen. “Typed Iterators for XML”. In ICFP-08, pages to appear,
2008.
17. P. Georgiadis, I. Kapantaidakis, V. Christophides, M. Nguer and N. Spyratos. “Efficient
Rewriting Algorithms for Preference Queries”. In Proceedings of the 24th International
Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, México, pages 11011110, 2008. IEEE.
18. T-Y. Jen, D. Laurent and N. Spyratos. “Mining all frequent projection-selection queries
from a relational table”. In EDBT 2008, 11th International Conference on Extending Database
Technology, Nantes, France, March 25-29, 2008, Proceedings, pages 368-379, 2008. ACM.
19. P. Michiels, I. Manolescu and C. Miachon. “Towards micro benchmarking XQuery”. In
Information Systems Journal 33(2, pages 182-202, 2008.
20. H. BelhajFrej, P. Rigaux and N. Spyratos. “Fast User Notification in Large-Scale Digital
Libraries : Experiments and Results”. In Advances in Databases and Information Systems,
11th East European Conference (ADBIS), pages 343-358, 2007.
21. N. Bidoit and F. Hantry. “Relational Temporal Machines”. In Int. Symp. on Temporal
Representation and Reasoning (TIME), pages 23-34, 2007.
22. N. Bidoit and M. Objois. “SQTL : A Preliminary Proposal for a Temporal-to-Temporal
Query Language”. In Int. Symp. on Temporal Representation and Reasoning (TIME), pages
35-46, 2007.
23. V. Benzaken, G. Castagna, D. Colazzo and K. Nguyen. “Type-Based XML Projection”.
In VLDB 2006, pages 271-282, 2006.
24. V. Benzaken, G. Castagna, D. Colazzo and K. Nguyen. “Type-Based XML Projection”.
In Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB, pages
271-282, 2006.
25. D. Colazzo and C. Sartiani. “An efficient algorithm for XML type projection”. In Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP, pages 51-60, 2006. ACM.
26. S. Guèhis, P. Rigaux and E. Waller. “Data-Driven Publication of Relational Databases”.
In Tenth International Database Engineering and Applications Symposium (IDEAS 2006), 11-14
December 2006, Delhi, India, pages 267-272, 2006.
27. N. Spyratos. “A Functional Model for Data Analysis”. In Flexible Query Answering Systems, 7th International Conference, FQAS 2006, Milan, Italy, June 7-10, 2006, Proceedings,
volume 4027 of Lecture Notes in Computer Science, pages 51-64, 2006.
28. P. Berthomé, S. Lebresne and K. Nguyen. “Computation of Chromatic Polynomials
Using Triangulations and Clique Trees”. In WG, pages 362-373, 2005.
21
29. N. Bidoit and M. Objois. “Temporal Query Languages Expressive Power : muTL vs.
T-WHILE”. In Int. Symp. on Temporal Representation and Reasoning (TIME), pages 74-82,
2005.
30. D. Colazzo and C. Sartiani. “Mapping Maintenance in XML P2P Databases”. In Database Programming Languages, 10th International Symposium, DBPL, Lecture Notes in Computer Science, pages 74-89, 2005. Springer.
31. P. Rigaux and E. Waller. “Declarative Embedding of Relational Data in Textual Documents”. In ISIP 2005, 2005.
32. N. Bidoit and M. Objois. “Machine Flux de Données : comparaison de langages de
requêtes continues”. In Bases de données Avancées, 2007.
33. N. Bidoit and D. Colazzo. “Capturing well typed references in DTDs”. In Bases de
données Avancées, 2006.
34. N. Bidoit and M. Objois. “Temporal-to-temporal query languages : a preliminary
study”. In Bases de données Avancées, 2006.
35. S. Guèhis, P. Rigaux and E. Waller. “Data-Driven Publication of Relational Databases”.
In BDA 2006, pages 1-20, 2006.
36. N. Bidoit and M. Objois. “Temporal Query Languages Expressive Power : muTL vs.
T-WHILE”. In Bases de données Avancées, 2005.
37. V. Benzaken, G. Castagna, D. Colazzo and C. Miachon. “Pattern by Example : Typedriven Visual Programming of XML Queries".” In 10th International ACM SIGPLAN
Symposium on Principles and Practice of Declarative Programming, Valencia, Spain, July 2008.
38. M. Nguer and N. Spyratos. “A User-friendly Interface for Evaluating Preference Queries Over Tabular Data”. In 26th ACM International COnference on Design of Communication (SIGDOC 2008). Lisbon, Portugal, Sept. 22-24, 2008., 2008.
39. A. Arion, V. Benzaken, I. Manolescu and Y. Papakonstantinu. “Structured Materialized
Views for XML Queries”. In 33rd International Conference on Very Large Databases (VLDB
2007), September 2007.
40. H. BelhajFrej, P. Rigaux and N. Spyratos. “Algorithmes de notification pour bibliothèques numériques”. Ingénierie des Systèmes d’Information (ISI), 12/1 :61-84, 2007.
41. N. Bidoit and F. Hantry. “Computing Data from Temporal Data”. In Atelier Représentation et Raisonnement sur le Temps et l’Espace (RTE, Plateforme AFIA), 2007.
42. Y. W. Choong, A. Giacometti, D. Laurent, P. Marcel, E. Negre and N. Spyratos. “Contextbased exploitation of data warehouses”. In 3èmes journées francophones sur les Entrepôts
de Données et l’Analyse en ligne (EDA ’07). Poitiers, 07 et 08 Juin 2007, 2007.
43. M. Doerr, C. Meghini and N. Spyratos. “Leveraging on Associations - a New Challenge
for Digital Libraries”. In First International Workshop on Digital Libraries Foundations In
conjunction with ACM IEEE Joint Conference on Digital Libraries (JCDL 2007). Vancouver,
British Columbia, Canada, June 23, 2007., 2007.
22
44. P. Georgiadis, V. Christophides and N. Spyratos. “Preference-Based Queries for Course
Sequencing”. In 10th DELOS Thematic Workshop on "Personalized Access, Profile Management, and Context Awareness in Digital Libraries" (PersDL 2007). 29-30 June 2007, Corfu,
Greece, 2007.
45. P. Georgiadis, V. Christophides and N. Spyratos. “Designing personalized curricula
based on student preferences”. In SIGDOC ’07 : Proceedings of the 25th annual ACM
international conference on Design of communication, pages 55–62, New York, NY, USA,
2007. ACM.
46. C. Meghini and N. Spyratos. “Viewing Collections as Abstractions”. In Digital Libraries :
Research and Development, First International DELOS Conference, Pisa, Italy, February 13-14,
2007, Revised Selected Papers, volume 4877 of Lecture Notes in Computer Science, pages
207-217, 2007. Springer.
47. C. Meghini and N. Spyratos. “Computing Intensions of Digital Library Collections”.
In Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand,
France, February 12-16, 2007, Proceedings, volume 4390 of Lecture Notes in Computer Science,
pages 66-81, 2007. Springer.
48. M. Nguer. “Semantics and Pragmatics of Preference Queries in Digital Libraries”.
In Research and Advanced Technology for Digital Libraries, 11th European Conference, ECDL
2007, Budapest, Hungary, September 16-21, 2007, Proceedings, volume 4675 of Lecture Notes
in Computer Science, 2007. Springer.
49. A. Arion, V. Benzaken, I. Manolescu and Y. Papakonstantinu. “Algebra-based identification of tree patterns in XQuery”. In H. L. Larsen, G. Pasi, D. Ortiz-Arroyo, T. Andreasen
and H. Christiansen, editors, Flexible Query Answering Systems : 7th International Conference, FQAS 2006,, volume 4027 of LNCS, pages 13 - 25, Milano, June 2006. Springer
Verlag.
50. H. BelhajFrej. “Personnalisation Services for Digital Libraries”. 2006.
51. H. BelhajFrej, P. Rigaux and N. Spyratos. “User notification in taxonomy based digital
libraries”. In Proceedings of the 24th Annual International Conference on Design of Communication, SIGDOC 2006, Myrtle Beach, SC, USA, October 18-20, 2006, pages 180-187, 2006.
52. H. BelhajFrej, P. Rigaux and N. Spyratos. “Matching Algorithms for User Notification
in Digital Libraries”. In 22èmes Journées Bases de Données Avancées, BDA 2006, Lille, 17-20
octobre 2006, Actes (Informal Proceedings), 2006.
53. V. Benzaken, G. Castagna, D. Colazzo and K. Nguyen. “Type-based XML projection”.
In 32nd International Conference on Very Large Databases (VLDB 2006), September 2006.
54. N. Bidoit and D. Colazzo. “Capturing well typed references in DTDs”. In 22èmes Journées Bases de Données Avancées, BDA, 2006.
55. C. Meghini, Y. Tzitzikas and N. Spyratos. “Abduction for Extending Incomplete Information Sources”. In Advances in Artificial Intelligence, 4th Helenic Conference on AI, SETN
2006, Heraklion, Crete, Greece, May 18-20, 2006, Proceedings, volume 3955 of Lecture Notes
in Computer Science, pages 267-278, 2006.
56. N. Spyratos, V. Christophides, P. Georgiadis and M. Nguer. “Semantics and Pragmatics of Preference Queries in Digital Libraries”. In Knowledge Media Science Workshop,
October 2-5, 2006, Meiningen Castle, Germany, 2006.
57. N. Spyratos and C. Meghini. “Preference-Based Query Tuning Through Refinement/Enlargement in a Formal Context”. In Foundations of Information and Knowledge
Systems, 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006,
Proceedings, volume 3861 of Lecture Notes in Computer Science, pages 278-293, 2006.
23
58. Y. Tzitzikas, V. Christophides, G. Flouris, D. Kotzinos, H. Markkanen, D. Plexousakis and
N. Spyratos. “Trialogical E-Learning and Emergent Knowledge Artifacts”. In Innovative
Approaches for Learning and Knowledge Sharing, First European Conference on Technology
Enhanced Learning, EC-TEL 2006, Crete, Greece, October 1-4, 2006, Proceedings, volume 4227
of Lecture Notes in Computer Science, pages 703-708, 2006.
59. M. Akaishi, N. Spyratos, K. Hori and Y. Tanaka. “Connecting Keywords Through Pointer Paths over the Web”. In Dagstuhl Seminar (N° 05182), Federation over the Web, May
2005, volume 3847 of Lecture Notes in Computer Science, pages 115-129, 2005.
60. M. Akaishi, N. Spyratos, K. Hori and Y. Tanaka. “Discovery of Narrativity on the WWW
Based on Perspective Information Access”. In EJC’05 : The 15th European-Japanese Conference on Information Modelling and Knowledge Bases, Tallinn, Estonia, May 16-20, 2005, 2005.
61. A. Arion, V. Benzaken and I. Manolescu. “XML Access Modules : Towards Physical
Data Independence in XML Databases”. In Proceedings f the Second International Workshop on XQuery Implementation, Experience and Perspective colocated with ACM Sigmod Pods
2005, 2005.
62. A. Arion, V. Benzaken, I. Manolescu and R. Vijay. “Uload : Choosing Right Storage for
your XML Application”. In Demonstration at the 31st International Conference on Very Large
Databases, 2005.
63. V. Benzaken, G. Castagna and C. Miachon. “A Full Pattern-Based Paradigm for XML
Query Processing.” In PADL, International Symposium on Practical Aspects of Declarative
Languages, pages 235-252, 2005.
64. G. Castagna, D. Colazzo and A. Frisch. “Error Mining for Regular Expression Patterns”.
In Theoretical Computer Science, 9th Italian Conference, ICTCS, volume 3701 of Lecture Notes
in Computer Science, 2005. Springer.
65. V. Christophides and N. Spyratos. “Quering with Preferences in a Digital Library”. In
Dagstuhl Seminar (N° 05182), Federation over the Web, May 2005, volume 3847 of Lecture
Notes in Computer Science, 2005.
66. C. T. Diop, A. Giacometti, D. Laurent and N. Spyratos. “Computation of Mining Queries : An Algebraic Approach”. In Constraint-Based Mining and Inductive Databases, European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, 2004, Revised Selected Papers, volume 3848 of Lecture Notes in Computer
Science, pages 102-126, 2005.
67. T-Y. Jen, D. Laurent, N. Spyratos and O. Sy. “Towards Mining Frequent Queries in Star
Schemes”. In Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID
2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers, volume 3933 of
Lecture Notes in Computer Science, pages 104-123, 2005.
68. T-Y. Jen, D. Laurent, N. Spyratos and O. Sy. “Mining Frequent Queries in Star
Schemes”. In Extraction et gestion des connaissances (EGC’2005), Actes des cinquièmes journées Extraction et Gestion des Connaissances, Paris, France, 18-21 janvier 2005, 2 Volumes,
volume RNTI-E-3, pages 331-342, 2005.
69. K. Keenoy, R. Poulovassilis, G. Papamarkos, P. T. Wood, V. Christophides, A. Magkanaraki, M. Stratakis, P. Rigaux and N. Spyratos. “Adaptive Personalisation in Self
e-Learning”. In eWiC - Electronic Workshops in Computing, The British Computer Society,
2005.
24
70. G. Ghelli, D. Colazzo and C. Sartiani. “Linear Time Membership for a Class of XML
Types with Interleaving and Counting”. In PLAN-X, Programming Language Technologies
for XML, An ACM SIGPLAN Workshop colocated with POPL, 2008.
71. Testing XML constraint satisfiability. 2006.
72. D. Colazzo and C. Sartiani. “Typechecking Queries for Maintaining Schema Mappings
in XML P2P Databases.” In PLAN-X, Programming Language Technologies for XML, An
ACM SIGPLAN Workshop colocated with POPL, 2005.
73. N. Bidoit, L. F. del Cerro, S. Fdida and B. Vallée. Paradigmes et enjeux de l’informatique,
Hermès, 2005.
74. H. BelhajFrej. “Personnalisation Services for Digital Libraries”. IEEE Technical Committee on Digital Libraries (TCDL) Bulletin, 2007.
75. P. Georgiadis, N. Spyratos, V. Christophides and C. Meghini. ERCIM News 66, chapter
Personalizing Digital Library Access with Preference-Based Queries, ERCIM, 2006.
76. N. Spyratos. Encyclopédie de l’informatique et des systèmes d’information, chapter Bases de
données relationnelles, Vuibert, Paris, 2006.
25
Bioinformatique
1. P. Amar, G. Legent, M. Thellier, C. Ripoll, G. Bernot, T. Nystrom, M. S. Jr and V. Norris.
“A stochastic automaton shows how enzyme assemblies may contribute to metabolic
efficiency”. BMC Systems Biology, 2(27), 2008.
2. S. Angibaud, G. Fertin, I. Rusu, A. Thévenin and S. Vialette. “Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes”. Journal of Computational Biology, 2008.
3. G. Blin, A. Denise, S. Dulucq, C. Herrbach and H. Touzet. “Alignment of RNA structures”. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2008. to appear.
4. M. Bousquet-Mélou and Y. Ponty. “Culminating paths”. Discrete Mathematics and Theoretical Computer Science, 2008. to appear.
5. I. Fagnot, G. Lelandais and S. Vialette. “Bounded List Injective Homomorphism for
Comparative Analysis of Protein-Protein Interaction Graphs”. Journal of Discrete Algorithms, 6(2) :178–191, June 2008.
6. F. Lemoine, B. Labedan and C. Froidevaux. “GenoQuery : a new querying module for
functional annotation in a genomic warehouse”. Bioinformatics, 24(13) :i322-329, 2008.
7. R. Rivière, D. Barth, J. Cohen and A. Denise. “Shuffling biological sequences with
motif constraints”. Journal of Discrete Algorithms, 6(2) :192–204, June 2008.
8. Y. Zhou, C. Lu, Q-J. Wu, Y. Wang, Z-T. Sun, J-C. Deng and Y. Zhang. “GISSD : Group I
Intron Sequence and Structure Database”. Nucleic Acids Research, (36) :D31-D37, 2008.
9. S. Angibaud, G. Fertin, I. Rusu and S. Vialette. “A General Framework for Computing
Rearrangement Distances between Genomes with Duplicates”. Journal of Computational
Biology, 14(4) :379–393, 2007.
10. J. Bernauer, J. Azé, J. Janin and A. Poupon. “A new protein-protein docking scoring
function based on interface residue properties.” Bioinformatics, (23) :555-62, 2007.
11. G. Blin, C. Chauve, G. Fertin, R. Rizzi and S. Vialette. “Comparing genomes with duplications : a computational complexity point of view”. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(4) :523–534, October 2007.
12. G. Blin, G. Fertin and S. Vialette. “Extracting Constrained 2-Interval Subsets in 2Interval Sets”. Theoretical Computer Science, 385(1-3) :241–263, 2007.
13. P. Bonizzoni, G. Della Vedova, R. Dondi, G. Fertin, R. Rizzi and S. Vialette. “Exemplar
Longest Common Subsequence”. IEEE/ACM Transactions on Computational Biology and
Bioinformatics, 4(4) :535–543, 2007.
26
14. S. Cohen-Boulakia, O. Biton, S. Cohen and S. B. Davidson. “Addressing the Provenance Challenge using ZOOM”. Concurrency and Computation : Practice and Experience,
20(5) :497-506, 2007.
15. S. Cohen-Boulakia, O. Biton, S. B. Davidson and C. Froidevaux. “BioGuideSRS : querying multiple sources with a user-centric perspective”. Bioinformatics, 23(10) :13011303, 2007.
16. S. B. Davidson, S. Cohen-Boulakia, A. Eyal, B. Ludäscher, T. M. McPhillips, S. Bowers,
M. K. Anand and J. Freire. “Provenance in Scientific Workflow Systems”. IEEE Data
Eng. Bull., 30(4) :44-50, 2007.
17. S. Descorps-Declère, F. Lemoine, Q. Sculo, O. Lespinet and B. Labedan. “The multiple
facets of homology and their use in comparative genomics to study the evolution of
genes, genomes, and species.” Biochimie, Sep 2007.
18. M. Elati, P. Neuvial, M. Bolotin-Fukuhara, E. Barillot, F. Radvanyi and C. Rouveirol.
“LICORN : learning cooperative regulation networks from gene expression data.”
Bioinformatics, 23(18) :2407-2414, 2007.
19. F. Lemoine, O. Lespinet and B. Labedan. “Assessing the evolutionary rate of positional
orthologous genes in prokaryotes using synteny data.” BMC Evol Biol, 7(1) :237, 2007.
20. O. Namy, Y. Zhou, S. Gundllapalli, C. R. Polycarpo, A. Denise, J-P. Rousset, D. Söll and
A. Ambrogelly. “Adding Pyrrolysine to the Escherichia coli genetic code”. FEBS Letters,
581(27) :5282–5288, 2007.
21. F. Lisacek, S. Cohen-Boulakia and R. D. Appel. “Proteome informatics II. Bioinformatics for comparative proteomics”. Proteomics, 20(6) :5445-66, 2006.
22. Y. Ponty, M. Termier and A. Denise. “GenRGenS : Software for Generating Random
Genomic Sequences and Structures”. Bioinformatics, 22(12) :1534–1535, June 2006.
23. P. L. Rosa, E. Viara, P. Hupé, G. Pierron, S. Liva, P. Neuvial, I. Brito, S. Lair, N. Servant,
N. Robine, E. Manié, C. Brennetot, I. Janoueix-Lerosey, V. Raynal, N. Gruel, C. Rouveirol,
N. Stransky, M-H. Stern, O. Delattre, A. Aurias, F. Radvanyi and E. Barillot. “VAMP :
visualization and analysis of array-CGH, transcriptome and other molecular profiles”.
Bioinformatics, 22(17) :2066-2073, 2006. Advance Access published on July 4.
24. C. Rouveirol, N. Stransky, P. Hupé, P. L. Rosa, E. Viara, E. Barillot and F. Radvanyi.
“Computation of recurrent minimal genomic alterations from array-CGH data”. Bioinformatics, 22(7) :849-856, 2006.
25. M. Thellier, G. Legent, P. Amar, V. Norris and C. Ripoll. “Steady-state kinetic behaviour of functioning-dependent structures”. The FEBS Journal (Federation of European
Biochemical Societies), 273 :4287–4299, 2006.
26. J. Bernauer, A. Poupon, J. Azé and J. Janin. “A docking analysis of the statistical physics
of protein-protein recognition”. Phys Biol., 2(2) :S17-23, 2005.
27. E. Nédélec, T. Moncion, E. Gassiat, B. Bossard, G. Duchateau-Nguyen, A. Denise and M.
Termier. “A pairwise alignment algorithm which favours clusters of blocks.” Journal
of Computational Biology, 12(1) :33-47, 2005.
28. W. ping Tong, Y. Zhou, X. Wang, F. Yang, K-L. Wu, J. Wu and Y. Zhang. “An accurate
quantitative method for screening effective siRNA probes targeting a Hepatitis B vi27
rus transcript in single living cells”. Biochemical and Biophysical Research Communications,
(367(4)) :866-873, 2008.
29. M. Elati, F. Radvanyi and C. Rouveirol. “Fouille de données pour l’extraction de grands
réseaux de régulation génétique”. RSTI-TSI, numéro spécial Modélisation et simulation pour
la postgénomique, 26 :173-196, 2007.
30. S. Quevillon-Cheruel, N. Leulliot, L. Gentils, H. van Tilbeurgh and A. Poupon. “Production and Crystallization of Protein Domains : How Useful are Disorder Predictions ?”
Current Protein &Peptide Science, 8(2) :151-160, 2007.
31. S. Cohen-Boulakia, S. B. Davidson, C. Froidevaux, Z. Lacroix and M-E. Vidal. “Pathbased Systems to Guide Scientists in the Maze of Biological Data Sources”. J. Bioinformatics and Computational Biology, 4(5) :1069-1096, 2006.
32. A. R. Thierry, F. Kepes, P. Amar, G. Barlovatz, G. Bernot, M. Beurton-Aimar, M. Dutreix,
J-L. Giavitto, J. Guespin, J-P. Mazat, V. Norris, V. Schächter, P. Tracqui, C. Godin and
F. Molina. “Modelling of biological complex systems in the context of genomics. An
account of a multidisciplinary thematic seminar held in Montpellier (France) in April
2005”. Journal of Biological Physics and Chemistry, 2006.
33. G. Blin, G. Fertin, R. Rizzi and S. Vialette. “What Makes the Arc-Preserving Subsequence Problem Hard ?” Transactions on Computational Systems Biology II, 3680 :1-36,
2005.
34. O. Biton, S. Cohen-Boulakia, S. B. Davidson and C. Hara. “Querying and Managing
Provenance through User Views in Scientific Workflows”. In ICDE 2008, Proc. of the
International Conference on Data Engineering, 2008. IEEE Computer Society.
35. V. Norris, A. Zemirline, P. Amar, P. Ballet, E. B. Jacob, G. Bernot, G. Beslon, E. Fanchon,
J-L. Giavitto, N. Glade, P. Greussay, Y. Grondin, J. A. Foster, G. Hutzler, F. Képès, O.
Michel, G. Misevic, F. Molina, J. Signorini, P. Stano and A. Thierry. “From bioputing to
bactoputing : computing with bacteria”. Pages 123–150, 2008.
36. S. Angibaud, G. Fertin, I. Rusu, A. Thévenin and S. Vialette. “A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes
with duplicate genes”. In G. Tesler and D. Durand, editors, 5th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG’07), volume 4751 of LNBI, pages
16–29, San Diego, USA, September 2007. Springer-Verlag.
37. M. Bouvel, D. Rossin and S. Vialette. “Longest Common Separable Pattern between
Permutations”. In Symposium on Combinatorial Pattern Matching (CPM’07), volume 4580
of LNCS, pages 316–327, London, Ontario, Canada, 2007. Springer-Verlag.
38. G. Brevier, R. Rizzi and S. Vialette. “Pattern Matching in Protein-Protein Interaction
Graphs”. In Proc. 16th International Symposium on Fundamentals of Computation Theory
(FCT), LNCS, Budapest, Hungary, 2007. Springer-Verlag.
39. G. Fertin, D. Hermelin, R. Rizzi and S. Vialette. “Common Structured Patterns in Linear
Graphs : Approximations and Combinatorics”. In B. Ma and K. Zhang, editors, 18th
Symposium on Combinatorial Pattern Matching (CPM’07), volume 4580 of LNCS, pages
241–252, London, Ontario, Canada, July 2007. Springer-Verlag.
28
40. C. Froidevaux, F. Lisacek and B. Rance. “Extracting Sequential Nuggets of Knowledge”.
In International Conference on Database and Expert Systems Applications, DEXA’07, pages
740-750, September 2007.
41. P. Gambette and S. Vialette. “On restrictions of balanced 2-interval graphs”. In A.
Brandstädt, D. Kratsch and H. Müller, editors, 33rd International Workshop on GraphTheoretic Concepts in Computer Science (WG’07), volume 4769 of LNCS, pages 55–65, Dornburg, Germany, 2007. Springer-Verlag.
42. D. Hermelin, M. Fellows, G. Fertin and S. Vialette. “Sharp Tractability Borderlines for
Finding Connected Motifs in Vertex-Colored Graphs”. In 34th (ICALP’07), volume 4596
of LNCS, pages 340–351, Wroclaw, Poland, 2007. Springer-Verlag.
43. D. Hermelin, D. Rawitz, R. Rizzi and S. Vialette. “The Minimum Substring Cover Problem”. In C. Kaklamanis and M. Skutella, editors, 5th Workshop on Approximation and
Online Algorithms (WAOA’07), volume 4927 of Lecture Notes in Computer Science, pages
170–183, Eilat, Israel, 2007. Springer-Verlag.
44. V. Norris, P. Amar, M. Thellier, G. Legent, A. Cabin, J-C. Plaquevent, M. S. jnr, G. Bernot,
G. Misevic and C. Ripoll. “Hybolites : novel therapeutical tools based on stochastic
automata”. Pages 83–88, 2007.
45. V. Norris, L. Janniere and P. Amar. “Hypothesis : Variations in the rate of DNA replication determine the phenotype of daughter cells”. Pages 71–82, 2007.
46. S. Angibaud, G. Fertin, I. Rusu and S. Vialette. “How Pseudo-boolean Programming
Can Help Genome Rearrangement Distance Computation”. In 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG’06), LNBI, pages 75–86, Montreal,
Canada, 2006. Springer-Verlag.
47. P. Bonizzoni, G. Della Vedova, R. Dondi, G. Fertin and S. Vialette. “Exemplar Longest
Common Subsequences”. In Int. Workshop on Bioinformatics Research and Applications (IWBRA), volume 3992 of LNCS, pages 622–629, 2006.
48. C. Chauve, G. Fertin, R. Rizzi and S. Vialette. “Genomes containing duplicates are hard
to compare”. In Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA),
volume 3992 of LNCS, pages 783–790, Reading, UK, 2006. Springer-Verlag.
49. S. Cohen, S. Cohen-Boulakia and S. B. Davidson. “A User-centric Framework for Accessing Biological Sources and Tools”. In DILS’06, Data Integration in the Life Sciences,
Lecture Notes in Computer Science (LNCS) series, LNBI, volume 4075, pages 264-279, 2006.
Springer.
50. S. Cohen-Boulakia, C. Froidevaux and E. Pietriga. “Selecting Biological Data Sources
and Tools with XPR, a Path Language for RDF”. In PSB 2006, Pacific Symposium on
Biocomputing, pages 116-127, 2006. World Scientific.
51. A. Denise, M-C. Gaudel, S-D. Gouraud, R. Lassaigne and S. Peyronnet. “Uniform random sampling of traces in very large models”. In Proceedings of the First International
Workshop on Random Testing (RT 2006), 2006.
52. M. Kubica, R. Rizzi, S. Vialette and T. Waleń. “Approximation of RNA Multiple Structural Alignment”. In M. Lewenstein and G. Valiente, editors, 17th Symposium on Combinatorial Pattern Matching (CPM’06), volume 4009 of LNCS, pages 211-222, Barcelona,
Spain, 2006. Springer-Verlag.
53. G. Blin, G. Fertin, D. Hermelin and S. Vialette. “Fixed-Parameter Algorithms for Protein
Similarity Search”. In D. Kratsch, editor, 31st International Workshop on Graph-Theoretic
Concepts in Computer Science (WG’05), volume 3787 of LNCS, pages 271–282, Metz, France,
June 2005. Springer-Verlag.
29
54. G. Blin, G. Fertin, R. Rizzi and S. Vialette. “What Makes the Arc-Preserving Subsequence Problem Hard ?” In V. S Sunderam, G. D. van Albada, P. M A Sloot and J. Dongarra, editors, 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA’05),
volume 3515 of LNCS, pages 860–868, Atlanta, GA, USA, May 2005. Springer-Verlag.
55. S. Cohen-Boulakia, S. B. Davidson and C. Froidevaux. “A User-centric Framework for
Accessing Biological Sources and Tools”. In DILS’05, Data Integration in the Life Sciences,
Lecture Notes in Computer Science (LNCS) series, LNBI, volume 3615, pages 3-18, 2005.
Springer.
56. M. Crochemore, D. Hermelin, G. M. Landau and S. Vialette. “Approximating the 2Interval Pattern Problem”. In G. S. Brodal and S. Leonardi, editors, 13th Annual European
Symposium on Algorithms (ESA’05), volume 3669 of LNCS, pages 426–437, Mallorca, Spain,
2005. Springer-Verlag.
57. G. Fertin, R. Rizzi and S. Vialette. “Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs”. In International Symposium on
Mathematical Foundations of Computer Science (MFCS’05), volume 3618 of LNCS, pages
328–339, Gdansk, Poland, 2005. Springer-Verlag.
58. M. Djelloul and A. Denise. “A method for automated discovering of RNA tertiary motifs”. In Actes des Journées Ouvertes de Biologie, Informatique et Mathématiques - JOBIM’08,
pages 47–52, 2008.
59. C. Froidevaux and F. Lemoine. “Requêtes alternatives dans le contexte d’un entrepôt
de données génomiques”. In Extraction et Gestion des Connaissances (EGC’2008), pages
61-72, 2008.
60. L. Gentils, J. Azé, C. Toffano-Nioche, V. Loux, A. Poupon, J-F. Gibrat and C. Froidevaux.
“Mesures Hiérarchiques pondérées pour l’évaluation d’ un système semi-automatique
d’annotation de génomes utilisant des arbres de décision”. In Extraction et Gestion des
Connaissances (EGC’2008), volume 1, pages 133-138, 2008.
61. M. Elati, P. Neuvial, C. Rouveirol, F. Radvanyi and E. Barillot. “A methodology for discovering cooperative regulatory pattern from ternary gene expression data”. In 9ème
Conférence francophone d’Apprentissage automatique (CAP), Plate-forme AFIA, pages 91-106,
Grenoble, 2007.
62. M. Elati, F. Radvanyi and C. Rouveirol. “Modelling and mining transcriptional regulation from expression data”. In Actes Journées Ouvertes Biologie Informatique Mathématiques
(JOBIM), pages 146-156, Lyon, 2005.
63. M. Elati, C. Rouveirol and F. Radvanyi. “Apprentissage de signatures de facteurs de
transcription à partir de données d’expression”. RNTI, pages 667-672, 2005.
64. J. Azé, L. Gentils, C. Toffano-Nioche, V. Loux, J-F. Gibrat, P. Bessières, C. Rouveirol, A.
Poupon and C. Froidevaux. “Towards a semi-automatic functional annotation tool based on decision tree techniques”. In Proceedings of the international Workshop on Machine
Learning in Systems Biology 2007 (MLSB’07), pages 15-20, 2007.
30
65. J. Azé, P. Lenca, S. Lallich and B. Vaillant. “A study of the robustness of association
rules”. In S. F. C. R Stahlbock and C. P. S Lessmann, editors, The 2007 International
Conference on Data Mining (DMIN’07), pages 132-137, 2007.
66. G. Blin, G. Fertin, G. Herry and S. Vialette. “Comparing RNA structures : towards an
intermediate model between the EDIT and the LAPCS problems”. In M-F. Sagot and
M. E. Telles Walter, editors, 1st Brazilian Symposium on Bioinformatics (BSB’07), volume
4643 of Lecture Notes in Bioinformatics, pages 101–112, Angra dos Reis, Brazil, August
67. R. Dondi, G. Fertin and S. Vialette. “Weak pattern matching in colored graphs : Minimizing the number of connected components”. In 10th (ICTCS’07), World Scientific,
pages 27–38, Roma, Italy, 2007.
68. C. Herrbach, A. Denise and S. Dulucq. “Average complexity of the Jiang-Wang-Zhang
pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm”. In Proceedings of MACIS 2007, Second International Conference on Mathematical
Aspects of Computer and Information Sciences, 2007.
69. T. Moncion, G. Hutzler and P. Amar. “Verification of Biochemical Agent-Based Models
Using Petri Nets”. In T. Robert, editor, International Symposium on Agent Based Modeling and Simulation, ABModSim’06, pages 695-700, 2006. Austrian Society for Cybernetics
Studies.
70. R. Rivière, D. Barth and A. Denise. “Algorithmes d’énumération de motifs dans les
réseaux biologiques”. In Proc. RIAMS 2006, Journée Réseaux d’interactions : analyse, modélisation et simulation, November 2006.
71. P. Amar, V. Norris, M. S. jnr and G. Bernot. “Metabolons and hyperstructures in cell
metabolism and signaling”. In Actes du colloque 4th World Congress of Cell and Molecular
Biology, 2005.
72. L. Calzone, N. Chabrier-Rivier, F. Fages, L. Gentils and S. Soliman. “Machine learning
bio-molecular interactions from temporal logic properties”. In G. Plotkin, editor, CMSB’05 : Proceedings of the third international conference on Computational Methods in Systems
Biology, 2005.
73. M. Elati, F. Radvanyi and C. Rouveirol. “Mining transcriptional regulatory logic from
expression data”. In 3th Conference of the Integrative Post-Genomic, IPG’05, Lyon, 2005.
74. C. Herrbach and S. Vialette. “Linear graph non-crossing structural alignment under the
RNA stacking-pair scoring scheme”. In 2nd Conference on Algorithms and Computational
Methods for biochemical and Evolutionary Networks (CompBioNets’05), Lyon, France, 2005.
Kingś College London publications.
75. T. Moncion, G. Hutzler and P. Amar. “Validation d’une simulation à base d’agents par
l’utilisation d’un réseau de Petri”. In D. Alexis and R. Eric, editors, Systèmes multi-agents
vers la conception de systèmesartificiels socio-mimétiques (JFSMA 2005), pages 187–190, 2005.
Hermès Lavoisier.
76. C. Rouveirol and F. Radvanyi. “Local pattern discovery in array-CGH data_Local Pattern Detection”. In Local Pattern Detection, actes de 2004 LNCS(), volume 3539, pages
135-152, 2005. LNCS Springer.
31
77. J. Allali, Y. d’Aubenton Carafa, C. Chauve, A. Denise, C. Drevet, P. Ferraro, D. Gautheret, C. Herrbach, F. Leclerc, A. de Monte, A. Ouangraoua, M-F. Sagot, C. Saule, M.
Termier, C. Thermes and H. Touzet. “Benchmarking RNA secondary structure comparison algorithms”. In Actes des Journées Ouvertes de Biologie, Informatique et Mathématiques
- JOBIM’08, pages 67–68, 2008.
78. A. Angibaud, G. Fertin, I. Rusu, A. Thévenin and S. Vialette. “Efficient tools for computing distances between two genomes with duplicate genes”. In Actes des Journées
Ouvertes de Biologie, Informatique et Mathématiques - JOBIM’08, pages 153–154, 2008.
79. D. Barth, A. Denise, A. Lamiable, F. Quessette and S. Vial. “Classification automatique
en famille des jonctions triples de l’ARN”. In Actes des Journées Ouvertes de Biologie,
Informatique et Mathématiques - JOBIM’08, pages 65–66, 2008.
80. J. Azé. “A clustering approach for analysing association rules”. In ASMDA’07, International Symposium on Applied Stochastic Models and Data Analysis, special session "Quality
Measures in Data Mining", 2007.
81. O. Biton, S. Cohen-Boulakia and S. B. Davidson. “Zoom*UserViews : Querying Relevant
Provenance in Workflow Systems”. In VLDB 2007, Proc. of the International Conference on
Very Large Data Bases, pages 1366-1369, 2007. ACM. demo, abstract.
82. F. Lemoine, O. Lespinet and B. Labedan. “From genomics to systems biology : playing
with the evolution of synteny blocks in microbial genomes”. In Journées Ouvertes de
Biologie, Informatique et Mathématiques JOBIM, 2007. Poster, abstract.
83. F. Lemoine, E. Coissac, A. Morgat, B. Labedan and C. Froidevaux. “Screening functional
genomics data by querying a data-warehouse”. In DILS 2007, 2007. Poster, abstract.
84. B. Rance, F. Lisacek and C. Froidevaux. “Discovering relevant sequential associations
between heterogeneous features of proteins”. In The Data Integration in the Life Sciences
Workshop 2007, 2007. poster/demo, abstract.
85. L. Gentils, J. Azé, P. Bessières, J-F. Gibrat, V. Loux, C. Rouveirol and C. Froidevaux.
“Learning Rules for Microbial Genome Annotation”. In Automated Function Prediction,
2006, pages 82-83, San Diego, CA, USA, 2006. poster, abstract.
86. F. Lemoine, O. Lespinet and B. Labedan. “Analyse du contexte génétique chez les procaryotes”. In Alphy/GTGC, 2006.
87. F. Lemoine, O. Lespinet and B. Labedan. “Analyzing gene context to better understand
the evolutionary mechanisms underlying gene order conservation in prokaryotes”. In
Journées Ouvertes de Biologie, Informatique et Mathématiques, 2006. Poster, abstract.
88. V. Norris, P. Amar, M. Thellier, G. Legent, A. Cabin, J-C. Plaquevent, M. S. jnr, G. Bernot,
G. Misevic and C. Ripoll. “Integrative biology applied to bacterial disease : hyperstructures and hybolites”. In BioVision Alexandria New Life Sciences : Changing Lives, 2006.
89. Y. Ponty, M. Termier and A. Denise. “Generating Random Genomic Sequences and
Structures with GenRGenS”. In Actes des Journées Ouvertes de Biologie, Informatique et
Mathématiques - JOBIM’06, July 2006.
90. T. Moncion, G. Hutzler and P. Amar. “Validation of an Agent Based System Using
Petri Nets”. In F. Dignum, V. Dignum, S. Koenig, S. Kraus, M. Pechoucek, M. Singh, D.
Steiner, S. Thompson and M. Wooldridge, editors, Proceedings of the Fourth International
Joint Conference on Autonoumous Agents and Multi Agent Systems, pages 1365-1366, New
York, 2005. ACM Press.
32
91. M. Thellier, C. Ripoll, P. Amar, G. Legent and V. Norris. “Functioning-dependent structures”. In Actes du colloque European Conference on Complex Systems, 2005.
Chapitres d’ouvrages : 1
92. I-C. Lerman and J. Azé. A New Probabilistic Measure of Interestingness for Association Rules,
Based on the Likelihood of the Link, Chapitre de Quality Measures in Data Mining, pages 207236, Springer, 2006.
93. P. Amar, F. Képès, V. Norris and B. Vandenbunder. Proceedings of the Lille 2008 spring
school on Modelling Complex Biological Systems in the context of genomics, EDP Sciences,
2008.
94. A. Bairoch, S. Cohen-Boulakia and C. Froidevaux, editors. Selected Proceedings of DILS
2008, 5th International Workshop in Data Integration in the Life Sciences, Evry,France. BMC
Bioinformatics Journal, Vol. 9, Suppl.8, 2008.
95. A. Bairoch, S. Cohen-Boulakia and C. Froidevaux, editors. Proceedings of DILS 2008, 5th
International Workshop in Data Integration in the Life Sciences, Evry,France. Lecture Notes
in Bioinformatics, Vol. 5109, Springer-Verlag, 2008.
96. P. Amar, F. Képès, V. Norris and G. Bernot. Proceedings of the Evry 2007 spring school on
Modelling Complex Biological Systems in the context of genomics, EDP Sciences, 2007.
97. S. Cohen-Boulakia and V. Tannen, editors. Proceedings of DILS 2007, 4th International
Workshop in Data Integration in the Life Sciences, Philadelphie, USA. Lecture Notes in Bioinformatics, Vol. 4544, Springer-Verlag, 2007.
98. P. Amar, F. Képès, V. Norris, M. Beurton-Aimar and J-P. Mazat. Proceedings of the Bordeaux spring school on Modelling Complex Biological Systems in the context of genomics, EDP
Sciences, 2006.
99. A. Denise, P. Durrens, S. Robin, E. Rocha, A. de Daruvar and A. Groppi, editors. Proceedings of JOBIM 2006. 2006.
100. P. Amar, F. Képès, F. Molina and V. Norris. Proceedings of the Montpellier spring school on
Modelling Complex Biological Systems in the context of genomics, EDP Sciences, 2005.
101. C. Herrbach. “Etude algorithmique et statistique de la comparaison de structures secondaires d’ARN”. Université Bordeaux 1, 2007. Thèse soutenue le 26 septembre.
102. Y. Ponty. “Modélisation de séquences génomiques structurées, génération aléatoire
et applications”. Université Paris-Sud, Faculté des Sciences, 2006. Thèse soutenue le 29
Novembre.
103. S. Cohen-Boulakia. “Intégration de données biologiques :Sélection de sources centrée
sur l’utilisateur”. Université Paris-Sud 11, 2005. Thèse soutenue le 9 Décembre.
33
104. J-P. Forest. “Modélisation et détection automatique de sites de décalage de cadre en -1
dans les génomes eucaryotes”. Université Paris-Sud 11, 2005. Thèse soutenue le 30 juin.
105. R. Rivière. “Algorithmes de graphes pour l’analyse de séquences et structures génomiques”. 2005.
106. B. Rance, F. Lisacek and C. Froidevaux. “An Algorithm for Mining Minimal Sequential
Nuggets of Knowledge”. Technical Report, 2007.
107. C. Herrbach, A. Denise, S. Dulucq and H. Touzet. “Alignment of RNA secondary structures using a full set of operations”. Technical Report, 2006. Rapport de Recherche LRI
n 1451.
108. Y. Ponty and A. Denise. “GenRGenS v2.0 User Manual”. Technical Report 1447, Rapport
de recherche du Laboratoire de Recherche en Informatique (LRI), April 2006.
34
Démonstration et programmation
1. P. Audebaud and C. Paulin-Mohring. “Proofs of Randomized Algorithms in Coq”.
Science of Computer Programming, 2008.
2. D. Biernacki, O. Danvy and K. Millikin. “A Dynamic Continuation-Passing Style for
Dynamic Delimited Continuations”. Transactions on Programming Languages and Systems,
2008. To appear. Available as BRICS technical report BRICS RS-06-15, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, October 2006..
3. S. Boldo. “Kahan’s algorithm for a correct discriminant computation at last formally
proven”. IEEE Transactions on Computers, September 2008.
4. S. Boldo, M. Daumas and R-C. Li. “Formally Verified Argument Reduction with a
Fused-Multiply-Add”. IEEE Transactions on Computers, September 2008.
5. S. Boldo and G. Melquiond. “Emulation of FMA and Correctly-Rounded Sums : Proved
Algorithms Using Rounding to Odd”. IEEE Transactions on Computers, 57(4) :462–471,
2008.
6. H. Brönnimann, G. Melquiond and S. Pion. “The design of the Boost interval arithmetic
library”. Theoretical Computer Science, 351 :111–118, 2006.
7. S. Conchon and S. Krstić. “Strategies for Combining Decision Procedures”. Theoretical
Computer Science, 354(2) :187–210, 2006. Special Issue of TCS dedicated to a refereed
selection of papers presented at TACAS’03.
8. J-C. Filliâtre. “Formal Proof of a Program : Find”. Science of Computer Programming,
64 :332–240, 2006.
9. A. Girault, X. Nicollin and M. Pouzet. “Automatic Rate Desynchronization of Embedded Reactive Programs”. ACM Transactions on Embedded Computing Systems (TECS), 5(3),
2006.
10. E. Contejean, C. Marché, A. P. Tomás and X. Urbain. “Mechanically proving termination
using polynomial interpretations”. Journal of Automated Reasoning, 34(4) :325–363, 2005.
11. S. Krstić and S. Conchon. “Canonization for disjoint unions of theories”. Information
and Computation, 199(1-2) :87–106, May 2005.
12. S. Lucas, C. Marché and J. Meseguer. “Operational Termination of Conditional Term
Rewriting Systems”. Information Processing Letters, 95 :446–453, 2005.
35
13. F. Durán, S. Lucas, J. Meseguer, C. Marché and X. Urbain. “Proving Operational Termination of Membership Equational Programs”. Higher-Order and Symbolic Computation,
21(1–2) :59–88, 2008.
14. L. Mandel and M. Pouzet. “ReactiveML : un langage fonctionnel pour la programmation réactive”. Technique et Science Informatiques (TSI), 2008. To appear.
15. G. Melquiond and S. Pion. “Formally certified floating-point filters for homogeneous
geometric predicates”. Theoretical Informatics and Applications, 41(1) :57–70, 2007.
Conférences invitées dans un congrès national ou international : 2
16. J-C. Filliâtre. “Using SMT solvers for deductive verification of C and Java programs”.
In C. Barrett and L. de Moura, editors, SMT 2008 : 6th International Workshop on Satisfiability Modulo, Princeton, USA, 2008.
17. C. Marché. “Jessie : an intermediate Language for Java and C Verification”. In PLPV
’07 : Proceedings of the 2007 workshop on Programming Languages meets Program Verification,
pages 1–2, Freiburg, Germany, 2007. ACM.
18. D. Biernacki, J-L. Colaço, G. Hamon and M. Pouzet. “Clock-directed Modular Code
Generation of Synchronous Data-flow Languages”. In ACM International Conference on
Languages, Compilers, and Tools for Embedded Systems (LCTES), Tucson, Arizona, June 2008.
19. S. Boldo, M. Daumas and P. Giorgi. “Formal proof for delayed finite field arithmetic
using floating point operators”. In Proceedings of the 8th Conference on Real Numbers and
Computers, Santiago de Compostela, Spain, July 2008.
20. S. Conchon, E. Contejean, J. Kanig and S. Lescuyer. “CC(X) : Semantical Combination
of Congruence Closure with Solvable Theories”. In Proceedings of the 5th International
Workshop on Satisfiability Modulo Theories (SMT 2007), volume 192 of Electronic Notes in
Computer Science, pages 51–69, 2008. Elsevier Science Publishers.
21. S. Conchon and J-C. Filliâtre. “Semi-Persistent Data Structures”. In 17th European Symposium on Programming (ESOP’08), Budapest, Hungary, April 2008.
22. S. Conchon, J-C. Filliâtre and J. Signoles. “Designing a Generic Graph Library using
ML Functors”. In M. Morazán, editor, Trends in Functional Programming, volume 8, 2008.
Intellect.
23. G. Delaval, A. Girault and M. Pouzet. “A Type System for the Automatic Distribution
of Higher-order Synchronous Dataflow Programs”. In ACM International Conference on
Languages, Compilers, and Tools for Embedded Systems (LCTES), Tucson, Arizona, June 2008.
24. L. Mandel and L. Maranget. “Programming in JoCaml (Tool Demonstration)”. In 17th
European Symposium on Programming (ESOP’08), pages 108–111, Budapest, Hungary,
April 2008.
36
25. L. Mandel and F. Plateau. “Interactive Programming of Reactive Systems”. In Proceedings of Model-driven High-level Programming of Embedded Systems (SLA++P’08), Electronic Notes in Computer Science, pages 44–59, Budapest, Hungary, April 2008. Elsevier
Science Publishers. to appear.
26. G. Melquiond. “Proving bounds on real-valued functions with computations”. In A.
Armando, P. Baumgartner and G. Dowek, editors, Proceedings of the 4th International Joint
Conference on Automated Reasoning, Lecture Notes in Computer Science, Sydney, Australia, 2008.
27. G. Melquiond. “Floating-point arithmetic in the Coq system”. In Proceedings of the 8th
Conference on Real Numbers and Computers, Santiago de Compostela, Spain, 2008.
28. Y. Moy. “Sufficient Preconditions for Modular Assertion Checking”. In F. Logozzo, D.
Peled and L. Zuck, editors, 9th International Conference on Verification, Model Checking, and
Abstract Interpretation, volume 4905 of Lecture Notes in Computer Science, pages 188–202,
San Francisco, California, USA, January 2008. Springer.
29. M. Sozeau and N. Oury. “First-Class Type Classes”. In S. Tahar, O. Ait-Mohamed and
C. Muñoz, editors, 21th International Conference on Theorem Proving in Higher Order Logics,
Lecture Notes in Computer Science, August 2008. Springer.
30. S. Boldo and J-C. Filliâtre. “Formal Verification of Floating-Point Programs”. In 18th
IEEE International Symposium on Computer Arithmetic, pages 187-194, Montpellier, France,
June 2007.
31. E. Contejean, P. Courtieu, J. Forest, O. Pons and X. Urbain. “Certification of automated
termination proofs”. In B. Konev and F. Wolter, editors, 6th International Symposium
on Frontiers of Combining Systems (FroCos 07), volume 4720 of Lecture Notes in Artificial
Intelligence, pages 148–162, Liverpool,UK, September 2007. Springer.
32. J-F. Couchot and F. Dadeau. “Guiding the Correction of Parameterized Specifications”.
In Integrated Formal Methods, volume 4591 of Lecture Notes in Computer Science, pages
176–194, Oxford, UK, July 2007. Springer.
33. J-F. Couchot and S. Lescuyer. “Handling Polymorphism in Automated Deduction”. In
21th International Conference on Automated Deduction (CADE-21), volume 4603 of LNCS
(LNAI), pages 263–278, Bremen, Germany, July 2007.
34. J-C. Filliâtre and C. Marché. “The Why/Krakatoa/Caduceus Platform for Deductive
Program Verification”. In W. Damm and H. Hermanns, editors, 19th International Conference on Computer Aided Verification, volume 4590 of Lecture Notes in Computer Science,
pages 173–177, Berlin, Germany, July 2007. Springer.
35. S. Labbé, J-P. Gallois and M. Pouzet. “Slicing Communicating Automata Specifications
For Efficient Model Reduction”. In 18th Australian Conference on Software Engineering
(ASWEC), 2007.
36. C. Marché and H. Zantema. “The Termination Competition”. In F. Baader, editor, 18th
International Conference on Rewriting Techniques and Applications (RTA’07), volume 4533 of
Lecture Notes in Computer Science, pages 303–313, Paris, France, June 2007. Springer.
37. L. Morel and L. Mandel. “Executable Contracts for Incremental Prototypes of Embedded Systems”. In Formal Foundations of Embedded Software and Component-Based Software
Architectures (FESCA’07), pages 123–136, March 2007. Elsevier Science Publishers. to appear.
38. M. Sozeau. “Program-ing Finger Trees in Coq”. In R. Hinze and N. Ramsey, editors,
12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, pages
13–24, Freiburg, Germany, 2007. ACM Press.
37
39. M. Sozeau. “Subset coercions in Coq”. In T. Altenkirch and C. M. Bride, editors, TYPES
2006, volume 4502 of Lecture Notes in Computer Science, pages 237–252, 2007. Springer.
40. P. Audebaud and C. Paulin-Mohring. “Proofs of Randomized Algorithms in Coq”. In
T. Uustalu, editor, Mathematics of Program Construction, MPC 2006, volume 4014 of Lecture
Notes in Computer Science, Kuressaare, Estonia, July 2006. Springer.
41. S. Boldo. “Pitfalls of a full floating-point proof : example on the formal proof of the
Veltkamp/Dekker algorithms”. In U. Furbach and N. Shankar, editors, Third International Joint Conference on Automated Reasoning, volume 4130 of Lecture Notes in Computer
Science, pages 52-66, Seattle, USA, August 2006. Springer.
42. S. Boldo and C. Muñoz. “Provably Faithful Evaluation of Polynomials”. In Proceedings
of the 21st Annual ACM Symposium on Applied Computing, volume 2, pages 1328-1332,
Dijon, France, April 2006.
43. A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau and M. Pouzet. “NSynchronous Kahn Networks : a Relaxed Model of Synchrony for Real-Time Systems”. In ACM International Conference on Principles of Programming Languages (POPL’06),
Charleston, South Carolina, USA, January 2006.
44. J-L. Colaço, G. Hamon and M. Pouzet. “Mixing Signals and Modes in Synchronous
Data-flow Systems”. In ACM International Conference on Embedded Software (EMSOFT’06),
Seoul, South Korea, October 2006.
45. N. Halbwachs and L. Mandel. “Simulation and verification of asynchronous systems
by means of a synchronous model”. In Sixth International Conference on Application of
Concurrency to System Design (ACSD’06), pages 3–14, Turku, Finland, June 2006.
46. C. Marché and N. Rousset. “Verification of Java Card Applets Behavior with respect
to Transactions and Card Tears”. In D. V. Hung and P. Pandya, editors, 4th IEEE International Conference on Software Engineering and Formal Methods (SEFM’06), Pune, India,
September 2006. IEEE Comp. Soc. Press.
47. J. Andronick, B. Chetali and C. Paulin-Mohring. “Formal Verification of Security Properties of Smart Card Embedded Source Code”. In J. Fitzgerald, I. J. Hayes and A.
Tarlecki, editors, International Symposium of Formal Methods Europe (FM’05), volume 3582
of Lecture Notes in Computer Science, Newcastle,UK, July 2005. Springer.
48. S. Boldo and J-M. Muller. “Some Functions Computable with a Fused-mac”. In P. Montuschi and E. Schwarz, editors, Proceedings of the 17th Symposium on Computer Arithmetic,
pages 52-58, Cape Cod, USA, 2005.
49. A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau and M. Pouzet. “Synchroning
Periodic Clocks”. In ACM International Conference on Embedded Software (EMSOFT’05),
Jersey city, New Jersey, USA, September 2005.
50. J-L. Colaço, B. Pagano and M. Pouzet. “A Conservative Extension of Synchronous Dataflow with State Machines”. In ACM International Conference on Embedded Software (EMSOFT’05), Jersey city, New Jersey, USA, September 2005.
51. E. Contejean and P. Corbineau. “Reflecting Proofs in First-Order Logic with Equality”.
In R. Nieuwenhuis, editor, 20th International Conference on Automated Deduction (CADE20), volume 3632 of Lecture Notes in Artificial Intelligence, pages 7–22, Tallinn, Estonia,
July 2005. Springer.
52. M. Daumas, G. Melquiond and C. Muñoz. “Guaranteed proofs using interval arithmetic”. In P. Montuschi and E. Schwarz, editors, Proceedings of the 17th IEEE Symposium on
Computer Arithmetic, pages 188–195, Cape Cod, Massachusetts, USA, 2005.
38
53. T. Hubert and C. Marché. “A case study of C source code verification : the Schorr-Waite
algorithm”. In B. K. Aichernig and B. Beckert, editors, 3rd IEEE International Conference
on Software Engineering and Formal Methods (SEFM’05), Koblenz, Germany, September
2005. IEEE Comp. Soc. Press.
54. L. Mandel and F. Benbadis. “Simulation of Mobile Ad hoc Network Protocols in
ReactiveML”. In Proceedings of Synchronous Languages, Applications, and Programming
(SLAP’05), Edinburgh, Scotland, April 2005. Elsevier Science Publishers.
55. L. Mandel and M. Pouzet. “ReactiveML, a Reactive Extension to ML”. In ACM International Conference on Principles and Practice of Declarative Programming (PPDP), pages 82–93,
Lisboa, July 2005.
56. C. Marché and C. Paulin-Mohring. “Reasoning about Java Programs with Aliasing and
Frame Conditions”. In J. Hurd and T. Melham, editors, 18th International Conference on
Theorem Proving in Higher Order Logics, volume 3603 of Lecture Notes in Computer Science,
pages 179–194, August 2005. Springer.
57. N. Oury. “Extensionality in the Calculus of Constructions”. In J. Hurd and T. Melham,
editors, 18th International Conference on Theorem Proving in Higher Order Logics, volume
3603 of Lecture Notes in Computer Science, pages 278–293, August 2005. Springer.
58. S. Conchon, E. Contejean, J. Kanig and S. Lescuyer. “Lightweight Integration of the
Ergo Theorem Prover inside a Proof Assistant”. In J. Rushby and N. Shankar, editors,
AFM07 (Automated Formal Methods), 2007. ACM Press.
59. J. Andronick and B. Chetali. “An Environment for Securing Smart Cards Embedded C
Code”. In International Conference on Research in Smart Cards (Esmart’06), 2006.
60. H. Brönnimann, G. Melquiond and S. Pion. “Proposing Interval Arithmetic for the C++
Standard”. In Proceedings of the 12th GAMM - IMACS International Symposium on Scientific
Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
61. L. Samper, F. Maraninchi, L. Mounier and L. Mandel. “GLONEMO : Global and Accurate Formal Models for the Analysis of Ad hoc Sensor Networks”. In Proceedings of the
First International Conference on Integrated Internet Ad hoc and Sensor Networks (InterSense’06), Nice, France, May 2006. ACM.
62. S. Boldo and G. Melquiond. “When double rounding is odd”. In Proceedings of the 17th
IMACS World Congress on Computational and Applied Mathematics, Paris, France, 2005.
63. G. Melquiond and S. Pion. “Formal certification of arithmetic filters for geometric predicates”. In Proceedings of the 17th IMACS World Congress on Computational and Applied
Mathematics, Paris, France, 2005.
64. R. Bardou. “Ownership, Pointer Arithmetic and Memory Separation”. In Formal Techniques for Java-like Programs (FTfJP’08), Paphos, Cyprus, July 2008.
65. F. Bobot, S. Conchon, E. Contejean and S. Lescuyer. “Implementing Polymorphism in
SMT solvers”. In C. Barrett and L. de Moura, editors, SMT 2008 : 6th International Workshop on Satisfiability Modulo, 2008.
39
66. S. Conchon, J. Kanig and S. Lescuyer. “SAT-MICRO : petit mais costaud !” In Dixneuvièmes Journées Francophones des Langages Applicatifs, Étretat, France, January 2008.
INRIA.
67. J-C. Filliâtre. “Gagner en passant à la corde”. In Dix-neuvièmes Journées Francophones des
Langages Applicatifs, Étretat, France, January 2008. INRIA.
68. M. Biernacka and D. Biernacki. “Formalizing Constructions of Abstract Machines for
Functional Languages in Coq”. In 7th International Workshop on Reduction Strategies in
Rewriting and Programming (WRS 2007), pages 84–99, Paris, France, June 2007.
69. D. Biernacki, J-L. Colaço and M. Pouzet. “Clock-directed Modular Code Generation
from Synchronous Block Diagrams”. In Workshop on Automatic Program Generation for
Embedded Systems (APGES 2007), Salzburg, Austria, October 2007.
70. S. Conchon, E. Contejean and J. Kanig. “CC(X) : Efficiently Combining Equality and
Solvable Theories without Canonizers”. In S. Krstic and A. Oliveras, editors, SMT 2007 :
5th International Workshop on Satisfiability Modulo, 2007.
71. S. Conchon and J-C. Filliâtre. “A Persistent Union-Find Data Structure”. In ACM SIGPLAN Workshop on ML, pages 37–45, Freiburg, Germany, October 2007. ACM.
72. S. Conchon and J-C. Filliâtre. “Union-Find Persistant”. In Dix-huitièmes Journées Francophones des Langages Applicatifs, pages 135–149, January 2007. INRIA.
73. S. Conchon, J-C. Filliâtre and J. Signoles. “Designing a Generic Graph Library using
ML Functors”. In M. T. Morazán and H. Nilsson, editors, The Eighth Symposium on Trends
in Functional Programming, volume TR-SHU-CS-2007-04-1, pages XII/1–13, New York,
USA, April 2007. Seton Hall University.
74. J-F. Couchot and T. Hubert. “A Graph-based Strategy for the Selection of Hypotheses”.
In FTP 2007 - International Workshop on First-Order Theorem Proving, Liverpool, UK, September 2007.
75. J-C. Filliâtre. “Formal Verification of MIX Programs”. In Journées en l’honneur de Donald
E. Knuth, Bordeaux, France, October 2007. http ://knuth07.labri.fr/exposes.php.
76. T. Hubert and C. Marché. “Separation Analysis for Deductive Verification”. In
Heap Analysis and Verification (HAV’07), pages 81–93, Braga, Portugal, March 2007.
http ://www.lri.fr/ marche/hubert07hav.pdf.
77. C. Marché, H. Zantema and J. Waldmann. “The Termination Competition 2007”.
In D. Hofbauer and A. Serebrenik, editors, Extended Abstracts of the 9th International
Workshop on Termination, WST’07, June 2007. http ://www.lri.fr/ marche/terminationcompetition/.
78. Y. Moy. “Union and Cast in Deductive Verification”. In Proceedings of the C/C++ Verification Workshop, volume Technical Report ICIS-R07015, pages 1–16, July 2007. Radboud
University Nijmegen.
79. Y. Moy and C. Marché. “Inferring Local (Non-)Aliasing and Strings for Memory Safety”. In Heap Analysis and Verification (HAV’07), pages 35–51, Braga, Portugal, March
2007.
80. S. Boldo, M. Daumas, W. Kahan and G. Melquiond. “Proof and certification for an accurate discriminant”. In 12th IMACS-GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg,Germany, Sep 2006.
81. S. Conchon and J-C. Filliâtre. “Type-Safe Modular Hash-Consing”. In ACM SIGPLAN
Workshop on ML, Portland, Oregon, September 2006.
40
82. J-C. Filliâtre. “Itérer avec persistance”. In Dix-septièmes Journées Francophones des Langages
Applicatifs, January 2006. INRIA.
83. J-C. Filliâtre. “Backtracking iterators”. In ACM SIGPLAN Workshop on ML, Portland, Oregon, September 2006. Also LRI Research Report 1428 ; English translation of
filliatre06jfla.
84. C. Marché and H. Zantema. “The Termination Competition 2006”. In A. Geser and H.
Sondergaard, editors, Extended Abstracts of the 8th International Workshop on Termination,
WST’06, August 2006. http ://www.lri.fr/ marche/termination-competition/.
85. S. Conchon, J-C. Filliâtre and J. Signoles. “Le foncteur sonne toujours deux fois”. In
Seizièmes Journées Francophones des Langages Applicatifs, pages 79–94, March 2005. INRIA.
86. P. Corbineau. “Skip lists et arbres binaires de recherche probabilistes”. In Seizièmes
Journées Francophones des Langages Applicatifs, pages 99–112, March 2005. INRIA.
87. L. Mandel and M. Pouzet. “ReactiveML, un langage pour la programmation réactive en
ML”. In Seizièmes Journées Francophones des Langages Applicatifs, pages 1-16, March 2005.
INRIA.
88. J. Signoles. “Une approche fonctionnelle du modèle vue-contrôleur”. In Seizièmes Journées Francophones des Langages Applicatifs, pages 63–78, March 2005. INRIA.
89. C. Paulin-Mohring. From Semantics and Computer Science : Essays in Honor of Gilles Kahn,
chapter A constructive denotational semantics for Kahn networks in Coq, Cambridge
University Press, 2008.
90. P. Caspi, G. Hamon and M. Pouzet. Real-Time Systems : Models and verification — Theory
and tools, chapter Synchronous Functional Programming with Lucid Synchrone, ISTE,
2007. English version of caspi06.
91. E. Contejean. “Modelling permutations in Coq for Coccinelle”. In H. Comon-Lundth,
C. Kirchner and H. Kirchner, editors, Rewriting, Computation and Proof, volume 4600 of
Lecture Notes in Computer Science, pages 259–269, Springer, 2007. Jouannaud Festschrift.
92. C. Marché. “Towards Modular Algebraic Specifications for Pointer Programs : a Case
Study”. In H. Comon-Lundh, C. Kirchner and H. Kirchner, editors, Rewriting, Computation and Proof, volume 4600 of Lecture Notes in Computer Science, pages 235–258, Springer,
2007.
93. P. Caspi, G. Hamon and M. Pouzet. Systèmes Temps-réel : Techniques de Description et de
Vérification – Théorie et Outils, chapter Lucid Synchrone, un langage de programmation
des systèmes réactifs, pages 217-260, volume 1, Hermes, 2006.
94. P. Audebaud and C. Paulin-Mohring, editors. Mathematics of Program Construction, MPC
2008, Marsaille, Jult 15-18, 2008, volume 5133 of Lecture Notes in Computer Science. Springer, 2008.
95. J-C. Filliâtre, C. Paulin-Mohring and B. Werner, editors. Types for Proofs and Programs,
International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18,2004, Selected
Papers, volume 3839 of Lecture Notes in Computer Science. Springer, 2005.
41
96. T. Hubert. “Analyse Statique et preuve de Programmes Industriels Critiques”. Thèse
de Doctorat, Université Paris-Sud, June 2008.
97. N. Rousset. “Automatisation de la Spécification et de la Vérification d’applications
Java Card”. Thèse de Doctorat, Université Paris-Sud, June 2008.
98. J. Andronick. “Modélisation et vérification formelles de systèmes embarqués dans les
cartes à microprocessur. Plateforme Java Card et Système d’exploitation”. Thèse de
Doctorat, Université Paris-Sud, March 2006.
99. L. Mandel. “Conception, Sémantique et Implantation de ReactiveML : un langage à la
ML pour la programmation réactive”. Université Paris 6, 2006.
100. G. Melquiond. “De l’arithmétique d’intervalles à la certification de programmes”.
École Normale Supérieure de Lyon, Lyon, France, 2006.
101. N. Oury. “Égalités et filtrages avec types dépendants dans le Calcul des Constructions
Inductives”. Thèse de Doctorat, Université Paris-Sud, September 2006.
102. J. Signoles. “Extension de ML avec raffinement : syntaxe, sémantiques et système de
types”. Thèse de Doctorat, Université Paris-Sud, July 2006.
103. P. Corbineau. “Démonstration Automatique en Théorie des Types”. Thèse de Doctorat,
Université Paris-Sud, September 2005.
104. C. Marché. “Preuves mécanisées de Propriétés de Programmes”. Thèse d’habilitation,
Université Paris 11, 2005.
105. P. Baudin, J-C. Filliâtre, C. Marché, B. Monate, Y. Moy and V. Prevosto. ACSL : ANSI/ISO
C Specification Language. 2008. http ://www.frama-c.cea.fr/acsl.html.
106. S. Conchon and E. Contejean. “The Alt-Ergo automatic Theorem Prover”. 2008.
http ://alt-ergo.lri.fr/.
107. M. Sozeau. The Coq Proof Assistant Reference Manual – Version V8.2, chapter User defined
equalities and relations, http ://coq.inria.fr/, 2008.
108. M. Sozeau. The Coq Proof Assistant Reference Manual – Version V8.2, http ://coq.inria.fr/,
2008.
109. The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V8.2. July
2008. http ://coq.inria.fr.
110. R. Bardou. “Invariants de classe et systèmes d’ownership”. Master Parisien de Recherche en Informatique, 2007.
111. S. Conchon and J-C. Filliâtre. “Semi-Persistent Data Structures”. Research Report 1474,
LRI, Université Paris Sud, September 2007.
112. E. Contejean, P. Courtieu, J. Forest, O. Pons and X. Urbain. “CiME3”. 2007.
http ://cime.lri.fr.
113. E. Contejean, P. Courtieu, J. Forest, O. Pons and X. Urbain. “Certification of automated
termination proofs”. Technical Report 1185, CEDRIC, May 2007.
114. J-C. Filliâtre. “Queens on a Chessboard : an Exercise in Program Verification”. 2007.
http ://why.lri.fr/queens/.
42
115. L. Mandel and L. Maranget. The JoCaml system. 2007. Software and documentation available at http ://jocaml.inria.fr/.
116. Y. Moy. “Checking C Pointer Programs for Memory Safety”. Research Report 6334,
INRIA, October 2007.
117. C. Paulin-Mohring. “A library for reasoning on randomized algorithms in Coq Version 2”. Description of a Coq contribution, Université Paris Sud, December 2007.
http ://www.lri.fr/ paulin/ALEA/library.pdf.
118. H. Brönnimann, G. Melquiond and S. Pion. “Bool_set : multi-valued logic”. Technical
Report 2136, ISO C++ Standardization Committee, 2006.
119. H. Brönnimann, G. Melquiond and S. Pion. “A Proposal to add Interval Arithmetic to
the C++ Standard Library”. Technical Report 2137, ISO C++ Standardization Committee, 2006.
120. J-C. Filliâtre. “Backtracking iterators”. Research Report 1428, LRI, Université Paris Sud,
January 2006. English translation of filliatre06jfla.
121. S. Lescuyer. “Codage de la logique du premier ordre polymorphe multi-sortée dans la
logique sans sortes”. Master Parisien de Recherche en Informatique, 2006.
122. L. Mandel. “Report on modeling GALS in SCADE”. ASSERT Deliverable 4.3.2-1, ASSERT Project, February 2006.
123. L. Mandel. “Prototype of AADL simulation in SCADE”. ASSERT Deliverable 4.3.2-2,
ASSERT Project, November 2006.
124. C. Paulin-Mohring. “A library for reasoning on randomized algorithms in
Coq”. Description of a Coq contribution, Université Paris Sud, January 2006.
http ://www.lri.fr/ paulin/ALEA/library.pdf.
125. M. Pouzet. Lucid Synchrone, version 3. Tutorial and reference manual. Université Paris-Sud,
LRI, April 2006.
126. J. Signoles. “Towards a ML extension with Refinement : a Semantic Issue”. Technical
Report 1440, LRI, University of Paris Sud, March 2006.
127. The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V8.1. July
2006. http ://coq.inria.fr.
128. N. Ayache. “Coopération d’outils de preuve interactifs et automatiques”. Université
Paris 7, 2005.
129. E.
Contejean.
“Coccinelle”.
http ://www.lri.fr/ contejea/Coccinelle/coccinelle.html.
2005.
130. S. Lucas, C. Marché and J. Meseguer. “Operational Termination of Conditional Term
Rewriting Systems”. Research Report DSIC II/01/05, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Spain, February 2005.
131. M. Sozeau. “Coercion par prédicats en Coq”. Université Paris 7, 2005. In French.
43
Test formel et exploration de systèmes
1. E. Bayse, A. Cavalli, M. Nunez and F. Zaidi. “A Passive Testing Approach based on
Invariants : application to the WAP”. In Computer Networks, volume 48, pages 247-266,
Elsevier Science, 2005.
2. A. Cavalli, A. Mederreg, F. Zaidi, P. Combes, W. Monin, R. Castanet, M. MacKaya and
P. Laurencot. “Une Plate-forme de Validation Multi-Services et Multi-Protocoles - Résultats d’Expérimentations”. Annales des Télécommunications, 60(5-6) :588–609, June 2005.
3. C. Jones, D. Lomet, A. Romanovsky, G. Weikum, A. Fekete, M-C. Gaudel, H. F. Korth, R.
de Lemos, E. Moss, R. Rajwar, K. Ramamritham, B. Randell and L. Rodrigues. “The
Atomic Manifesto : a Story in Four Quarks”. Journal of Universal Computer Science,
11(5) :636-650, 2005.
4. C. Canal, J. M. Murillo and P. Poizat, editors. Special Issue on Coordination and Adaptation
Techniques, volume 12 of L’Objet. 2006.
5. M-C. Gaudel, A. Denise, S-D. Gouraud, R. Lassaigne, J. Oudinet and S. Peyronnet.
“Coverage-biased random exploration of large models”. In ETAPS Workshop on Model Based Testing, Electronic Notes in Theoretical Computer Science, March 2008. invited
lecture, 11 pages.
6. M-C. Gaudel. “Formal Methods and Testing : Hypotheses, and Correctness Approximations”. In FM 2005 : Formal Methods : International Symposium of Formal Methods, volume 3582 of Lecture Notes in Computer Science, pages 2-8, 2005. Springer Verlag. keynote
talk.
7. F. Bassino, J. Clément, J. Fayolle and P. Nicodème. “Construction for Clumps Statistics”.
In Fifth Colloquium on Mathematics and Computer Science (Sept. 2008), 2008.
44
8. C. Canal, J. M. Murillo and P. Poizat. “Practical Approaches for Software Adaptation.
Report on the 4th Workshop WCAT at ECOOP 2007”. In ECOOP 2007 Workshop Reader,
volume 4906 of Lecture Notes in Computer Science, pages 154–165, 2008.
9. A. Cavalcanti and M-C. Gaudel. “A note on traces refinement and the conf relation in
the Unifying Theories of Programming”. In Unifying Theories of Programming, volume
to appear of Lecture Notes in Computer Science, Trinity College Dublin, September 2008.
Springer Verlag. 20 pages.
10. J. Cubo, G. Salaün, C. Canal, E. Pimentel and P. Poizat. “Verification and Adaptation
of WF/.NET Components”. In Proceedings of the Workshop on Formal Aspects of Component
Software (FACS 07), 2008. to appear.
11. J. Fayolle. “Analysis of the Size of Antidictionary in DCA”. In Combinatorial Pattern
Matching 2008, 2008.
12. J. Fayolle, M-C. Gaudel, S-D. Gouraud and B. Marre. “Statistical Testing of Synchronous
Reactive Systems”. In Proceedings of Embedded Real Time Software 2008, 2008. 15 pages.
13. T. Melliti, P. Poizat and S. Ben Mokhtar. “Distributed Behavioural Adaptation for the
Automatic Composition of Semantic Services”. In Proceedings of the International Conference on Fundamental Approaches to Software Engineering (FASE 08), volume 4961 of Lecture
Notes in Computer Science, pages 146–162, 2008.
14. J. Oudinet. “Uniform Random Exploration of Concurrent Systems”. In MOdelling and
VErifying parallel Processes (MOVEP), pages 323–328, June 2008.
15. N. Baskiotis, M. Sebag, M-C. Gaudel and S-D. Gouraud. “A Machine Learning Approach for Statistical Software Testing”. In IJCAI, Proceedings of the 20th International
Joint Conference on Artificial Intelligence, pages 2274-2279, 2007.
16. F. Bassino, J. Clément, J. Fayolle and P. Nicodème. “Counting occurrences for a finite
set of words : an inclusion-exclusion approach Algorithms”. In P. Jacquet, editor, Proceedings of the 2007 International Conference on Analysis of Algorithms, pages 95–104, 2007.
DMTCS.
17. C. Canal, P. Poizat and M. Viroli, editors. Proceedings of the Sixth International Workshop on
the Foundations of Coordination Languages and Software Architectures (FOCLASA 07).. 2007.
Held in conjunction with CONCUR’2007.
18. A. Cavalcanti and M-C. Gaudel. “Testing for Refinement in CSP”. In Formal Methods
and Software Engineering, ICFEM 2007, volume 4789 of Lecture Notes in Computer Science,
pages 151-170, 2007. Springer Verlag.
19. M. Lallali, F. Zaidi and A. Cavalli. “Timed Modeling of Web Services Composition for
Automatic Testing”. In SITIS IEEE/ACM 2007, pages 10–20, Shanghai, December 2007.
IEEE Computer Society.
20. R. Mateescu, P. Poizat and G. Salaün. “Behavioral Adaptation of Component Compositions based on Process Algebra Encodings”. In Proceedings of the 22nd IEEE/ACM
International Conference on Automated Software Engineering (ASE 07), pages 385–388, 2007.
ACM,IEEE.
21. J. Oudinet. “Uniform Random Walks in Very Large Models”. In RT ’07 : Proceedings of
the 2nd international workshop on Random testing, pages 26–29, Atlanta, GA, USA, November 2007. ACM Press.
22. S. Becker, C. Canal, N. Diakov, J. M. Murillo, P. Poizat and M. Tivoli, editors. Coordination
and Adaptation Techniques : Bridging the Gap Between Design and Implementation. Proceedings
of the Third International Workshop on Coordination and Adaptation Techniques for Software
Entities (WCAT 06).. 2006. Held in conjunction with ECOOP’2006.
45
23. A. Denise, M-C. Gaudel, S-D. Gouraud, R. Lassaigne and S. Peyronnet. “Uniform Random Sampling of Traces in very Large Models”. In 1st International ACM Workshop on
Random Testing, pages 10 -19, July 2006.
24. S-D. Gouraud and A. Gotlieb. “Using CHRs to generate functional test cases for the
Java Card Virtual Machine”. In 8th International Symposium on Practical Aspects of Declarative Languages (PADL), LNCS 3819, pages 1-15, 2006.
25. S. Maag and F. Zaidi. “Testing methodology for an ad hoc routing protocol”. In
PM2HW2N ’06 : Proceedings of the ACM international workshop on Performance monitoring,
measurement, and evaluation of heterogeneous wireless and wired networks, pages 48–55, Terromolinos, Spain, 2006. ACM. http ://doi.acm.org/10.1145/1163653.1163663.
26. S. Maag and F. Zaidi. “A Step-Wise Validation Approach for a Wireless Routing Protocol”. In IEEE International Conference on Communications and Electronics (ICCE’06), Hanoi,
Vietnam, October 2006. IEEE.
27. S. Becker, C. Canal, J. M. Murillo, P. Poizat and M. Tivoli, editors. New Issues on Coordination and Adaptation Techniques. Proceedings of the Second International Workshop on Coordination and Adaptation Techniques for Software Entities (WCAT’05).. 2005. Held in conjunction
with ECOOP’2005.
28. J. Fayolle and M. D. Ward. “Analysis of the Average Depth in a Suffix Tree under a
Markov Model”. In C. Martínez, editor, Proceedings of the 2005 International Conference
on the Analysis of Algorithms, pages 95–104, 2005. DMTCS. Proceedings of a colloquium
organized by Universitat Politècnica de Catalunya, Barcelona, Catalunya, June 2005..
29. G. Salaün and P. Poizat. “Interacting Extended State Diagrams”. In Proceedings of the
International Workshop on Semantic Foundations of Engineering Design Languages (SFEDL
04), volume 115 of Electronic Notes in Theoretical Computer Science, pages 49–57, 2005.
Elsevier.
30. A. Cavalli, S. Maag and F. Zaidi. “Une approche UML pour la validation des services
web”. In 5ème Colloque international sur les NOuvelles TEchnologies de la REpartition (NOTERE), September 2005.
31. G. Lestiennes and M-C. Gaudel. “Test de systèmes réactifs non réceptifs”. Journal Europén des Systèmes automatisés, 36(1-2-3) :255-270, 2005. proceedings of MSR’05.
32. S-D. Gouraud and A. Gotlieb. “Utilisation des CHRs pour générer des cas de test
pour la Machine Virtuelle Java Card”. In Journées Francophones de Programmation par
Contraintes (JFPC), pages 383-392, 2005.
46
33. M-C. Gaudel and P. L. Gall. “Testing Data Types Implementations from Algebraic
Specifications”. In Formal Methods and Testing, R. Hierons, J. Bowen, and M. Harman,eds,
volume 4949 of Lecture Notes in Computer Science, pages 209-239, Springer-Verlag, 2007.
34. M. Frappier, H. Habrias and P. Poizat. Software Specification Methods : an Overview Using
a Case Study, chapter 19 - A Comparison of the Specification Methods, ISTE, Hermes
Science Publishing, 2006.
35. M-C. Gaudel. “Validation et Vérification”. In Encyclopédie de l’informatique et des systèmes
d’information, pages 1136-1150, Vuibert, 2006.
36. M-C. Gaudel. “Les objets à l’épreuve des faits”. In Communication, Connaissance : supports et médiations à l’âge de l’information, J.-G. Ganascia, ed., CNRS Éditions, 2006. 4 pages.
37. P. Poizat and T. Vergnaud. Méthodes formelles pour les systèmes répartis et coopératifs, chapter
5 - Langages de description d’architecture, Hermes, Lavoisier, 2006.
38. M-C. Gaudel. “Toward Undoing in Composite Web Services”. In Architecting Dependable
Systems III, volume 3549 of Lecture Notes in Computer Science, pages 59-68, 2005. Springer
Verlag.
39. A. Denise, M-C. Gaudel, S-D. Gouraud, R. Lassaigne, J. Oudinet and S. Peyronnet.
“Coverage-Biased Random Exploration of Large Models and Application to Testing”.
Technical Report 1494, LRI, Université Paris-Sud XI, June 2008. 26 pages, submitted.
40. M-C. Gaudel, F. Magnez, R. Lassaigne and M. de Rougemont. “Approximations for
Model Checking and Testing (survey, preliminary version)”. 32 pages, submitted, Université de Paris-Sud, May 2008.
41. C. Attiogbé, P. Poizat and G. Salaün. “A Formal and Tool-Equipped Approach for the
Integration of State Diagrams and Formal Datatypes”. IEEE Transactions on Software
Engineering, 33(3) :157–170, 2007.
42. M. Lallali, F. Zaidi and A. Cavalli. “Timed Modeling of Web Services Composition
for Automatic Testing”. Technical Report 07008-LOR, GET/INT, Evry, September 2007.
Long version.
43. J. Oudinet. “Uniform random walks in concurrent models”. Université Paris-Sud 11,
LRI, September 2007. Master Thesis.
44. J. Oudinet. “Tirages aléatoires uniformes dans des systèmes concurrents”. Université
Paris-Sud 11, LRI, September 2007. stage de DEA.
45. F. Zaidi and M. Lallali. “Use of Verification Techniques for Components Testing”. Technical Report 1465, LRI, http ://www.lri.fr/Rapports-internes, Université Paris-Sud XI,
January 2007.
46. G. Lestiennes and M-C. Gaudel. “Modélisation et Test de Systèmes comportant des
actions prioritaires”. Rapport LRI 1434, Université de Paris-Sud, March 2006.
47. S. Maag and F. Zaidi. “Spécification Formelle pour le Test d’un Protocole de Routage
ad hoc”. Technical Report 06009-LOR, GET/INT, France, October 2006.
47
48. P. Poizat and J-C. Royer. “A Formal Architectural Description Language based on
Symbolic Transition Systems and Modal Logic”. Journal of Universal Computer Science
(J.UCS), 12(12) :1741–1782, 2006.
49. S-D. Gouraud. “AuGuSTe : a Tool for Statistical Testing (Experimental results)”. Technical Report 1400, Université Paris-Sud 11, 2005.
48
Théorie des graphes et optimisation
combinatoire
1. D. Amar, E. Flandrin and G. Gancarzewicz. “A degree condition implying that every
matching is contained in a hamiltonian cycle”. Discrete Mathematics, 2008. To appear.
2. H. Aram, S. Sheikholeslami and O. Favaron. “Trees with domination subdivision number three”. Discrete Mathematics, 2008. To appear.
3. S. Bekkaï, D. Forge and M. Kouider. “Covering the vertices of a graph by cycles of
bounded length”. Discrete Applied Mathematics, 2008. To appear.
4. S. Bekkaï and M. Kouider. “On pseudo factors”. Discrete Applied Mathematics, 2008. To
appear.
5. C. Bentz. “On the complexity of the multicut problem in bounded tree-width graphs
and digraphs”. Discrete Applied Mathematics, 156 :1908–1917, 2008.
6. C. Bentz, M-C. Costa, N. Derhy and F. Roupin. “Cardinality constrained and multicriteria (multi)cut problems”. Journal of Discrete Algorithms, 2008. To appear.
7. C. Bentz, M-C. Costa, L. Létocart and F. Roupin. “Multicuts and integral multiflows in
rings”. European Journal of Operational Research, 2008. To appear.
8. C. Bentz, M-C. Costa, D. de Werra, C. Picouleau and B. Ries. “On a graph coloring
problem arising from discrete tomography”. Networks, 51 :256–267, 2008.
9. M. Blidia, O. Favaron and R. Lounes. “Locating-domination, 2-domination and independence in trees”. Australasian Journal of Combinatorics, 2008. To appear.
10. D. Cardoso, J. O. Cerdeira, P. da Silva and C. Delorme. “Efficient edge domination in
regular graphs”. Discrete Applied Mathematics, 2008. To appear.
11. M. Chellali and O. Favaron. “On k-star-forming sets in graphs”. Journal of Combinatorial
Mathematics and Combinatorial Computing, 2008. To appear.
12. M. Chellali, O. Favaron, A. Hansberg and L. Volkmann. “On the p-domination, the total
domination and the connected domination numbers of graphs”. Journal of Combinatorial
Mathematics and Combinatorial Computing, 2008. To appear.
13. M. Chellali, O. Favaron, T. W. Haynes and D. Raber. “Ratios of some domination parameters in trees”. Discrete Mathematics, 308 :3879–3887, 2008.
14. E. J. Cockayne, O. Favaron, A. Finbow and C. M. Mynhardt. “Open Irredundance and
Maximum Degree in Graphs”. Discrete Mathematics, 2008. To appear.
15. O. Favaron, A. Hansberg and L. Volkmann. “k-domination and minimum degree in
graphs”. Journal of Graph Theory, 57 :33–40, 2008.
49
16. O. Favaron and M. A. Henning. “Total domination in claw-free graphs with minimum
degree two”. Discrete Mathematics, 308 :3213–3219, 2008.
17. O. Favaron and M. A. Henning. “Bounds on total domination in claw-free cubic
graphs”. Discrete Mathematics, 308 :3491–3507, 2008.
18. O. Favaron, H. Karami and S. Sheikholeslami. “Total domination in K5 - and K6 -covered
graphs”. Discrete Mathematics and Theoretical Computer Science, 10 :35–42, 2008.
19. O. Favaron, H. Karami and S. Sheikholeslami. “Total domination and total domination subdivision numbers of a graph and its complement”. Discrete Mathematics,
38 :4018–4023, 2008.
20. O. Favaron, H. Karami and S. Sheikholeslami. “Paired-domination number of a graph
and its complement”. Discrete Mathematics, 2008. To appear.
21. O. Favaron, H. Karami and S. Sheikholeslami. “Disproof of a conjecture on the subdivision domination number of a graph”. Graphs and Combinatorics, 2008. To appear.
22. E. Flandrin, T. Kaiser, R. Kuzel, H. Li and Z. Ryjacek. “Neighborhood union and extremal spanning trees”. Discrete Mathematics, 308 :2343–2350, 2008.
23. D. Forge and T. Zaslavsky. “On the division of space by topological hyperplanes”.
European Journal of Combinatorics, 2008. To appear.
24. D. Forge and T. Zaslavsky. “Colorations, Orthotopes, and a Huge Polynomial Tutte
Invariant of Weighted Gain Graphs”. Journal of Combinatorial Theory, Series B, 2008. To
appear.
25. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc and D. Peleg. “Graph Exploration by a Finite
Automaton”. Journal of Parallel and Distributed Computing, 2008. To appear.
26. P. Fraigniaud, D. Ilcinkas and A. Pelc. “Impact of memory size on graph exploration
capability”. Discrete Applied Mathematics, 2008. To appear.
27. H. Li and J. Li. “Long paths with its ends in a given subset of vertices”. Discrete Mathematics, 308 :4518–4529, 2008.
28. H. Li, H. Miao, L. Liu, L. Li and H. Zhang. “Energy conservation in wireless sensor
networks and connectivity of graphs”. Theoretical Computer Science, 393 :81–89, 2008.
29. D. Amar, E. Flandrin, G. Gancarzewicz and P. Wojda. “Bipartite graphs with every
matching in a cycle”. Discrete Mathematics, 307 :1525–1537, 2007.
30. D. Barth, J. Cohen and T. Faik. “On the b-continuity property of graphs”. Discrete Applied Mathematics, 13 :1761–1768, 2007.
31. C. Bentz. “The maximum integer multiterminal flow problem in directed graphs”.
Operations Research Letters, 35 :195–200, 2007.
32. C. Bentz, M-C. Costa, C. Picouleau and M. Zrikem. “The shortest multipaths problem
in a capacitated dense channel”. European Journal of Operational Research, 178 :926–931,
2007.
33. C. Bentz, M-C. Costa and F. Roupin. “Maximum integer multiflow and minimum
multicut problems in two-sided uniform grid graphs”. Journal of Discrete Algorithms,
5 :36–54, 2007.
34. M. Blidia, M. Chellali, O. Favaron and N. Meddah. “On k-independence in graphs with
emphasis on trees”. Discrete Mathematics, 307 :2209-2216, 2007.
35. F. Cappello, P. Fraigniaud, B. Mans and A. Rosenberg. “An Algorithmic Model for Heterogeneous Hyper-Clusters : Rationale and Experience”. International Journal of Foundations of Computer Science, 16 :195–216, 2007.
50
36. D. M. Cardoso, C. Delorme and P. Rama. “Laplacian eigenvectors and eigenvalues and
almost equitable partitions”. European Journal of Combinatorics, 28 :665-673, 2007.
37. O. Favaron, H. Karami and S. Sheikholeslami. “Total domination and total domination
subdivision numbers”. Australasian Journal of Combinatorics, 38 :229–235, 2007.
38. E. Flandrin, H. Li, A. Marczyk and M. Wozniak. “A Chvatal-Erdos type condition for
pancyclability”. Discrete Mathematics, 307 :1463–1466, 2007.
39. E. Flandrin, H. Li, A. Marczyk and M. Wozniak. “A generalization of Dirac’s Theorem
on cycles through k vertices in k-connected graphs”. Discrete Mathematics, 307 :878–884,
2007.
40. E. Flandrin, H. Li and J. Shu. “A sufficient condition for cyclability in directed graphs”.
Discrete Mathematics, 307 :1291–1297, 2007.
41. R. Flores and D. Forge. “Minimal non-orientable matroids in a projective plane”. Journal of Combinatorial Theory Series A, 24 :1081–1087, 2007.
42. D. Forge and M. Kouider. “Coverings of the vertices of a graph by small cycles”. Graphs
and Combinatorics, 23 :135–143, 2007.
43. D. Forge and T. Zaslavsky. “Lattice point counts for the Shi arrangement and
other affinographic hyperplane arrangements”. Journal of Combinatorial Theory Series A,
114 :97–109, 2007.
44. Z-Q. Hu and H. Li. “Partition of a Graph into Cycles and Vertices”. Discrete Mathematics, 307 :1436–1440, 2007.
45. T. Kaiser, R. Kuzel, H. Li and G. Wang. “A note on k-walks in bridgeless graphs”.
Graphs and Combinatorics, 23 :303–308, 2007.
46. A. E. Sahili and M. Kouider. “About paths with two blocks”. Journal of Graph Theory,
55 :221–226, 2007.
47. Z. Zhang and H. Li. “Algorithms for long paths in graphs”. Theoretical Computer Science,
377 :25–34, 2007.
48. O. Favaron, R. Laskar and D. Rautenbach. “t-partitions and s-complete t-partitions of a
graph”. Australasian Journal of Combinatorics, 36 :295–302, 2006.
49. P. Fraigniaud and P. Gauron. “D2B : a de Bruijn Based Content-Addressable Network”.
Theoretical Computer Science, 65 :65–79, 2006.
50. M. Kouider and P. Vestergaard. “Generalized connected domination in graphs”. Discrete Mathematics and Theoretical Computer Science, 8 :57–64, 2006.
51. M. Kouider and M. Zaker. “On the b-chromatic number of some classes of graphs”.
Discrete Applied Mathematics, 306 :617–623, 2006.
52. R. Andrade, A. Lisser, G. Plateau and N. Maculan. “B&B Frameworks for the Capacity
Expansion of High Speed Telecommunication Networks Under Uncertainty”. Annals
of Operations Research, 140 :49–65, 2005.
53. M. Blidia, M. Chellali and O. Favaron. “Independence and 2-domination in trees”.
Australasian Journal of Combinatorics, 33 :317–327, 2005.
54. E. Flandrin, H. Li, A. Marczyk and M. Wozniak. “A note on a generalization of Ore’s
condition”. Graphs and Combinatorics, 21 :213–216, 2005.
55. P. Fraigniaud, B. Mans and A. Rosenberg. “Efficient Trigger-Broadcast in Heterogeneous Clusters”. Journal of Parallel and Distributed Computing, 65 :628–642, 2005.
51
56. C. Hoang and M. Kouider. “On the b-dominating coloring of graphs”. Discrete Applied
Mathematics, 152(1–3) :176–186, 2005.
57. M. Kouider and P. Vestergaard. “Connected factors in graphs - a survey”. Graphs and
combinatorics, 21 :1–26, 2005.
58. H. Li and J. Shu. “The partitions of a strong tournament”. Discrete Mathematics,
290 :211–220, 2005.
59. F. Barriere, P. Flocchiniand, P. Fraigniaud and N. Santoro. “Rendezvous and Election of
Mobile Agents : Impact of Sense of Direction”. Theory of Computing Systems, 2008. To
appear.
60. M. Blidia, M. Chellali, O. Favaron and N. Meddah. “Maximal k-independent sets in
graphs”. Discussiones Mathematicae Graph Theory, 2008. To appear.
61. C. Delorme and J-M. Rinkel. “About the generating function of a left-bounded integervalued random variable”. Bulletin de la Société Mathématique de France, 2008. To appear.
62. O. Favaron, H. Karami and S. Sheikholeslami. “Connected domination subdivision
numbers of graphs”. Utilitas Mathematica, 2008. To appear.
63. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg. “Label-Guided Graph
Exploration by a Finite Automaton”. ACM Transaction on Algorithms, 2007. To appear.
64. C. Delorme. “Sur la formule d’inversion de Lagrange”. Annales de la faculté des sciences
de Toulouse Série 6, 16(2) :247–252, 2007.
65. C. Delorme, I. Márquez, O. Ordaz and D. Quiroz. “Maximum line-free set geometry in
Z3d ”. Divulgationes Mathemáticas, 15 :253–263, 2007.
66. M. Kouider and M. Maheo. “The b-chromatic number of the cartesian product of two
graphs”. Studia Math. Hungarica, 44 :49–55, 2007.
67. H. Li, G. Wang and S. Zhou. “Long Alternating Cycles in Edge-Colored Complete
Graphs”. Lecture Notes in Computer Science, 4613 :305–309, 2007.
68. A. E. Sahili and M. Kouider. “Claws in digraphs”. Comptes Rendus Mathématiques de
l’Académie des Sciences de Paris, 346 :1–4, 2007.
69. R. Andrade, A. Lisser, G. Plateau and N. Maculan. “Enhancing a Branch and Bound
Algorithm for Two-stage Stochastic Integer Network Design based Models”. Management Science, 9 :1450–1455, 2006.
70. R. Cada, E. Flandrin and H. Li. “Hamiltonicity and pancyclicity of generalized prisms”.
Electronic Notes in Discrete Mathematics, 24 :61–67, 2006.
71. R. Cordovil and D. Forge. “An Orlik-Solomon type algebra for matroids with a fixed
linear class of circuits”. Porgtulia Matematica, 63 :363–374, 2006.
72. E. Flandrin, H. Li, A. Marczyk, I. Schiermeyer and M. Wozniak. “Chvatal-Erdos conjecture and pancyclism”. Discussiones Mathematicae Graph Theory, 26 :335–342, 2006.
73. J. Bucko, P. Mihók, J-F. Saclé and M. Woźniak. “A note on maximal common subgraphs
of the Dirac’s family of graphs”. Discussiones Mathematicae Graph Theory, 25 :385–390,
2005.
74. R. Cordovil and D. Forge. “Grobner and diagonal bases in Orlik-Solomon type algebras”. Cubo journal, 7 :1–20, 2005.
52
75. O. Favaron. “An alternative definition of the k-irredundance”. AKCE International Journal of Graphs and Combinatorics, 2 :33–38, 2005.
76. A. Lisser and R. Lopez. “Application of SDP relaxation and VNS for multiuser detection in synchronous CDMA”. In International Network Optimization Conference, Spa,
April 2007.
77. R. Lopez and A. Lisser. “Recherche à voisinage variable et programmation semidéfinie
positive dans les réseaux de troisième génération”. In Proceedings of ROADEF, pages
41–56, 2006.
78. S. Kosuch and A. Lisser. “Chance contrained Knapsack problems with continuous
distributions”. In Proceedings of Modelling, Computation and Optimization conference, September 2008.
79. R. Lopez and A. Lisser. “SDP and lagrangian relaxations for maxcut and CDMA problems”. In Proceedings of MOSIM, March 2008.
80. R. Lopez and A. Lisser. “Knapsack problem with probability constraints”. In Proceedings of Modelling, Computation and Optimization conference, September 2008.
81. L. Andrieu, R. Apparigliato, A. Lisser and A. Tang. “Stochastic Optimization Under
Risk Constraints : Application To Hedging Problem In Electrical Industry”. In Proceedings of the Power Systems Modeling Conference, Athens, Greece, June 2007.
82. W. Benajam, A. Gaivoronski, A. Lisser and R. Lopez. “Stochastic Quadratic Knapsack
Problem”. In Proceedings of the 11th international stochastic programming conference, Vienna,
Austria, August 2007.
83. W. Benajam, A. Gaivoronski, A. Lisser and R. Lopez. “Stochastic Quadratic Knapsack
Problem with recourse”. In Proceedings of the International Conference on Nonconvex Programming : Local and Global Approaches, December 2007.
84. N. Nisse and D. Soguet. “Graph searching with advice”. In Lecture Notes in Computer
Science, Proceedings of SIROCCO’07, volume 4474, pages 51–65, 2007.
85. C. Bentz. “The maximum integer multiterminal flow problem”. In Lecture Notes in Computer Science, Proceedings of ICCSA 2006, volume 3982, pages 738–747, Glasgow, UK, 2006.
86. A. Gaivoronski and ALisser. “Stochastic Frequency Assignment Problem”. In Proceedings of CIMODE conference, April 2006.
87. C. Bentz. “The maximum integer multiterminal flow problem”. In Electronic Notes in
Discrete Mathematics, Proceedings of ICGT 2005, volume 22, pages 55–60, Hyères, France,
2005.
53
88. P. Berthome, L. Gastal and A. Lisser. “Robust Routing in Changing Topologies”. In Proceedings of the International Network Optimization Conference, pages 603–608, March 2005.
89. P. Berthomé, L. Gastal and A. Lisser. “Robust Routing in Changing topologies”. In
Proceedings of ALGOTEL conference, May 2005.
90. W. Benajam, P. Berthomé, L. Gastal and A. Lisser. “Un algorithme approché utilisant la
programmation SDP pour le problème de la coupe maximale robuste”. In Proceedings
of ROADEF, 2007.
91. W. Benajam, A. Gaivoronski and A. Lisser. “Stochastic Frequency Assignment Problem”. In Proceedings of 13th Czech-French-German Conference on Optimization, September
2007.
92. C. Bentz. “Solving the planar multicut problem”. In Proceedings of the Sixth International
Colloquium on Graphs and Optimisation, Cademario, Switzerland, Aug 2007.
93. C. Bentz. “Polynomial-time solvability of some multicut problems”. In Proceedings of
the International Conference on Nonconvex Programming : Local and Global Approaches (NCP
07), Paris, France, Dec 2007.
94. C. Bentz. “Multicoupes dans les graphes orientés de largeur d’arbre bornée et les cactus : complexité et inapproximabilité”. In Francoro V – ROADEF 07, Grenoble, France,
Feb 2007.
95. C. Bentz, D. de Werra, M-C. Costa, C. Picouleau and B. Ries. “Reconstruction d’une
coloration des arêtes d’un graphe à partir des séquences de degrés”. In Francoro V –
ROADEF 07, Grenoble, France, Feb 2007.
96. A. Lisser and R. Lopez. “Algorithme d’approximation et métaheuristique dans les
réseaux de 3ème génération”. In Proceedings of ROADEF, 2007.
97. W. Benajam and A. Lisser. “Problème d’affectation de fréquences stochastique”. In
Proceedings of ROADEF, 2006.
98. W. Benajam, A. Lisser and A. Gaivoronski. “Stochastic FAP : Non adaptive case”. In
Proceedings of the International Symposium of Mathematical Programming, August 2006.
99. C. Bentz. “Multicuts in bounded tree-width (di)graphs”. In Proceedings of the Fifth International Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, Aug 2006.
100. C. Bentz. “Multicoupe dans les graphes planaires et de largeur d’arbre bornée”. In
ROADEF 06, Lille, France, Feb 2006.
101. C. Bentz. “Approximation du problème de flot multiterminal entier maximum dans
les graphes orientés”. In ROADEF 06, Lille, France, Feb 2006.
102. C. Bentz, M-C. Costa, N. Derhy and F. Roupin. “Etude du problème de la multicoupe
minimale à cardinalité contrainte”. In ROADEF 06, Lille, France, Feb 2006.
103. C. Bentz, D. de Werra, M-C. Costa, C. Picouleau and B. Ries. “Discrete Tomography and
Graph Coloring”. In Proceedings of the 21st European Conference on Operational Research
(EURO XXI), Iceland, 2006.
104. C. Bentz, D. de Werra, M-C. Costa, C. Picouleau and B. Ries. “Reconstruction de la
coloration d’un graphe à partir de projections de chaînes”. In ROADEF 06, Lille, France,
Feb 2006.
54
105. C. Bentz, D. de Werra, M-C. Costa, C. Picouleau and B. Ries. “On a graph coloring
problem arising from discrete tomography”. In Proceedings of the Fifth International Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, Aug 2006.
106. W. Benajam and A. Lisser. “Relaxations linéaires et semidéfinies pour la résolution de
problèmes d’affectation de fréquences”. In Proceedings of CIRO conference, April 2005.
107. W. Benajam, A. Lisser and M. Minoux. “Quadratic Assignment Problem”. In Proceedings
of ROADEF, 2005.
108. C. Bentz, M-C. Costa, C. Picouleau and M. Zrikem. “The shortest multipaths problem
in a capacitated dense channel”. In Proceedings of the Fifth ALIO/EURO Conference on
Combinatorial Optimization, Paris, France, 2005.
109. C. Bentz, M-C. Costa and F. Roupin. “Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs”. In Proceedings of CIRO, Maroc, 2005.
110. C. Bentz, M-C. Costa and F. Roupin. “Résoudre en temps linéaire le problème de la
multicoupe minimum dans des grilles rectangulaires”. In ROADEF 05, Tours, France,
Feb 2005.
111. M. Blidia, M. Chellali and O. Favaron. “Ratios of some domination parameters in
graphs and claw-free graphs”. In J. A. Bondy and others, editors, Graph Theory in Paris,
pages 61–72, 2007. Trends Math., Birkhauser, Basel.
112. O. Favaron and M. Mahéo. “Chap. 4 : Connexité et réseaux d’interconnexion”. In J-C.
Fournier, editor, Graphes et applications, pages 135–181, 2007. Hermes-Lavoisier Paris.
113. A. Lisser and P. Mahey. “Multicommodity Flow Problems and decomposition in Telecommunications Networks”. In Handbook of Optimization in Telecommunications, volume
9, pages 241–267, 2006. Ed. M. Resende and P. Pardalos.
114. O. Favaron. “Bounds on total and paired domination in graphs and claw-free graphs”.
In Erster Aachener Tag der Graphentheorie, pages 59–73, 2005. Rheinisch-Westfälische Tech.
Hochsch. Lehrstuhl II Math., Aachen.
55
Réseaux
1. A. Fourati and K. Al Agha. “Detecting forged routing messages in ad hoc networks”.
Telecommunication Systems, Springer, 2008. To appear.
2. I. Gaw˛edzki and K. Al Agha. “How to Avoid Packet Droppers with Proactive Routing Protocols for Ad Hoc Networks”. ACM International Journal of Network Management,
wiley, 18(2), March/April 2008.
3. J. Rahmé, A. Carneiro Viana and K. Al Agha. “Looking for network functionalities’
extension by avoiding energy-compromised hotspots in wireless sensor networks”.
Annals of Telecommunication, Springer, 2008. To appear.
4. A. Fourati, K. Al Agha and H. K. B. Ayed. “Secure and Fair Auctions over Ad Hoc
Networks”. International Journal of Electronic Business, Inderscience Publishers, 5(3) :276 293, 2007.
5. P. Minet, S. Martin, L. A. Saidane and S. Azzaz. “FP/FIFO scheduling : coexistence of
deterministic and probabilistic QoS guarantees”. Journal on Discrete Mathematics &Theoretical Computer Science, 1(9), 2007.
6. A. Fourati and K. Al Agha. “A shared secret-based algorithm for securing the OLSR
routing protocol”. Telecommunication Systems, Springer, 31(2-3) :213 - 226, March 2006.
7. H. Badis and K. Al Agha. “QOLSR, QoS routing for Ad Hoc Wireless Networks
Using OLSR”. European Transactions on Telecommunications Journal, Wiley, 16(5), September/October 2005.
8. S. Martin and P. Minet. “Improving the analysis of distributed non-preemptive FP/DP*
with the trajectory approach”. Telecommunication Systems, Springer, 30(1), November
2005.
9. S. Martin, P. Minet and L. George. “Improving Fixed Priority schedulability with Dynamic Priority as secondary criterion”. Journal of Embedded Computing, special issue, IOS
Press, 2005.
10. S. Martin, P. Minet and L. George. “End-to-end response time with Fixed Priority scheduling : Trajectory approach versus holistic approach”. International Journal of Communication Systems, Wiley, 18(1), February 2005.
56
11. S. Martin, P. Minet and L. George. “The trajectory approach for the end-to-end response
times with non-preemptive FP/EDF*”. Lecture Notes in Computer Science, Springer, 3647,
February 2006.
12. H. Badis and K. Al Agha. “Efficient Vertical Handoffs in Wireless Overlay Networks”.
Computing and Informatics, 24(5), 2005.
13. I. Gaw˛edzki and K. Al Agha. “Resilience to Dropping Nodes in Mobile Ad Hoc Networks with Link-State Routing”. In IFIP Networking 2008, Singapore, May 2008. Springer.
14. I. Gaw˛edzki and K. Al Agha. “Scalable Exchange of Packet Counters in OLSR”. In IFIP
Med-Hoc-Net’08, Palma de Mallorca, Spain, June 2008. Springer.
15. I. Ben Hamida and L. Boukhatem. “Optimised resource resevation in NEMO mobile
networks”. In ASWN : The 7th International Workshop on Applications and Services in Wireless Networks, Santander, Spain, May 2007.
16. A. Fourati and K. Al Agha. “An IDS First Line of Defense for Ad Hoc Networks”. In
IEEE WCNC’07 : Wireless Communications and Networking Conference, Hong Kong, China,
March 2007.
17. L. Friedman and L. Boukhatem. “Efficent multi-sink relocation in wireless networks”.
In ICNS : The third International Conference on Networking and Services, Greece, June 2007.
18. P. Minet, S. Martin, L. A. Saidane and S. Masmoudi. “Probabilistic or deterministic QoS
guarantees for flows scheduled with FP/DM”. In IASTED PDCN’07 : International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February
2007.
19. J. Rahmé, A. Carneiro Viana and K. Al Agha. “Avoiding energy-compromised hotspots
in resource-limited wireless networks”. In IEEE/IFIP IHN’07 : International conference on
Home Networking, Paris, France, October 2007.
20. T. M. Rasheed, U. Javaid, M. Jerbi and K. Al Agha. “Scalable Multi-hop Ad Hoc Routing Using Modified OLSR Routing Protocol”. In IEEE PIMRC’07 : Personal Indoors and
Mobile Radio Communications, Athens, Greece, September 2007.
21. T. M. Rasheed, L. Reynaud and K. Al Agha. “An Efficient Stable Clustering Algorithm
for Scalable Mobile Multi-hop Networks”. In IEEE CCNC’07 : Consumer Communications and Networking Conference, Las Vegas, USA, January 2007.
22. T. M. Rasheed, L. Reynaud and K. Al Agha. “Cluster-Quality Based Hybrid Routing in
Large Scale Mobile Multi-hop Networks”. In IEEE WCNC’07 : Wireless Communications
and Networking Conference, Hong Kong, China, March 2007.
23. L. A. Saidane, S. Azzaz, S. Martin and P. Minet. “FP/FIFO scheduling : deterministic
versus probabilistic QoS guarantees and p-schedulability”. In IEEE ICC’07 : International Conference on Communications, Glasgow, Scotland, June 2007.
24. D. Triantafyllidou and K. Al Agha. “Evaluation of TCP Performance in MANETs using
an Optimized Scalable Simulation Model”. In IEEE MASCOTS’07 : International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems,
Istanbul, Turkey, October 2007.
57
25. D. Triantafyllidou and K. Al Agha. “Evaluation of TCP Performance in MANETs using
an Optimized Scalable Simulation Model”. In WPMC’07 : International Symposium on
Wireless Personal Multimedia Communications, Jaipur, India, September 2007.
26. H. Badis and K. Al Agha. “CEQMM : A Complete and Efficient Quality of service
Model for MANETs”. In 3rd ACM PE-WASUN06, Malaga, Spain, October 2006. ACM.
27. A. Fourati and K. Al Agha. “Deploying auctions over Ad hoc networks”. In IEEE ICEBE’06 : International Conference on E-Business Engineering, Shanghai, China, October 2006.
IEEE PRESS.
28. I. Gaw˛edzki and K. Al Agha. “Proactive Resilience to Dropping Nodes in Mobile Ad
Hoc Networks”. In AINTEC : Asian Internet Engineering Conference, Bangkok, Thailande,
November 2006. Springer.
29. S. Martin and P. Minet. “Schedulability analysis of flows scheduled with FIFO : Application to the Expedited Forwarding class”. In IEEE WPDRTS’06 : International Workshop
on Parallel and Distributed Real-Time Systems, Island of Rhodes, Greece, April 2006.
30. S. Martin and P. Minet. “Worst case end-to-end response times of flows scheduled with
FP/FIFO”. In IEEE ICN’06 : International Conference on Networking, Mauritius, March 2006.
31. T. M. Rasheed, L. Reynaud, Y. Gourhant and K. Al Agha. “Reliability of Weight Metric Based Clustering Models in Large Scale Mobile Ad Hoc Networks”. In IASTED
Wireless Networks and Emerging Technologies Conference, Banff, Canada, July 2006.
32. T. M. Rasheed, L. Reynaud, U. Javaid and K. Al Agha. “Adaptive weighted Clustering
for Large Scale Mobile Ad Hoc Networking Systems”. In International Conference on
Wireless Algorithms, Systems and Applications, Xi’an, China, August 2006.
33. H. Badis and K. Al Agha. “Routing Bandwidth Guaranteed paths for QoS Flows in
Ad Hoc Networks under Interferences Influence”. In The First International IEEE CSIT
Conference, Algiers, Algeria, July 2005.
34. H. Badis, I. Ben Hamida, L. Boukhatem and K. Al Agha. “Integrartion of Mobile IPv6
and OLSR for Inter-MONET Communications”. In IFIP Med-Hoc-Net’05, France, June
2005.
35. I. Ben Hamida, H. Badis, L. Boukhatem and K. Al Agha. “Integration of Mobile-IPv6
and OLSR for Inter-MONET Communications”. In Med-Hoc-Net 2005 : Mediterranean
Ad Hoc Networking Workshop, Island of Porquerolles, France, June 2005. Springer.
36. I. Ben Hamida and L. Boukhatem. “A Time-based Bandwidth Reservation Scheme in
Cellular Networks”. In IFIP WOCN’05 : Wireless and Optical Communications Networks,
Dubai, UAE, March 2005. IFIP.
37. I. Ben Hamida and L. Boukhatem. “A channel reservation scheme using real-time users
mobility informations in cellular systems”. In WPMC’05 : Wireless Personal Multimedia
Communications, Aalborg, Denmark, September 2005. IEEE Publisher.
38. I. Ben Hamida, L. Boukhatem, M. Neifer and S. Touati. “Efficient resource reservation scheme with optimal channel requests classification in cellular systems”. In
PIMRC’05 : Personal Indoor and Mobile Radio Communications, Berlin, Germany, September
2005. IEEE Publisher.
39. A. Fourati and K. Al Agha. “Security Vulnerabilities Analysis of the OLSR Routing
Protocol”. In IEEE ICT’ 05 : International Conference on Telecommunications, Cape Town,
South Africa, May 2005.
40. A. Fourati, K. Al Agha and T. Claveirole. “Securing OLSR Routes”. In AINTEC : Asian
Internet Engineering Conference, Bangkok, Thailande, December 2005. Springer.
58
41. S. Martin and P. Minet. “Holistic and trajectory approaches for distributed nonpreemptive FP/DP* scheduling”. In IEEE ICN’05 : International Conference on Networking,
Reunion Island, April 2005.
42. S. Martin, P. Minet and L. George. “Deterministic QoS guarantees for multicast multimedia applications”. In IEEE ICNS’05 : International Conference on Networking and Services, Tahiti, French Polynesia, October 2005.
43. S. Martin, P. Minet and L. George. “Improving non-preemptive Fixed Priority scheduling with Dynamic Priority as secondary criterion”. In RTS’05 : International Conference
on Real-Time Systems, Paris, France, April 2005.
44. P. Minet, L. A. Saidane and S. Martin. “Coexistence of deterministic and probabilistic
QoS guarantees for real-time traffics”. In IEEE SPECTS’05 : International Symposium
on Performance Evaluation of Computer and Telecommunication Systems, Philadelphia, USA,
July 2005.
45. L. A. Saidane, P. Minet, S. Martin and I. Korbi. “Deterministic and probabilistic QoS
guarantees for real-time traffics in a DiffServ/MPLS architecture”. In IEEE MASCOTS’05 : International Symposium on Modeling, Analysis, and Simulation of Computer and
Telecommunication Systems, Atlanta, USA, September 2005.
46. L. George, P. Minet and S. Martin. “A family of multicast protocols preserving consistency constraints”. In CDUR’05 : Journées francophones sur la Cohérence des Données en
Univers Réparti, Paris, France, November 2005.
47. I. Gaw˛edzki and K. Al Agha. “Detecting Intentional Packet Loss in OLSR”. In The 3rd
OLSR Interop and Workshop, Tokyo, Japan, September 2006.
48. I. Ben Hamida and L. Boukhatem. “An efficient channel reservation scheme in cellular
systems”. In MAN’05 : Metropolitan Area Networks, Ho Chi Minh city, Vietnam, April
2005. IFIP.
49. A. Fourati and K. Al Agha. “A completely distributed and auto-organized algorithm
securing the OLSR routing protocol”. In IFIP MAN : Open Conference on Metropolitan
Area Networks, HCMC, Viet Nam, April 2005.
50. A. Fourati and K. Al Agha. “A threshold cryptography-based algorithm for securing
the OLSR routing protocol”. In Third Exotic Workshop, Belize, March 2005.
51. I. Gaw˛edzki, H. Badis and K. Al Agha. “Link capacity estimation in QOLSR”. In The
2nd OLSR Interop and Workshop, Paris, France, July 2005.
52. T. M. Rasheed, L. Reynaud and K. Al Agha. “A Stable Clustering Scheme for Large
Scale Mobile Ad Hoc Networks”. In IEEE Sarnoff Symposium, NJ, USA, March 2005.
59
53. T. M. Rasheed. “Routage ad hoc hiérarchique avec qualité de service”. Université de
Paris-Sud XI, February 22 2008.
54. I. Ben Hamida. “Mobilité groupée des réseaux MONET - Gestion de mobilité et réservation de ressources”. Université de Paris-Sud XI, October 31 2006.
55. H. Badis. “Étude et conception d’algorithmes pour les réseaux mobiles et ad hoc”.
Université de Paris-Sud XI, December 2 2005.
56. H. Badis and K. Al Agha. Optimal path selection in ad hoc networks based on multiple metrics :
bandwidth and delay, Advances in Wireless Networks and Mobile Computing, Springer,
2008. pp. 35-60.
57. H. Badis and K. Al Agha. “Quality of Service The for Ad hoc Optimized Link State
Routing Protocol (QOLSR)”. IETF : The Internet Engineering Task Force, March 2007.
Model for MANETs”. IETF : The Internet Engineering Task Force, March 2007.
Model for MANETs”. IETF : The Internet Engineering Task Force, April 2006.
Routing Protocol (QOLSR)”. IETF : The Internet Engineering Task Force, October 2006.
Routing Protocol (QOLSR)”. IETF : The Internet Engineering Task Force, March 2006.
Model for MANETs”. IETF : The Internet Engineering Task Force, October 2006.
63. A. Fourati and K. Al Agha. Securing Ad hoc Networks, Handbook on Mobile Ad Hoc and
Pervasive Communications, American Scientific Publishers, 2006.
64. H. Badis and K. Al Agha. “Quality of Service for Ad hoc Optimized Link State Routing
Protocol (QOLSR)”. IETF : Internet Engineering Task Force, draft-badis-manet-qolsr-02.txt,
November 2005. Draft IETF.
65. H. Badis and K. Al Agha. “Quality of Service for Ad hoc Optimized Link State Routing
Protocol (QOLSR)”. IETF : Internet Engineering Task Force, draft-badis-manet-qolsr-01.txt,
August 2005. Draft IETF.
66. L. A. Saidane, P. Minet, S. Martin and I. Korbi. “Deterministic and probabilistic
QoS guarantees for the EF class in a DiffServ/MPLS domain”. Technical Report
5622, INRIA : Institut National de Recherche en Informatique et en Automatique,
http ://www.inria.fr/rrrt/rr-5622.html, July 2005.
60
Apprentissage et optimisation
1. A. Cornuéjols and M. Sebag. “A note on phase transition and computational pitfalls
of learning from sequences”. Journal of Intelligent Information Systems, 2008.
2. S. Gelly, S. Ruette and O. Teytaud. “Comparison-based Algorithms are Robust and
Randomized Algorithms are Anytime”. Evolutionary Computation Journal, 15(4) :411-434,
2007.
3. F. Mareuil, C. Sizun, J. Perez, M. Schoenauer, J-Y. Lallemand and F. Bontems. “A simple
genetic algorithm for the optimization of multidomain protein homology models driven by NMR residual dipolar coupling and small angle X-ray scattering data”. European Biophysics Journal, 37 :95-104, 2007.
4. O. Teytaud. “On the hardness of offline multiobjective optimization”. Evolutionary
Computation Journal, 15(4) :475-491, 2007.
5. A. Auger, P. Chatelain and K. P. “R-leaping : Accelerating the stochastic simulation
algorithm by reaction leaps”. J. Chem. Phys., 125, 2006.
6. N. Bredeche, Z. Shi and J-D. Zucker. “Perceptual Learning and Abstraction in Machine
Learning : an application to autonomous robotics”. IEEE Transactions on Systems, Man
and Cybernetics, part C, 36(2) :172-181, 2006.
7. C. Germain-Renaud, C. Loomis, J. Moscicki and R. Texier. “Scheduling for Responsive
Grids”. Journal of Grid Computing, 2006.
8. A. Moreau, O. Teytaud and J-P. Bertoglio. “Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models”. Physics of fluids,
18, 2006.
9. A. Auger. “Convergence results for (1,λ)-SA-ES using the theory of ϕ-irreducible Markov chains”. Theoretical Computer Science, 334(1-3) :35–69, 2005.
of protein-protein recognition”. Journal Physical Biology, 2005.
11. C. Germain, V. Breton, P. Clarysse, Y. Gaudeau, T. Glatard, E. Jeannot, Y. Legré, C. Loomis, J. Montagnat, J-M. Moureaux, A. Osorio, X. Pennec and R. Texier. “Grid-enabling
medical image analysis”. Journal of Clinical Monitoring and Computing, 19(4-5) :339-349,
2005. Extended version of the BioGrid 2005 paper.
12. C. Germain, R. Texier and A. Osorio. “Exploration of Medical Images on the Grid”.
Methods of Information in Medecine, 44(2) :227-232, 2005.
13. L. Jarlan, E. Mougin, P. Mazzega, M. Schoenauer, Y. Tracol and P. Hiernaux. “Using
coarse remote sensing radar observations to control the trajectory of a simple Sahelian
land surface model”. Remote Sensing of Environment, 94(2) :269-285, 2005.
61
14. S. Gelly and R. Munos. “L’Ordinateur, champion de go ?” Pour la science, 354 :28-35,
2007.
15. S. Gelly and O. Teytaud. “Bayesian Networks : a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure”. Revue d’Intelligence
Artificielle, 20(6) :717-755, 2006.
16. S. Gelly, O. Teytaud, N. Bredeche and M. Schoenauer. “Universal Consistency and Bloat
in GP”. Revue d’Intelligence Artificielle, 20(6) :805-827, 2006.
17. A. et CGermain. “A channel memory based environment for MPI applications”. Future
Generation Computer Systems, 21(5) :709-715, 2005.
18. P. Morel, H. Hamda and M. Schoenauer. “Computational Chair Design using Genetic
Algorithms”. Concept, 71(3) :95-99, 2005.
19. P. Caillou, T. Baptista and C. Curchod. “Multi-agent Based simulation for DecisionMaking : an application to Rungis food market”. In J. P. C. Joao Climaco, editor, GDN
2008, pages 193-194, Coimbra Portugal, 2008.
20. N. Bredeche. “A Multi-Cellular Developmental System in Continuous Space using
Cell Migration”. In Simulation of Adaptive Behavior, Osaka Japon, 2008.
21. L. Da Costa, Á. Fialho, M. Schoenauer and M. Sebag. “Adaptive Operator Selection
with Dynamic Multi-Armed Bandits”. In Genetic and Evolutionary Conference (GECCO),
Atlanta United States, 2008. ACM. I. : Computing Methodologies/I.2 : ARTIFICIAL INTELLIGENCE/I.2.8 : Problem Solving, Control Methods, and Search.
22. Á. Fialho, L. Da Costa, M. Schoenauer and M. Sebag. “Extreme Value Based Adaptive Operator Selection”. In Parallel Problem Solving from Nature (PPSN’08), Dortmund
Germany, 2008.
23. S. Gelly, J-B. Hoock, A. Rimmel, O. Teytaud and Y. Kalemkarian. “On the Parallelization
of Monte-Carlo planning”. In Icinco, Madeira Portugal, 2008.
24. N. Hansen. “Adaptive Encoding : How to Render Search Coordinate System Invariant”. In Parallel Problem Solving from Nature (PPSN’08), Dortmund Germany, 2008.
25. M. Jebalia and A. Auger. “On multiplicative noise models for stochastic search”. In
Parallel Problem Solving from Nature (PPSN’08), dortmund Germany, 2008.
26. F. Jiang, H. Berry and M. Schoenauer. “Supervised and Unsupervised Evolutionary
Learning of Echo State Networks”. In Parallel Problem Solving from Nature (PPSN’08),
2008. to appear.
27. M. Nicolau and M. Schoenauer. “Evolving Scale-free Topologies Using a Gene Regulatory Network Model”. In IEEE Congress on Evolutionary Computation, 2008.
62
28. J. Perez, C. Germain Renaud, B. Kégl and C. Loomis. “Utility-based Reinforcement
Learning for Reactive Grids”. In The 5th IEEE International Conference on Autonomic Computing, Chicago États-Unis, 2008.
29. C. Germain Renaud, J. Perez, B. Kégl and C. Loomis. “Grid Differentiated Services :
a Reinforcement Learning Approach”. In 8th IEEE International Symposium on Cluster
Computing and the Grid, Lyon France, 2008.
30. R. Ros and N. Hansen. “A Simple Modification in CMA-ES Achieving Linear Time
and Space Complexity”. In Parallel Problem Solving from Nature (PPSN’08), Dortmund
Germany, 2008.
31. O. Teytaud. “When does quasi-random work ?” In Parallel Problem Solving from Nature
(PPSN’08), Dortmund Allemagne, 2008.
32. O. Teytaud and H. Fournier. “Lower bounds for evolution strategies using VCdimension”. In Parallel Problem Solving from Nature (PPSN’08), pages 10 pages, Dortmund Allemagne, 2008.
33. X. Zhang, C. Furtlehner and M. Sebag. “Data Streaming with Affinity Propagation”. In
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery
in Databases, Antwerp Belgium, 2008.
34. A. Auger and O. Teytaud. “Continuous lunches are free !” In D Thierens et al, editor,
Genetic and Evolutionary Conference (GECCO), pages 916-921, London Royaume-Uni, 2007.
35. N. Baskiotis, M. Sebag, M-C. Gaudel and S-D. Gouraud. “A Machine Learning approach
for Statistical Software Testing”. In International Joint Conference on Artificial Intelligence
(IJCAI’07), pages 2274-2279, 01 2007.
36. N. Baskiotis and M. Sebag. “Structural Statistical Software Testing with Active Learning in a Graph”. In 17th Annual International Conference on Inductive Logic Programming,
Oregon États-Unis d’Amérique, 2007.
37. P. Caillou, F. Dubut and M. Sebag. “Economy-driven Shaping of Social Networks and
Emerging Class Behaviors”. In A. Consiglio, editor, Artificial Economics 2007 Artificial
Markets Modeling LNEMS, volume 599 of LNEMS, pages 195-208, Palerme Italie, 2007.
Springer Verlag.
38. P. Caillou, M. Sebag and F. Dubut. “Negotiation protocols and dynamic social networks”. In Multi-Agents for modeling Complex Systems (MA4CS’07) Satellite Workshop of
the European Conference on Complex Systems (ECCS’07), Dresde Allemagne, 2007.
39. A. Devert, N. Bredèche and M. Schoenauer. “Robust Multi-Cellular Developmental
Design”. In D Thierens et al, editor, Genetic and Evolutionary Conference (GECCO), pages
982-989, London, 07 2007. ACM SIGEVO, ACM Press.
40. C. Furtlehner, J-M. Lasgouttes and A. De La Fortelle. “A Belief Propagation Approach
to Traffic Prediction using Probe Vehicles”. In 10th International IEEE Conference on Intelligent Transportation Systems, pages pp. 1022-1027, Seattle États-Unis d’Amérique, 10
2007. 6 pages, 5 figures.
41. C. Gagné, M. Sebag, M. Schoenauer and M. Tomassini. “Ensemble Learning for Free
with Evolutionary Algorithms ?” In D Thierens et al, editor, Genetic and Evolutionary Conference (GECCO), pages 1782-1789, London Royaume-Uni, 2007. ACM SIGEVO,
ACM.
42. R. Gaudel, M. Sebag and A. Cornuéjols. “A Phase Transition-Based Perspective on
Multiple Instance Kernels”. In 17th Annual International Conference on Inductive Logic
Programming, Corvallis États-Unis d’Amérique, 2007. Jude Shavlik, Hendrik Blockeel,
Prasad Tadepalli.
63
43. S. Gelly and D. Silver. “Combining Online and Offline Knowledge in UCT”. In Z.
Ghahramani, editor, Proceedings of the 24th Annual International Conference on Machine
Learning (ICML 2007), pages 273–280, 2007. Omnipress.
44. C. Hartland and N. Bredèche. “Using Echo State Networks for Robot Navigation Behavior Acquisition”. In ROBIO 07, Sanya Chine, 2007.
45. M. Jebalia, A. Auger, M. Schoenauer, F. James and M. Postel. “Identification of the Isotherm Function in Chromatography Using CMA-ES”. In IEEE International Conference
on Evolutionary Computation (CEC’07), pages 1879-1886, Singapour, 2007.
46. F. Jiang, H. Berry and M. Schoenauer. “Optimising the topology of complex neural
networks”. In Jürgen Jost, editor, ECCS’07, Dresden Allemagne, 2007. Complex Systesms
Society.
47. S. Kern, N. Hansen and P. Koumoutsakos. “Fast Quadratic Local Meta-Models for Evolutionary Optimization of Anguilliform Swimmers”. In Neittaanmaki and others, editors, EUROGEN 2007, Helsinki Finlande, 2007.
48. O. Teytaud and A. Auger. “On the adaptation of the noise level for stochastic optimization”. In IEEE International Conference on Evolutionary Computation (CEC’07), pages
2030,2037, Singapour, 2007.
49. O. Teytaud and S. Gelly. “DCMA, yet another derandomization in covariance-matrixadaptation”. In D Thierens et al, editor, Genetic and Evolutionary Conference (GECCO),
pages 955-922, London Royaume-Uni, 2007.
50. O. Teytaud and S. Gelly. “Non linear programming for stochastic dynamic programming”. In Icinco 2007, Angers France, 2007.
51. O. Teytaud, S. Gelly and J. Mary. “Active learning in regression, with an application to
stochastic dynamic programming”. In Icinco 2007, Angers France, 2007.
52. C. Tijus, N. Brèdeche, Y. Kodratoff, M. Felkin, C. Hartland, E. Zibetti and V. Besson.
“Human Heuristics for a Team of Mobile Robots”. In IEEE International Conference on
Research, Innovation and Vision for the Future, pages pp.122-129, Hanoi Viet Nam, 2007.
53. X. Zhang, M. Sebag and C. Germain Renaud. “Toward Behavioral Modeling of a Grid
System : Mining the Logging and Bookkeeping files”. In DSMM07, Omaha États-Unis
d’Amérique, 2007.
54. A. Devert, N. Bredeche and M. Schoenauer. “Evolutionary Design of Buildable Objects
with BlindBuilder : an Empirical Study”. In Asia-Pacific Workshop on Genetic Programming, Proceedings of the Third Asian-Pacific workshop on Genetic Programming, pages
98–109, Hanoi, Vietnam, 2006. The Long Pham and Hai Khoi Le and Xuan Hoai Nguyen.
55. A. Devert, N. Bredeche and M. Schoenauer. “BlindBuilder : a new encoding to evolve
Lego-like structures”. In European Conference on Genetic Programming (EUROGP’06), volume 3905 of Lecture Notes in Computer Science, pages 61–72, Budapest, Hungary, 2006.
56. C. Gagné, M. Schoenauer, M. Parizeau and M. Tomassini. “Genetic Programming, Validation Sets, and Parsimony Pressure”. In P. C. et al, editor, European Conference on
Genetic Programming (EUROGP’06), volume 3905 of Lecture Notes in Computer Science,
pages 109-120, Budapest, Hongrie, 2006. Springer Verlag.
57. C. Gagné, M. Schoenauer, M. Sebag and M. Tomassini. “Genetic Programming for
Kernel-based Learning with Co-evolving Subsets Selection”. In T. E. A. Runarsson,
editor, Parallel Problem Solving from Nature (PPSN’06), number 4193 in LNCS, pages 10081017, Reykjavik, 2006. Springer Verlag.
64
58. S. Gelly, J. Mary and O. Teytaud. “Learning for stochastic dynamic programming”. In
11th European Symposium on Artificial Neural Networks (ESANN), bruges Belgium, 2006.
59. S. Gelly, J. Mary and O. Teytaud. “On the ultimate convergence rates for isotropic
algorithms and the best choices among various forms of isotropy”. In Parallel Problem
Solving from Nature, number 4193 in LNCS, pages 32-41, Reykjavik, 2006.
60. S. Gelly, O. Teytaud and C. Gagné. “Resource-Aware Parameterizations of EDA”. In
IEEE International Conference on Evolutionary Computation (CEC’06), Vancouver, BC, Canada, 2006.
61. C. Hartland and N. Bredeche. “Evolutionary Robotics : From Simulation to the Real
World using Anticipation”. In ABIALS, Rome/Italie, 2006.
62. C. Hartland and N. Bredèche. “Evolutionary Robotics, Anticipation and the Reality
Gap”. In ROBIO, pages 1640-1645, Kunming/Chine, 2006.
63. L. Hugues and N. Bredeche. “Simbad : an Autonomous Robot Simulation Package
for Education and Research”. In Simulation of Adaptive Behavior (SAB 2006), Rome, Italy,
2006.
64. V. Krmicek and M. Sebag. “Functional Brain Imaging with Multi-Objective MultiModal Evolutionary Optimization”. In T. R. et al, editor, Parallel Problem Solving from
Nature, number 4193 in LNCS, pages 382-391, Reykjavik, 2006. Springer Verlag.
65. M. Schoenauer, P. Savéant and V. Vidal. “Divide-and-Evolve : a New Memetic Scheme
for Domain-Independent Temporal Planning”. In J. Gottlieb and G. Raidl, editors, European Conf. on Evolutionary Computation in Combinatorial Optimization (EvoCOP’06), number
3906 in LNCS, pages 247-260, Budapest, 2006. Springer Verlag.
66. Y. Semet and M. Schoenauer. “On the Benefits of Inoculation, an Example in Train
Scheduling”. In C. M. et al, editor, Genetic and Evolutionary Conference (GECCO), pages
1761-1768, Seattle, 2006. ACM Press.
67. O. Teytaud. “Why Simulation-Based Approachs with Combined Fitness are a Good
Approach for Mining Spaces of Turing-equivalent Functions”. In IEEE International
Conference on Evolutionary Computation (CEC’06), 2006.
68. O. Teytaud and S. Gelly. “General lower bounds for evolutionary algorithms”. In Parallel Problem Solving from Nature (PPSN’06), number 4193 in LNCS, pages 21-31, Reykjavik,
2006.
69. A. Auger, M. Schoenauer and O. Teytaud. “Local and global oder 3/2 convergence of
a surrogate evolutionary algorithm”. In Genetic and Evolutionary Conference (GECCO),
pages 857-864, Washington, 2005.
70. N. Bredeche and L. Hugues. “Evolutionary Robotics : incremental learning of sequential behavior”. In Fourth IEEE International Conference on Development and Learning (ICDL
2005), 2005.
71. N. Bredeche and L. Hugues. “Speeding up Learning with Dynamic Environment Shaping in Evolutionary Robotics”. In Fifth international Workshop of Epigenetic Robotics (Epirob2005), pages 137-138, 2005.
72. S. Gelly, N. Bredeche and M. Sebag. “From Factorial and Hierarchical HMM to Bayesian
Network : A Representation Change Algorithm.” In SARA, pages 107-120, 2005.
73. S. Gelly, O. Teytaud, N. Bredeche and M. Schoenauer. “A statistical learning theory
approach of Bloat”. In Genetic and Evolutionary Conference (GECCO), pages 1783-1784,
Washington, 2005. ACM Press.
65
74. C. Germain-Renaud and D. Monnier-Ragaigne. “Grid Result Checking”. In Conf. Computing Frontiers, pages 87-96, 2005. ACM.
75. C. Kavka, P. Roggero and M. Schoenauer. “Evolution of Voronoi based fuzzy recurrent
controllers”. In H-G. E. A. Beyer, editor, Genetic and Evolutionary Conference (GECCO),
pages 1385-1392, 2005. ACM-SIGEVO, ACM Press.
76. S. Landau, O. Sigaud and M. Schoenauer. “ATNoSFERES revisited”. In H-G. E. A. Beyer,
editor, Genetic and Evolutionary Conference (GECCO), pages 1867-1874, Washington DC,
June 25-29 2005. ACM Press.
77. N. Pernot, A. Cornuéjols and M. Sebag. “Phase transition in grammatical inference”. In
International Joint Conference on Artificial Intelligence (IJCAI’05), pages 811-816, Edinburgh,
UK, 2005.
78. M. Sebag, N. Tarrisson, O. Teytaud, J. Lefevre and S. Baillet. “A multi-objective multimodal optimisation approach for mining stable spatio-temporal patterns”. In International Joint Conference on Artificial Intelligence (IJCAI’05), pages 6p, 2005.
79. Y. Semet and M. Schoenauer. “An efficient memetic, permutation-based evolutionary
algorithm for real-world train timetabling”. In B. M. et al, editor, IEEE International
Conference on Evolutionary Computation (CEC’05), pages 661-667, 2005. IEEE Press.
80. V. Singh, M. Schoenauer and M. Léger. “A geologically-sound representation for evolutionary multi-objective subsurface identification”. In B. M. et al, editor, IEEE International Conference on Evolutionary Computation (CEC’05), pages 454-462, 2005. IEEE Press.
81. V. P. Singh, M. Leger and M. Schoenauer. “Foothill Simulation using multi-objective
evolutionary Algorithms”. In AAPG’05, 2005. American Association of Petroleum Geologists.
82. A. Termier, M-C. Rousset, M. Sebag, K. Ohara, T. Washio and H. Motoda.
“Computation-time efficient and robust attribute tree mining with DryadeParent”.
In ECML/PKDD’05, 2005.
83. A. Termier, M-C. Rousset, M. Sebag, K. Ohara, T. Washio and H. Motoda. “Efficient
Mining of High Branching Factor Attribute Trees”. In ICDM 2005, 2005. IEEE Press.
84. L. Fedon and A. Cornuéjols. “Comment optimiser A ? adaptatif ?” In 16th congrès Reconnaissance des Formes et Intelligence Artificielle (RFIA’08), Amiens France, 2008.
85. O. Teytaud. “On the almost optimality of blind active sampling.” In Conférence d’Apprentissage, Porquerolles France, 2008.
86. X. Zhang, C. Furtlehner and M. Sebag. “Frugal and Online Affinity Propagation”. In
Conférence d’Apprentissage, Ile de Porquerolles France, 2008.
87. X. Zhang, M. Sebag and C. Germain. “Le modelage des travaux d’un Système de
Grille”. In 16th congrès Reconnaissance des Formes et Intelligence Artificielle (RFIA’08),
Amiens France, 2008.
88. N. Baskiotis, M. Sebag and O. Teytaud. “Inductive-deductive systems : a mathematical logic and statistical learning perspective”. In Conférence d’Apprentissage, Grenoble
France, 2007. Cepadues.
66
89. R. Gaudel, M. Sebag and A. Cornuéjols. “A Phase Transition-based Perspective on Multiple Instance Kernels”. In Conférence d’Apprentissage, pages 173–186, Grenoble France,
2007. Jean-Daniel Zucker, Antoine Cornuéjols.
90. C. Hartland, N. Baskiotis, S. Gelly, M. Sebag and O. Teytaud. “Change Point Detection
and Meta-Bandits for Online Learning in Dynamic Environments”. In J. Zucker and
A. Cornuéjols, editors, Conférence d’Apprentissage, pages 237-250, 2007. Cepadues.
91. O. Teytaud, S. Gelly and M. Sebag. “Anytime many-armed bandits”. In Conférence d’Apprentissage, Grenoble France, 2007. Cepadues.
92. N. Baskiotis, M. Sebag and O. Teytaud. “Inductive-deductive systems : a learning
theory point of view”. In Conférence d’Apprentissage, pages 2, 2005.
of protein-protein recognition”. In JOBIM’05, 2005.
94. A. Cornuéjols, C. Froidevaux and J. Mary. “Comparing and combining feature estimation methods for the analysis of microarray data”. In JOBIM-05 : Journées Ouvertes
Biologie Informatique Mathématiques, Lyon, France, 2005.
95. S. Gelly, N. Bredeche and M. Sebag. “HMM hiérarchiques et factorisés : mécanisme
d’inférence et apprentissage à partir de peu de données.” In Conférence d’Apprentissage,
pages 143-144, 2005.
96. S. Gelly and O. Teytaud. “Bayesian networks : a better than frequentist approach for
parametrization, and a more accurate structural complexity measure than the number
of parameters”. In Conférence d’Apprentissage, pages 147-162, Nice, 2005.
97. N. Pernot, A. Cornuéjols and M. Sebag. “Phase transition in grammatical inference”.
In Conférence d’Apprentissage, pages 49-60, Nice, 2005.
98. L. Chatriot, S. Gelly, J-B. Hoock, J. Perez, A. Rimmel and O. Teytaud. “Introduction de
connaissances expertes en Bandit-Based Monte-Carlo Planning avec application au
Computer-Go”. In JFPDA, Metz France, 2008.
99. N. Hansen, A. Niederberger, L. Guzzella and P. Koumoutsakos. “Evolutionary Optimization of Feedback Controllers for Thermoacoustic Instabilities”. In IUTAM Symposium on Flow Control and MEMS, London United Kingdom, 2008.
100. P. Caillou, F. Dubut and M. Sebag. “Prêts bilatéraux et réseaux sociaux”. In Modelling
and learning in Social and Human Sciences MASHS 07, Brest France, 2007.
101. L. DaCosta and M. Schoenauer. “GUIDE, a Graphical User Interface for Evolutionary
Algorithms Design”. In J. H. Moore, editor, GECCO Workshop on Open-Source Software
for Applied Genetic and Evolutionary Computation (SoftGEC), 2007.
102. A. Devert, N. Brèdeche and M. Schoenauer. “Unsupervised Learning of Echo State
Networks : A case study in Artificial Embryogeny.” In Artificial Evolution, pages 12
pages, Tours France, 2007.
103. C. Furtlehner and J-M. Lasgouttes. “A queueing theory approach for a multi-speed
exclusion process.” In Traffic and Granular Flow ’07, pages to appear, Orsay France, 10
2007. 10 pages, 6 figures.
67
104. R. Gaudel and A. Cornuéjols. “Combining feature ranking methods for high dimensional data analysis”. In 5th Workshop on Statistical Methods for Post-Genomic Data, Paris
France, 2007.
105. M. Jebalia, A. Auger and P. Liardet. “Log-linear Convergence and Optimal Bounds for
the (1 + 1)-ES”. In N. Montmarché et al, editor, Artificial Evolution, volume 4926/2008 of
Lecture Notes in Computer Science, pages 207-218, Tours France, 2007. Springer Verlag.
106. J. Perez, C. Germain Renaud and B. Kégl. “Predicting Bounds on Queuing Delay in the
EGEE grid”. In 2nd EGEE User Forum, Manchester Royaume-Uni, 2007.
107. D. Tessier, M. Schoenauer, C. Biernacki, G. Celeux and G. Govaert. “Parameter Setting
for Evolutionary Latent Class Clustering”. In Lishan Kang, Yong Liu and Sanyou Y
Zeng, editors, Second International Symposium, ISICA 2007 LNCS, volume 4683 of LNCS,
pages 472-484, Wuhan Chine, 2007. Springer Verlag.
108. O. Teytaud. “Slightly beyond Turing-Computability for studying Genetic Programming”. In MCU’07, Orléans France, 2007.
109. O. Teytaud. “Conditionning, halting criteria and choosing lambda”. In Artificial Evolution, Tours France, 2007.
110. X. Zhang, M. Sebag and C. Germain Renaud. “Fault Detection and Diagnosis from the
Logging and Bookkeping Data”. In 2nd EGEE User Forum, Manchester Royaume-Uni,
2007.
111. N. Baskiotis, M. Sebag, M-C. Gaudel and S-D. Gouraud. “EXIST : Exploitation/Exploration Inference for Statistical Software Testing”. In On-line Trading of Exploration and Exploitation, NIPS 2006 Workshop, Whistler, BC, Canada, 2006.
112. A. Cornuéjols and F. Thollard. “Artificial data and language theory”. In GI workshop
2006. Grammatical inference : workshop on open problems and new directions, 21/11/2005, SaintEtienne, France, 2006. Colin de la Higuera.
113. S. Gelly, S. Ruette and O. Teytaud. “Comparison-based algorithms : worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in EDA,
and implementations with billiards”. In Parallel Problem Solving from Nature – BTPWorkshop, Reykjavik, 2006.
114. S. Gelly and O. Teytaud. “OpenDP a free Reinforcement Learning toolbox for discrete
time control problems”. In NIPS Workshop on Machine Learning Open Source Software,
Whistler (B.C.), 2006.
115. S. Gelly and Y. Wang. “Exploration-Exploitation in Go : UCT for Monte-Carlo-Go.”
2006.
116. C. Germain-Renaud. “Scheduling for Interactive Grids”. In First EGEE User Forum,
Genève/Suisse, 2006.
117. C. Germain-Renaud, C. Loomis, R. Texier and A. Osorio. “Grid Scheduling for Interactive Analysis”. In HealthGrid 2006, volume 120 of in : Studies in Health Technology
and Informatics, Challenges and Opportunities of Health Grids, pages 25-33, Valencia/Spain,
2006. IOS Press.
118. C. Hartland, S. Gelly, N. Baskiotis, O. Teytaud and M. Sebag. “Multi-armed Bandit,
Dynamic Environments and Meta-Bandits”. 2006.
119. T. Heitz. “Modélisation du prétraitement des textes”. In JADT’06 (International Conference on Statistical Analysis of Textual Data), volume 1 of Proceedings of JADT’06, pages
499-506, Besançon, France, 2006.
68
120. T. Heitz, J. Azé, M. Roche, A. Mela, P. Peinl and M. Amar Djalil. “Présentation de
DEFT 06 (DÉfi Fouille de Textes)”. In Atelier DEFT’06 - SDN’06 (Semaine du Document
Numérique), Actes de l’atelier DEFT’06, SDN’06 (Semaine du Document Numérique),
pages 1-10, Fribourg, Suisse, 2006.
121. S. Lallich, O. Teytaud and E. Prudhomme. “Statistical inference and data mining : false
discoveries control”. In proceedings of the 17th COMPSTAT Symposium of the IASC, 2006.
122. M. Schoenauer, P. Savéant and V. Vidal. “Divide-and-Evolve : une nouvelle métaheuristique pour la planification temporelle indépendante du domaine”. In F. G. et
Gérard Verfaillie, editor, Journées Francophones Planification, Décision, Apprentissage, Toulouse, 2006. GDR I3 groupe PDMIA.
123. O. Teytaud. “How entropy-theorems can show that approximating high-dim Paretofronts is too hard”. In Bridging the Gap between Theory and Practice - Workshop PPSN-BTP,
2006.
124. O. Teytaud, S. Gelly, S. Lallich and E. Prudhomme. “Quasi-random resamplings, with
applications to rule extraction, cross-validation and (su-)bagging.” 2006.
125. E. Alphonse, A. Amrani, J. Azé, A-D. M. Thomas Heitz and M. Roche. “Préparation des
données et analyse des résultats de DEFT’05”. In DEFT’05, 2005.
126. A. Amrani, J. Azé and Y. Kodratoff. “Logiciel d’aide à l’étiquetage morpho-syntaxique
de textes de spécialité”. Session Démonstration de logiciels, EGC 2005, 2005.
127. J. Azé, M. Roche, Y. Kodratoff and M. Sebag. “Preference Learning in Terminology
Extraction : A ROC-based approach”. In Applied Stochastic Models and Data Analysis –
ASMDA’05, 2005.
128. J. Azé, M. Roche and M. Sebag. “Bagging Evolutionary ROC-based Hypotheses Application to Terminology Extraction”. In ROCML 05, 2005.
129. Y. Bonnemay, M. Sebag and O. Teytaud. “Convergence proofs, convergence rates and
stopping criterions for multi-modal or multi-objective evolutionary algorithms”. In
Artificial Evolution, Lille, 2005.
130. A. Cornuéjols and M. Sebag. “Phase transition and inductive learning”. In Second
Franco-Japanese Workshop on Information Search, Integration and Personalization (ISIP-05),
Lyon, France, 2005.
131. S. Gelly, N. Bredeche and M. Sebag. “Inference dans les HMM hierarchiques et factorises : changement de representation vers le formalisme des Reseaux Bayesien”. In
EGC, Atelier sur les Modèles Graphiques Probabilistes, pages 35-44, 2005.
132. S. Gelly, J. Mary and O. Teytaud. “Taylor-based pseudo-metrics for random process
fitting in dynamic programming.” In PDMIA, pages 21-36, Lille, 2005.
133. C. Germain, V. Breton, P. Clarysse, Y. Gaudeau, T. Glatard, E. Jeannot, Y. Legré, C. Loomis, J. Montagnat, J-M. Moureaux, A. Osorio, X. Pennec and R. Texier. “Grid-enabling
medical image analysis”. In 3rd Bio-Grid Workshop at IEEE CCGRID, 2005.
134. O. Teytaud, M. Jebalia and A. Auger. “XSE : Quasi-random mutations for evolution
strategies”. In E. T. et al, editor, Artificial Evolution, volume 3871 of Lecture Notes in Computer Science, pages 296-307, 2005. Springer Verlag.
135. S. Gelly. “Une contribution à l’apprendissage par renforcement ; application au Computer GO”. Université Paris-Sud, September 2007.
69
136. C. Kavka. “Evolutionary Design of Geometric-Based Fuzzy Systems”. Université ParisSud, 2006.
137. V. P. Singh. “Automatic Seismic Velocity Inversion using Multi-Objective Evolutionary Algorithms”. École des Mines de Paris, 2006.
138. C. Germain-Renaud. “Contributions à la modélisation et à l’optimisation des systèmes
de calcul à grande échelle”. 2005.
139. N. Godzik. “Une approche évolutionnaire de la robotique modulaire et anticipative”.
Université de Paris Sud – Orsay, 2005.
140. J. Maloberti. “Improving Inductive Logic Programming with Constraint Satisfaction
Techniques : Applications to Frequent Query Discovery”. Université de Paris Sud –
Orsay, 2005.
141. J. Mary. “Étude de l’apprentissage actif. Application à la conduite d’expériences”. Université de Paris Sud – Orsay, 2005.
142. N. Hansen, A. Niederberger, L. Guzzella and P. Koumoutsakos. “A Method for Handling Uncertainty in Evolutionary Optimization with an Application to Feedback
Control of Combustion”. IEEE Transactions on Evolutionary Computation, 2009.
143. N. Hansen. “CMA-ES with Two-Point Step-Size Adaptation”. Research Report RR6527, INRIA, 2008.
144. N. Hansen. “Adaptive Encoding for Optimization”. Research Report RR-6518, INRIA,
2008.
145. N. Hansen, R. Ros, N. Mauny, M. Schoenauer and A. Auger. “PSO Facing NonSeparable and Ill-Conditioned Problems”. Research Report RR-6447, INRIA, 2008.
146. C. Germain Renaud, E. Vazquez and D. Colling. “Towards a statistical model of EGEE
load”. In 3rd EGEE User Forum, Clermont-Ferrand France, 2008. EGEE-II project.
147. R. Ros and N. Hansen. “A Simple Modification in CMA-ES Achieving Linear Time
and Space Complexity”. Research Report RR-6498, INRIA, 2008.
148. A. Termier, M-C. Rousset, M. Sebag, K. Ohara, T. Washio and H. Motoda. “DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm”. IEEE Trans.
on Knowledge and Data Engineering, 20(3) :300-320, March 2008.
149. A. Eiben, Z. Michalewicz, M. Schoenauer and J. Smith. “Parameter Control
in Evolutionary Algorithms”. In Fernando G Lobo, Cláudio F Lima and Zbigniew Michalewicz, editors, Parameter Setting in Evolutionary Algorithms, volume
54 of Studies in Computational Intelligence, pages 19-46, Springer Verlag, 2007.
http ://www.springerlink.com/content/978-3-540-69431-1/.
150. C. Furtlehner, J-M. Lasgouttes and A. De La Fortelle. “Belief Propagation and Bethe
approximation for Traffic Prediction”. Research Report RR-6144, INRIA, 2007. 29 pages,
7 figures.
151. H. Hamda, M. Schoenauer and P. Morel. “A(rt)lgorithm, design informed by mathematics”. Centre Pompidou, Collection permanente, April-October 2007.
152. M. Schoenauer, P. Savéant and V. Vidal. “Divide-and-Evolve : a Sequential Hybridization Strategy using Evolutionary Algorithms”. In Z. Michalewicz and P. Siarry, editors,
70
Advances in Metaheuristics for Hard Optimization, Natural Computing Series, pages 179198, Springer Verlag, 2007.
153. O. Teytaud, C. Antonini, P. Borgnat, A. Chateau and E. Lebeau. Mathématiques pour l’agrégation, Dunod, 2007.
154. M. Amil, C. Gagné, N. Bredèche, S. Gelly, M. Schoenauer and O. Teytaud. “How to
ensure universal consistency and no bloat with VC-dimension”. 2006.
155. A. Cornuéjols. In order to learn : How the sequences of topics affect learning, chapter Machine
Learning : The Necessity of Order (is order in order ?), Oxford University Press, 2006.
156. S. Gelly, Y. Wang, R. Munos and O. Teytaud. “Modification of UCT with Patterns in
Monte-Carlo Go”. Rapport de recherche INRIA RR-6062, INRIA, 2006.
157. Y. Guermeur and O. Teytaud. Younes Bennani, ed., Apprentissage Connexioniste, chapter Estimation et contrôle des performances en généralisation des réseaux de neurones, Hermès, 2006.
158. S. Lallich, O. Teytaud and E. Prudhomme. “Association rules interestingness : measure and validation”. In F. Guillet and H-J. Hamilton, editors, Quality Measures in Data
Mining, pages 23, 2006. Springer.
159. R. Le Riche, M. Schoenauer and M. Sebag. Modélisation Numérique : défis et perspectives,
Traité Mécanique et Ingénierie des Matériaux, chapter Un état des lieux de l’optimisation
évolutionnaire et de ses implications en sciences pour l’ingénieur, Hermès, 2006.
160. M. Schoenauer. Optimisation évolutionnaire, in G. Allaire : Conception optimale de structures,
chapter , pages 221-264, number 58 in Mathématiques et Applications, Springer Verlag,
2006.
161. M. Sebag. Paradigmes et enjeux de l’informatique, chapter Fouille de données, pages 137156, Hermès, 2006.
162. D. Tessier, M. Schoenauer, C. Biernacki, G. Celeux and G. Govaert. “Evolutionary Latent
Class Clustering of Qualitative Data”. Rapport de recherche INRIA RR-6082, INRIA,
2006.
163. P. Bourgine, F. Képès and M. Schoenauer, editors. Proceedings of the First European Conference on Complex Systems – ECCS’05. 2005.
164. V. P. Singh, B. Duquet, M. Léger and M. Schoenauer. “Velocity determination in foothills using evolutionary algorithms”. In Thrust Belts and Foreland Basins, 2005. IFP.
71
Intelligence artificielle et systèmes
d’inférence
1. A. Arion, A. Bonifati, I. Manolescu and A. Pugliese. “Path Summaries and Path Partitioning in Modern XML Databases”. World Wide Web, 11(1) :117-151, 2008.
2. I. Manolescu, L. Afanasiev, A. Arion, J-P. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos and D. Shasha. “The repeatability experiment of SIGMOD
2008”. SIGMOD Record, 37(1) :39-45, 2008.
3. P. Michiels, I. Manolescu and C. Miachon. “Toward microbenchmarking XQuery”. Inf.
Syst., 33(2) :182-202, 2008.
4. F. Saïs, N. Pernelle and M-C. Rousset. “Combining a Logical and a Numerical Method
for Data Reconciliation”. Journal of Data Semantics (JODS), 12 :to appear, 2008.
5. P. Adjiman, F. Goasdoué and M-C. Rousset. “SomeRDFS in the Semantic Web”. Journal
on Data Semantics, 8 :158-181, 2007.
6. A. Arion, A. Bonifati, I. Manolescu and A. Pugliese. “XQueC : A Query-Conscious
Compressed XML Database”. ACM TOIT, 7(2), 2007.
7. C. Doulkeridis, V. Zafeiris, K. Nørvåg, M. Vazirgiannis and E. A. Giakoumakis.
“Context-based caching and routing for P2P web service discovery”. Distributed and
Parallel Databases, 21(1) :59-84, 2007.
8. L. Segoufin. “Static Analysis of XML Processing with Data Values”. ACM Sigmod Record, 36(1), 2007.
9. S. Abiteboul, S. Alstrup, H. Kaplan, T. Milo and T. Rauhe. “Compact Labeling Scheme
for Ancestor Queries.” SIAM J. Comput., 35(6) :1295-1309, 2006.
10. S. Abiteboul, L. Segoufin and V. Vianu. “Representing and querying XML with incomplete information.” ACM Trans. Database Syst., 31(1) :208-254, 2006.
11. P. Adjiman, P. Chatalic, F. Goasdoué, M-C. Rousset and L. Simon. “Distributed Reasoning in a Peer-to-Peer Setting : Application to the Semantic Web”. Journal of Artificial
Intelligence Research, 25 :269,314, 2006.
12. M. Brambilla, S. Ceri, P. Fraternali and I. Manolescu. “Process modeling in Web applications”. ACM Trans. Softw. Eng. Methodol., 15(4) :360-409, 2006.
13. C. L. Duc, N. L. Thanh and M-C. Rousset. “A Compact Representation for Least Common Subsumers in the description logic ALE.” AI Communications, 19(3) :239–273, 2006.
14. A. Muscholl, M. Samuelides and L. Segoufin. “Complementing deterministic treewalking automata”. Inf. Process. Lett., 99(1) :33-39, 2006.
72
15. A. Muscholl, T. Schwentick and L. Segoufin. “Active Context-Free Games”. Theory Comput. Syst., 39(1) :237-276, 2006.
16. S. Abiteboul, R. Agrawal, P. A. Bernstein, M. J. Carey, S. Ceri, W. B. Croft, H-J. Schek, T. K.
Sellis, R. Silberschatz, M. Stonebraker, R. T. Snodgrass, J. D. Ullman, G. Weikum, JWidom
and S. Zdonik. “The Lowell database research self-assessment”. Communications of the
ACM, 48(5) :111-118, 2005.
17. S. Abiteboul, L. Segoufin and V. Vianu. “Representing and Querying XML with Incomplete Information”. ACM TODS, 2005.
18. D. L. Berre, P. W. Purdom and L. Simon. “A phylogenetic tree for the SAT 2002 contest”.
Annals of Mathematics and Artificial Intelligence (AMAI), (43), 2005.
19. G. Gottlob, C. Koch, R. Pichler and L. Segoufin. “The Parallel Complexity of XML
Typing and XPath Query Evaluation”. J. ACM, 52(2) :284–335, 2005.
20. I. Manolescu, M. Brambilla, S. Ceri, S. Comai and P. Fraternali. “Model-Driven Design
and Deployment of Service-Enabled Web Applications”. ACM Transactions on Internet
Technology, 5(3), August 2005.
21. T. Milo, S. Abiteboul, B. Amann, O. Benjelloun and F. D. Ngoc. “Exchanging Intensional
XML Data”. ACM Transactions on Database Systems, 30(1) :1-40, March 2005.
22. A. Muscholl, M. Samuelides and L. Segoufin. “Complementing deterministic treewalking automata”. Information processing letters, 2005.
23. C. Reynaud and B. Safar. “Construction automatique d’adaptateurs guidée par une
ontologie pour l’intégration de sources et de données XML”. Revue TSI Technique et
Science Informatiques, 2008.
24. C. Reynaud and B. Safar. “Techniques structurelles d’alignement pour portails web”.
RNTI, Revue des Nouvelles Technologies de l’Information, 2007.
25. A. Arion, A. Bonifati, I. Manolescu and A. Pugliese. “Un modèle de stockage de données XML basé sur les séquences”. Ingeniérie des Systèmes d’Information, 2, Octobre 2005.
26. V. Ventos and H. Soldano. “Treillis de Galois Alpha”. Revue d’Intelligence Artificielle,
(19) :799–827, 2005.
27. S. Abiteboul, I. Manolescu, N. Polyzotis, N. Preda and C. Sun. “XML processing in DHT
networks”. In ICDE, pages 606-615, 2008.
28. S. Abiteboul, I. Manolescu and S. Zoupanos. “OptimAX : Optimizing Distributed ActiveXML Applications”. In International Conference on Web Engineering, July 2008.
29. S. Abiteboul, L. Segoufin and V. Vianu. “Static analysis of active XML systems”. In
PODS, pages 221-230, 2008.
30. V. Armant, P. Dague and L. Simon. “Distributed Consistency-Based Diagnosis without
Conflicts”. In Proc. of the 19th International Workshop on Principles of Diagnosis DX-08, 2008.
73
31. G. Audemard and L. Simon. “Experimenting with Small Changes in Conflict-Driven
Clause Learning Algorithms”. In Proc of International Conference on Principles and Practice
of Constraint Programming, 2008.
32. L. Brandán-Briones, A. Lazovik and P. Dague. “Optimal Observability for Diagnosability”. In Proc. of the 19th International Workshop on Principles of Diagnosis DX-08, 2008.
33. F. Nouioua and P. Dague. “A Probabilistic Analysis of Diagnosability in Discrete Event
Systems”. In Proc. of the 18th European Conference on Artificial Intelligence (ECAI-08), pages
to appear, July 2008.
34. N. Zemirline, Y. Bourda, C. Reynaud and F. Popineau. “Assisting in Reuse of Adaptive
Hypermedia Creator’s models”. In 5th Int. conference on Adaptive Hypermedia and Adaptive
Web-Based Systems (AH2008), 2008.
35. N. Zemirline, C. Reynaud, Y. Bourda and F. Popineau. “A Pattern and Rule-based Approach for reusing Hypermedia Creator’s Models”. In 16th International Conference on
Knowledge Engineering and Knowledge management - Knowledge pattern, Acitrezza, catania,
Italy, EKAW 2008, 2008.
36. S. Abiteboul. “A Calculus and Algebra for Distributed Data Management”. In Symposium on Theoretical Aspects of Computer Science (STACS), 2007.
37. S. Abiteboul, I. Dar, R. Pop, G. Vasile and D. Vodislav. “EDOS Distribution System : a
P2P architecture for open-source content dissemination”. In Int. Conf. on Open Source
Systems, 2007.
38. S. Abiteboul, I. Dar, R. Pop, G. Vasile and D. Vodislav. “Snapshot on the EDOS Distribution System”. In Free and Open Source Software Developers’ European Meeting, 2007.
39. S. Abiteboul, I. Dar, R. Pop, G. Vasile, D. Vodislav and N. Preda. “Large Scale P2P
Distribution of Open-Source Software (demo)”. In International Conference on Very Large
Databases, 2007.
40. S. Abiteboul and N. Polyzotis. “The Data Ring : Community Content Sharing”. In
Conference on Innovative Database Systems Research, 2007.
41. A. Arion, V. Benzaken, I. Manolescu and Y. Papakonstantinou. “Structured Materialized
Views for XML Queries”. In Very Large Databases Conference, pages 87-98, 2007.
42. K. Berberich, S. J. Bedathur, G. Weikum and M. Vazirgiannis. “Comparing apples and
oranges : normalized pagerank for evolving graphs”. In WWW 2007, pages 1145-1146,
May 2007. ACM.
43. B. Cautis, S. Abiteboul and T. Milo. “Reasoning about XML Update Constraints”. In
ACM Conf. on Principles of Database Systems, 2007.
44. C. Doulkeridis, A. Vlachou, Y. Kotidis and M. Vazirgiannis. “Peer-to-Peer Similarity
Search in Metric Spaces”. In VLDB 2007, pages 986-997, September 2007. VLDB Endowment.
45. D. Mavroeidis and M. Vazirgiannis. “Stability Based Sparse LSI/PCA : Incorporating
Feature Selection in LSI and PCA”. In Machine Learning : ECML 2007, pages 226-237,
September 2007. Springer.
46. A. Nash, L. Segoufin and V. Vianu. “Determinacy and Rewriting of Conjunctive Queries Using Views : A Progress Report”. In International Conference on Database Theory
(ICDT), pages 59-73, 2007.
47. Y. Ollivier and P. Senellart. “Finding Related Pages Using Green Measures : An Illustration with Wikipedia”. In Proc. AAAI, pages 1427–1433, Vancouver, Canada, July 2007.
74
48. M. Samuelides and L. Segoufin. “Complexity of Pebble Tree-Walking Automata”. In
Fundamentals of Computation Theory (FCT), pages 458-469, 2007.
49. F. Saïs, N. Pernelle and M-C. Rousset. “L2R : a Logical method for Reference Reconciliation”. In Proceedings of the Twenty-second AAAI Conference on Artificial Intelligence (AAAI07), 2007.
50. K. Schnaitter, S. Abiteboul, T. Milo and N. Polyzotis. “On-Line Index Selection for
Shifting Workloads”. In International Workshop on Self-Managing Database Systems, 2007.
51. P. Senellart and S. Abiteboul. “On the Complexity of Managing Probabilistic XML
Data”. In Proc. PODS, pages 283–292, Beijing, China, June 2007.
52. C. Sirangelo and L. Segoufin. “Constant-memory validation of streaming XML documents against DTDs”. In International Conference on Database Theory (ICDT), 2007.
53. G. Tsatsaronis, M. Vazirgiannis and I. Androutsopoulos. “Word Sense Disambiguation
with Spreading Activation Networks Generated from Thesauri”. In IJCAI 2007, pages
1725-1730, February 2007.
54. A. Vlachou, C. Doulkeridis, Y. Kotidis and M. Vazirgiannis. “SKYPEER : Efficient Subspace Skyline Computation over Distributed Data”. In ICDE 2007, pages 416-425, May
2007. IEEE Computer Society.
55. M. Weis and I. Manolescu. “Declarative XML Data Cleaning with XClean”. In Conference on Advanced Information Systems Engineering, pages 96-110, 2007.
56. Y. Yan and P. Dague. “Monitoring and Diagnosing Orchestrated Web Service Processes”. In Proc. of 5th IEEE International Conference on Web Services (ICWS’07), pages
51-59, July 2007. IEEE Computer Society.
57. S. Abiteboul. “Turning the Network into a Database with Active XML”. In European
Conference on Object-Oriented Programming, 2006.
58. S. Abiteboul, I. Manolescu and E. Taropa. “A Framework for Distributed XML Data
Management.” In EDBT, pages 1049-1058, 2006.
59. S. Abiteboul and N. Polyzotis. “Data Ring : Let Us Turn the Net into a Database !” In
ADBIS, 2006.
60. S. Abiteboul and P. Senellart. “Querying and Updating Probabilistic Information in
XML.” In EDBT, pages 1059-1068, 2006.
61. A. Arion, V. Benzaken, I. Manolescu, Y. Papakonstantinou and R. Vijay. “Algebra-Based
Identification of Tree Patterns in XQuery”. In FQAS, 2006.
62. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick and L. Segoufin. “Two-variable
logic on data trees and XML reasoning”. In ACM Symposium on Principles of Database
Systems (PODS), pages 10-19, 2006.
63. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin and C. David. “Two-Variable
Logic on Words with Data”. In IEEE Symposium on Logic in Computer Science (LICS),
pages 7-16, 2006.
64. M. Bojańczyk, M. Samuelides, T. Schwentick and L. Segoufin. “Expressive Power of
Pebble Automata”. In International Colloquium on Automata, Languages and Programming
(ICALP), pages 157-168, 2006.
65. P. Chatalic, G-H. Nguyen and M-C. Rousset. “Reasoning with Inconsistencies in Propositional Peer-to-Peer Inference Systems.” In European Conference on Artificial Intelligence
(ECAI 2006), pages 352–357, August 2006.
75
66. C. Jacquiot, Y. Bourda, F. Popineau, A. Delteil and C. Reynaud. “GLAM : A Generic
Layered Adaptation Model for Adaptive Hypermedia Systems”. In V. Wade, H. Ashman and B. S. (Eds), editors, Adaptive Hypermedia (AH2006), pages 131-140, June 2006.
Springer-Verlag Berlin Heidelberg.
67. I. Manolescu, C. Miachon and P. Michiels. “Towards micro-benchmarking XQuery”. In
ExpDB, 2006.
68. T. Melliti, C. Boutrous-Saab and L. Mokdad. “Performance evaluation for mobile access to composite Web services”. In Proc. of International Conference on Internet and Web
Applications and Services (ICIW’06), Guadeloupe, French Caribbean, 2006. IEEE Computer
Society.
69. T. Melliti, C. Boutrous-Saab and S. Rampacek. “Verifying correctness of Web services
choreography”. In Proc. of 4th IEEE European Conference on Web Services, Zurich, Switzerland, 2006. IEEE Computer Society.
70. M-C. Rousset, P. Adjiman, P. Chatalic, F. Goasdoué and L. Simon. “SomeWhere : a
scalable P2P infrastructure for querying distributed ontologies.” In Z. T. E. A. Robert
Meersman, editor, Invited talk, ODBASE 2006 (5t International Conference on Ontologies
Databases and Applications of Semantics, pages 698–703, October 2006. Springer.
71. M-C. Rousset, P. Adjiman, P. Chatalic, F. Goasdoué and L. Simon. “Somewhere in the
Semantic Web.” In Invited talk, SOFSEM 2006 (Int. Conf. on Current Trends in Theory and
Practice of CS), January 2006. Also in Proceedings of PPSWR 2005 (International Workshop on Principles and Practice of SW Reasoning).
72. K. Schnaitter, S. Abiteboul, T. Milo and N. Polyzotis. “COLT : continuous on-line tuning
(demo)”. In SIGMOD Conference, pages 793-795, 2006.
73. L. Segoufin. “Automata and logics for words and trees over an infinite alphabet”. In
Conference for Computer Science Logic (CSL), pages 41-57, 2006.
74. S. Abiteboul, Z. Abrams, S. Haar and T. Milo. “Diagnosis of Asynchronous Discrete
event systems. Datalog to the rescue !” In ACM Conference on Principle of Database Systems, 2005.
75. S. Abiteboul, X. Leroy, B. Vrdoljak, R. D. Cosmo, S. Fermigier, S. Laurière, F. Lepied, R.
Pop, F. Villard, J-P. Smets, C. Bryce, K. R. Dittrich, T. Milo, A. Sagi, Y. Shtossel and E.
Panto. “EDOS : Environment for the Development and Distribution of Open Source
Software”. In Proc. of the 1st Int’l Conf. on Open Source Software Systems, 2005.
76. S. Abiteboul, T. Milo and O. Benjelloun. “Regular Rewriting of Active XML and Unambiguity”. In ACM Conference on Principles of Database Systems (PODS), 2005.
77. P. Adjiman, P. Chatalic, F. Goasdoué, M-C. Rousset and L. Simon. “SomeWhere in the
Semantic Web”. In International Workshop on Principles and Practice of Semantic Web Reasoning, 2005.
78. P. Adjiman, P. Chatalic, F. Goasdoué, M-C. Rousset and L. Simon. “Scalability Study of
Peer-to-Peer Consequence Finding”. In International Joint Conference on Artificial Intelligence, 2005.
79. L. Afanasiev, I. Manolescu and P. Michiels. “MemBeR : A Micro-Benchmark Repository
for XQuery”. In S. Bressan, S. Ceri, E. Hunt, Z. Ives, Z. Bellahsene, M. Rys and R. Unland,
editors, International XML Database Symposium (XSym), volume 3671 of LNCS, pages 144161, September 2005. Springer-Verlag.
80. A. Arion, V. Benzaken and I. Manolescu. “XML Access Modules : Towards Physical
Data Independence in XML Databases”. In International Workshop on XQuery Implementation, Experience and Perspectives (XIME-P), June 2005.
76
81. M. Banek, Z. Skocir and B. Vrdoljak. “Logical Design of Data Warehouses from XML”.
In Proc. of the 8th Int’l Conf. on Telecommunications ConTEL, volume 1, pages 289-295, 2005.
82. M. Benedikt and L. Segoufin. “Towards a Characterization of Order-Invariant Queries
over Tame Structures”. In CSL, 2005.
83. M. Benedikt and L. Segoufin. “Regular tree languages definable in FO”. In STACS,
2005.
84. D. L. Berre and L. Simon. “The SAT 2002 competition.” In Annals of Mathematics and
Artificial Intelligence (AMAI), pages 343–378, 2005.
85. S. Cohen-Boulakia, S. Davidson and C. Froidevaux. “A User-centric Framework for Accessing Biological Sources and Tools”. In DILS, 2005.
86. H. Gagliardi, O. Haemmerlé, D. Migliori, N. Pernelle, M-C. Rousset and F. Saïs. “Enriching a relational datawarehouse by integrating XML data : report ont the edot project”. In Second Franco Japanese Workshop on Information Search Integration and Personnalization (ISIP), 2005.
87. H. Gagliardi, O. Haemmerlé, N. Pernelle and F. Saïs. “A semantic enrichment of data
tables applied to food risk assessment”. In Discovery Science, October 2005. LNAI Springer Verlag.
88. A-D. Mezaour. “Filtering Web Documents for a Thematic Warehouse, Case Study :
eDot a Food Risk Data (extended)”. In New Trends in Intelligent Information Processing and
Web Mining Conference (IIPWM, pages 269-278, June 13-16 2005. Springer Verlag series Advances in Soft Computing.
89. A. Poggi and S. Abiteboul. “XML data integration with identification”. In Tenth International Symposium on Database Programming Languages (DBPL), 2005.
90. L. Segoufin and V. Vianu. “Views and Queries : Determinacy and Rewriting”. In PODS,
2005.
91. P. Senellart. “Identifying Websites with Flow Simulation”. In M. G. David Lowe, editor,
International Conference on Web Engineering, pages 124–129, July 2005. Springer.
92. A. Termier, M-C. Rousset, M. Sebag, K. Ohara, T. Washio and H. Motoda. “Efficient
mining of high branching factor attribute trees”. In ICDM 05 (International Conference
on Data Mining), 2005.
93. V. Ventos and H. Soldano. “Alpha Galois Lattices : an overview”. In International Conference in Formal Concept Analysis, number 3403 in Lecture Notes on Computer Science, pages
298-313, 2005. Springer.
94. N. Abdallah and F. Goasdoué. “Systèmes pair-à-pair sémantiques et extension (non)
conservative d’une base de connaissances”. In Bases de données avancées (BDA), 2008.
95. N. Abdallah and F. Goasdoué. “Calcul de conséquences dans un système d’inférence
pair-à-pair propositionnel (revisité)”. In Reconnaissance des Formes et Intelligence Artificielle (RFIA), 2008.
96. F-E. Calvier and C. Reynaud. “Une aide à la découverte de mappings dans
SomeRDFS”. In 8èmes Journées Francophones Extraction et Gestion des Connaissances
(EGC2008), 2008.
77
97. S. Abiteboul, P. Bourhis and B. Marinoiu. “Incremental View Maintenance for Active
Documents”. In National Conference, Bases de Données Avancées, 2007.
98. S. Abiteboul and B. Marinoiu. “Monitoring Peer to Peer Systems”. In National Conference, Bases de Données Avancées, 2007.
99. S. Abiteboul, R. Pop, G. Vasile and D. Vodislav. “Scalability Evaluation of a P2P Content
Dissemination System”. In National Conference, Bases de Données Avancées, 2007.
100. N. Guelfi, C. Pruski and C. Reynaud. “Les ontologies pour la recherche ciblée d’information sur le Web”. In 18èmes Journées Francophones d’Ingénierie des Connaissances,
IC’2007, pages 61-72, 2007.
101. F. Saïs, N. Pernelle and M-C. Rousset. “Approche logique pour la réconciliation de
références”. In Actes of Extraction et Gestion des Connaissances (EGC 2007),Belgium, pages
623-634, 2007.
102. B. Cautis, S. Abiteboul and T. Milo. “Reasoning about XML Update Constraints”. In
BDA, 2006.
103. H. Kefi, B. Safar and C. Reynaud. “Alignement de taxonomies pour l’integration de
sources d’information heterogenes”. In Reconnaissance des Formes et Intelligence Artificielle (RFIA), 2006.
104. S. Abiteboul, B. Cautis, A. Fiat, H. Kaplan and T. Milo. “Secure Exchange of Modifiable
Data and Queries”. In Bases de Données Avancées (BDA), 2005.
105. F. Saïs, H. Gagliardi, O. Haemmerlé and N. Pernelle. “Enrichissement sémantique de
documents XML représentant des tableaux”. In Extraction et Gestion de Connaissances
(EGC), volume 2, pages 407–419, January 2005. RNTI Cepadues ed..
106. N. Abdallah and F. Goasdoué. “Calcul de conséquences pour le test d’extension conservative dans un système pair-à-pair”. In Journées Francophones de Programmation par
Contraintes, 2008.
107. V. Armant, P. Dague and L. Simon. “Diagnostic Distribué à base de modèles sans calcul
préalable des conflits”. In 4èmes Journées Francophones de Programmation par Contraintes,
pages 41–48, 2008.
108. G-H. Nguyen, P. Chatalic and M-C. Rousset. “A probabilistic trust model for semantic
peer to peer systems”. In A. Doucet, S. Gançarski and E. Pacitti, editors, International
Workshop on Data Management in Peer-to-Peer Systems (DaMaP’2008), ACM International
Conference Proceeding Series, pages 59-65, March 2008. ACM.
109. M. Thiam, N. Bennacer and N. Pernelle. “Contextual and Metadata based Approach
for the Semantic Annotation of Heterogeneous Documents”. In workshop SEMMA of
ESWC, 2008.
110. L. Ye and P. Dague. “Decentralized Diagnosis for BPEL Web Services”. In Proc. of
the 4th International Conference on Web Information Systems and Technologies (WEBIST’08),
pages 283-287, May 2008.
111. S. Abiteboul and B. Marinoiu. “Distributed Monitoring of Peer to Peer Systems”. In
ACM Int.’l workshop on Web Information and Data Management, 2007.
78
112. D. Colazzo, F-X. Dudouet, I. Manolescu, B. Nguyen, P. Senellart and A. Vion. “Traiter
des corpus d’information sur le Web. Vers de nouveaux usages informatiques de l’enquête”. Neuvième Congrès de l’Association Francaise de Sciences Politiques (AFSP),
2007.
113. Y. Li, T. Melliti and P. Dague. “Modeling BPEL Web services for diagnosis : towards
self-healing Web services”. In Proc. of the 3rd International Conference on Web Information
Systems and Technologies (WEBIST’07), pages 297-304, March 2007.
114. N. Pernelle and F. Saïs. “Passage à l echelle de la reconciliation de concepts et de la
reconciliation de references : quelques points de comparaisons.” In Workshop DECOR :
’Passage à l’échelle des techniques de découverte de correspondances’ of EGC’2007, Namur (Belgium), 2007.
115. B. Safar, C. Reynaud and F-E. Calvier. “Techniques d’alignement d’ontologies basées
sur la structure d’une ressource complémentaire”. In 1ères Journées Francophones sur les
Ontologies, pages 21-35, 0ctober 2007.
116. F. Saïs, N. Pernelle and M-C. Rousset. “Reconciliation de references : une approche
adaptee aux grands volumes de données.” In Proceedings of the fifth Conference on Optimization and Information Systems (COSI), Algeria, 2007.
117. S. Abiteboul, B. Cautis, A. Fiat and T. Milo. “Digital Signatures for Modifiable Collections.” In ARES, pages 390-399, 2006.
118. H. Gagliardi, O. Haemmerlé, N. Pernelle and F. Saïs. “Decouverte de relations candidates à l’enrichissement d’entrepot thematiques”. In COSI (Colloque sur l’optimisation
et les systemes d’information), également présenté à l’atelier Fouille du web de EGC06, pages
142-153, June 2006.
119. A. Léger, J. Heinecke, L. J. Nixon, P. Shvaiko, J. Charlet, P. Hobson and F. Goasdoué.
“The Semantic Web from an Industrial Perspective”. Reasoning Web (LNCS, Tutorial
Lectures), 2006.
120. M. Attnäs, P. Senellart and J. Senellart. “Integration of SYSTRAN MT systems in an
open workflow”. In MT Summit X, September 2005.
121. F-X. Dudouet, I. Manolescu, B. Nguyen and P. Senellart. “XML Warehousing Meets
Sociology”. In IADIS International Conference on the Web and Internet, October 2005.
122. P. Senellart and J. Senellart. “SYSTRAN Translation Stylesheets : Machine Translation
driven by XSLT”. In XML Conference and Exhibition, November 2005.
123. S. Abiteboul, T. Allard, P. Chatalic, G. Gardarin, A. Ghitescu, F. Goasdoué, I. Manolescu, B. Nguyen, M. Ouazara, A. Somani, N. Travers, G. Vasile and S. Zoupanos. “WebContent : Efficient P2P Warehousing of Web Data (demonstration)”. In Very Large Data
Bases, 2008.
124. S. Abiteboul, I. Manolescu and S. Zoupanos. “OptimAX : efficient support for dataintensive mash-ups”. In ICDE, pages 1564-1567, 2008.
125. S. Abiteboul, B. Marinoiu and P. Bourhis. “Distributed Monitoring of Peer to Peer
Systems (demonstration)”. In International Conference on Data Engineering, 2008.
79
126. F-E. Calvier and C. Reynaud. “Guiding Ontology Matching process with reasoning
in a PDMS”. In 16th International Conference on Knowledge Engineering and Knowledge
management - Knowledge pattern, Acitrezza, catania, Italy, EKAW 2008, 2008.
127. G-H. Nguyen, P. Chatalic and M-C. Rousset. “A probabilistic trust model for semantic
peer-to-peer systems”. In Proc. of the European Conference on Artificial Intelligence (ECAI
2008), pages to appear, July 2008.
128. G. Audemard and L. Simon. “GUNSAT : A Greedy Local Seach Algorithm for Unsatisfiability”. In Proc of International Joint Conference on Artificial Intelligence, pages 2256-2261,
2007.
129. B. Butnaru, F. Dragan, G. Gardarin, I. Manolescu, B. Nguyen, R. Pop, N. Preda and
L. Yeh. “P2PTester : a tool for measuring P2P platform performance”. In International
Conference on Data Engineering, pages 1501-1502, 2007.
130. F-E. Calvier and C. Reynaud. “Découverte de correspondances entre ontologies distribuées”. In Atelier Ontologies et Gestion de l’Hétérogenéite Sémantique, Plate-Forme AFIA
2007, pages 31-40, 2007.
131. I. Manolescu and S. Manegold. “Performance Evaluation and Experimental Assessment - Conscience or Curse of Database Research ? (panel)”. In VLDB, pages 1441-1442,
2007.
132. M. Thiam, N. Pernelle and F. Saïs. “WebdocEnrich : enrichissement semantique flexible
de documents semi-structurés”. In Actes of Extraction et Gestion des Connaissances (EGC
2007),Belgium, 2007.
133. M. Weis and I. Manolescu. “XClean in action (demo)”. In Conference on Innovative Database Systems Research, pages 259-262, 2007.
134. A. Arion, A. Bonifati, I. Manolescu and A. Pugliese. “Path summaries and path partitioning in modern XML databases(poster)”. In WWW, 2006.
135. C. Reynaud, B. Safar and H. Kefi. “Structural techniques for alignment of structurally
dissymmetric taxonomies”. In H. S. P. M. L. (eds), editor, 15th International Conference
on Knowledge Engineering and Knowledge Management, EKAW 2006, pages 39-40, October
2006. Zeithamlova Milena, Ing. - Agentura Action M.
136. S. Abiteboul, I. Manolescu and N. Preda. “Constructing and Querying Peer-to-Peer
Warehouses of XML Resources”. In International Data Engineering Conference (ICDE),
demo, pages 1122-1123, April 2005. IEEE Computer Society.
137. A. Arion, V. Benzaken, I. Manolescu and R. Vijay. “ULoad : Choosing the Right Storage
for Your XML Application”. In K. Bohm, C. Jensen, L. Haas, M. Kersten, P-A. Larson and
B. Ooi, editors, Very Large Databases Conference (VLDB), demo, pages 1330-1333, August
2005.
138. I. Manolescu and Y. Papakonstantinou. “XQuery Midflight : Emerging DatabaseOriented Paradigms and a Classification of Research Advances”. In International Data
Engineering Conference (ICDE), pages 1143-1143, April 2005.
139. D. Migliori, M-C. Rousset and O. Haemmerlé. “Knowledge Management by Querying
Relational Views of XML data : application to Microbiology”. In IJCAI 2005 workshop
on Knowledge Management, 2005.
80
140. P. Senellart and V. D. Blondel. “Automatic discovery of similar words”. In M. W. Berry
and M. Castellanos, editors, Survey of Text Mining : Clustering, Classification and Retrieval,
Springer-Verlag, January 2008. Second Edition.
141. N. Guelfi, C. Pruski and C. Reynaud. “Towards the Adaptive Web using Metadata
Evolution”. Chapter of the handbook of research on Web Information Systems Quality, 2007.
142. J. Charlet, P. Laublet and C. Reynaud. “Web sémantique”. In J. Akoka and I. Wattiau,
editors, L’encyclopédie de l’informatique et des systèmes d’information, Vuibert, 2006.
143. S. Abiteboul, B. Nguyen and G. Ruberg. “Building an Active Content Warehouse”. In
J. Darmont and O. Boussaid, editors, Managing and Processing Complex Data for Decision
Support, IDEA Group Publishing, 2005.
144. C. Reynaud, B. Safar and H. Gagliardi. “Une expérience de représentation d’une ontologie dans le médiateur PICSEL”. R. Teulier, J. Charlet and P. Tchounikine, editors,
L’Harmattan, 2005.
145. N. Preda. “Efficient Web resource management in structured peer-to-peer networks”.
May 2008.
146. A. Arion. “XML Access Modules : Towards Physical Data Independence in XML Databases”. December 2007.
147. G-L. Giraldo-Gomez. “Construction automatisée de l’ontologie de systèmes médiateurs”. Université Paris Sud, 2005.
148. A-D. Mezaour. “Recherche ciblée de documents sur le web”. Université Paris Sud,
2005.
149. S. Abiteboul, O. Benjelloun and T. Milo. “The Active XML project : an overview”. VLDB
J., accepted for publication, 2008.
150. G. Dequen and L. Simon. SAT : Progrès et Défis, chapter Algorithmes de Recherche Systématique, Hermes, 2008.
151. A. Léger, J. Heinecke, L. J. Nixon, P. Shvaiko, J. Charlet, P. Hobson and F. Goasdoué.
Semantic Web for Business : Cases and Applications, chapter Semantic Web take-off in an
Industry Perspective, Idea Group Inc., 2008.
152. I. Manolescu and P. Bonnet. “Foreword”. Inf. Syst., 33(2) :153-154, 2008.
153. Y. Yan, P. Dague, Y. Pencolé and M-O. Cordier. “A Model-based Approach for Diagnosing Faults in Web Service Processes”. International Journal of Web Services Research
JWSR, 5(4), 2008.
154. S. Abiteboul, I. Manolescu and S. Zoupanos. “OptimAX : optimizing distributed continuous queries (demo)”. In Bases de Données Avancées, 2007.
155. V. Armant. “Diagnostic distribué à base de modèles dans un système pair-à-pair”.
Technical Report, Computer Science Master report, University Paris-Sud, Orsay, 2007.
81
156. N. Guelfi, C. Pruski and C. Reynaud. “Understanding and Supporting Ontology Evolution by Observing the WWW Conference”. In Int. Workshop on Emergent Semantics and
Ontology Evolution associated to ISWC2007, 2007.
157. C. Reynaud and B. Safar. “Exploiting WordNet as Background Knowledge”. In International ISWC’07 Ontology Matching (OM-07) Workshop, Busan, Corea, 2007.
158. C. Reynaud and B. Safar. “Utilisation de connaissances supplémentaires pour la découverte de mappings dans le système TaxoMap”. In Atelier DECOR, EGC 2007, 2007.
159. L. Ye. “Cooperative diagnosis for BPEL Web services”. Technical Report, Computer
Science Master report, University Paris-Sud, Orsay, 2007.
160. H. Zargayouna, B. Safar and C. Reynaud. “TaxoMap in the OAEI 2007 alignment
contest”. In Ontology Alignment Evaluation Inititiative (OAEI) 2007 Campaign - Workshop
on Ontology Matching, 2007.
161. W. X. W. Group. “XQuery Update Facility Use Cases (W3C recommendation). Available at http ://www.w3.org/TR/xqupdateusecases/”. 2006.
162. Y. Li. “Modeling BPEL Web services for diagnosis : towards self-healing Web services”. Technical Report, MIAGE master report, University Paris-Sud, Orsay, 2006.
163. I. Manolescu, V. Benzaken, A. Arion and Y. Papakonstantinou. “Structured Materialized
Views for XML Queries”. In BDA, 2006.
164. C. Reynaud and B. Safar. “When usual structural alignment techniques don’t apply”.
In The ISWC’06 workshop on Ontology matching (OM-06), 2006.
165. C. Reynaud and B. Safar. “Mappings pour l’integration de documents XML”. In Atelier
Modélisation des connaissances - EGC 2006, Janvier 2006.
166. C. Reynaud and B. Safar. “Structural techniques for Alignment of taxonomies : experiments and evaluation”. Technical Report, Gemo, June 2006.
167. M. Weis and I. Manolescu. “Declarative XML Data Cleaning with XClean”. Technical
Report, Gemo, 2006.
168. S. Abiteboul, I. Manolescu and N. Preda. “Sharing Content in Structured P2P Networks”. In Bases de Données Avancées (BDA), October 2005.
169. F-X. Dudouet, I. Manolescu, B. Nguyen and P. Senellart. “XML Warehousing Meets
Sociology... Introducing the W3C XQuery Working Group”. Technical Report, Gemo,
April 2005.
170. H. Gagliardi, O. Haemmerlé, N. Pernelle and F. Saïs. “An automatic ontology-based
approach to enrich tables semantically”. In Workshop AAAI on Context and Ontology,
pages 64–71, July 2005.
171. I. Manolescu and Y. Papakonstantinou. “An Unified Tuple-Based Algebra for XQuery”.
Technical Report, April 2005.
172. P. Senellart. “Identifying Websites with Flow Simulation”. Technical Report, Gemo,
April 2005.
82
Interaction Située
1. C. Appert and M. Beaudouin-Lafon. “SwingStates : Adding State Machines to Java and
the Swing Toolkit”. Software Practice &Experience, 2008.
2. M. Ghoniem, J-D. Fekete and P. Castagliola. “Readability of Graphs Using Node-Link
and Matrix-Based Representations : Controlled Experiment and Statistical Analysis”.
Information Visualization Journal, 4(2) :114–135, 2005.
3. E. Pietriga and R. Lee. “Langages et outils pour la visualisation et la manipulation de
données du Web sémantique”. Technique et Science Informatiques (TSI) Lavoisier, 27, 2008.
4. R. Blanch, M. Beaudouin-Lafon, S. Conversy, Y. Jestin, T. Baudel and Y-P. Zhao. “Concevoir des applications graphiques interactives distribuées avec INDIGO”. Revue d’Interaction Homme-Machine (RIHM), 7(2) :113–140, 2006.
5. N. Dufournaud and J-D. Fekete. “Comparaison d’outils pour la visualisation de
sources historiques codées en XML/TEI”. Document Numérique, 9(2) :37–57, 2006.
6. C. Appert, O. Chapuis and M. Beaudouin-Lafon. “Evaluation of Pointing Performance
on Screen Edges”. In Proceedings of AVI’08, the 9th International Working Conference on
Advanced Visual Interfaces, pages 119-126, May 2008. ACM Press.
7. O. Bau and W. Mackay. “OctoPocus : A Dynamic Guide for Learning Gesture-Based
Command Sets”. In Proceedings of ACM Symposium on User Interface Software and Technology (UIST 2008), Monterey, CA, October 2008. ACM Press.
8. N. Elmquist, N. Henry, Y. Riche and J-D. Fekete. “Melange : Space Folding for MultiFocus Interaction”. In Proceedings of the 2008 ACM SIGCHI Conference on Human Factors
in Computing Systems, 2008. ACM Press.
9. E. Pietriga and C. Appert. “Sigma Lenses : Focus-Context Transitions Combining
Space, Time and Translucence”. In Proceedings of ACM CHI 2008 Conference on Human
Factors and Computing Systems, pages 1343-1352, April 2008. ACM Press.
83
10. Y. Riche, M. Simpson and S. Viller. “Zebra : Exploring participatory design engagement
in fieldwork”. In Proceedings of the 7th international ACM SIGCHI conference on Designing
Interactive Systems, 2008. ACM Press.
11. A. Roudaut, S. Huot and E. Lecolinet. “TapTap and MagStick : Improving One-Handed
Target Acquisition on Small Touch-screens”. In Proceedings of AVI’08, the 9th International Working Conference on Advanced Visual Interfaces, pages 146-153, May 2008. ACM Press.
12. A. Tabard, W. Mackay and E. Eastmond. “From Individual to Collaborative : The Evolution of Prism, a Hybrid Laboratory Notebook”. In Proceedings of ACM Conference on
Computer-Supported Cooperative Work (CSCW 08), San Diego, CA, November 2008. ACM
Press.
13. O. Chapuis and N. Roussel. “Copy-and-Paste Between Overlapping Windows”. In Proceedings of ACM CHI 2007 Conference on Human Factors and Computing Systems, pages
201–210, April 2007. ACM.
14. Y. Guiard, Y. Du and O. Chapuis. “Quantifying degree of goal directedness in document navigation : Application to the evaluation of the perspective-drag technique”. In
Proceedings of ACM CHI 2007 Conference on Human Factors and Computing Systems, pages
327-336, April 2007. ACM Press.
15. S. Huot and E. Lecolinet. “Focus+Context Visualization Techniques for Displaying
Large Lists with Multiple Points of Interest on Small Tactile Screens”. In Proceedings
of Interact 2007, 11th International Conference on Human-Computer Interaction, pages 219233, September 2007. Springer Verlag, Lecture Notes in Computer Science.
16. W. Mackay, C. Appert, M. Beaudouin-Lafon, O. Chapuis, Y. Du, J-D. Fekete and Y.
Guiard. “TouchStone : Exploratory Design of Experiments”. In Proceedings of ACM CHI
2007 Conference on Human Factors and Computing Systems, pages 1425-1434, April 2007.
ACM Press.
17. E. Pietriga, C. Appert and M. Beaudouin-Lafon. “Pointing and Beyond : an Operationalization and Preliminary Evaluation of Multi-scale Searching”. In Proceedings of ACM
CHI 2007 Conference on Human Factors and Computing Systems, pages 1215-1224, April
2007. ACM Press.
18. G. Ramos, A. Cockburn, R. Balakrishnan and M. Beaudouin-Lafon. “Pointing lenses :
facilitating stylus input through visual-and motor-space magnification”. In Proceedings
of ACM CHI 2007 Conference on Human Factors and Computing Systems, pages 757–766,
April 2007. ACM Press.
19. Y. Riche and W. Mackay. “markerClock : A Communicating Augmented Clock for
Elderly”. In Lecture Notes in Computer Science - INTERACT 2007 Conference, pages 408411, 2007. Springer Verlag.
20. N. Roussel and S. Gueddana. “Beyond "Beyond being there" : towards multiscale communication systems”. In Proceedings of ACM Multimedia 2007, pages 238-246, September
2007. ACM.
21. A. Tabard, W. Mackay, N. Roussel and C. Letondal. “PageLinker : Integrating Contextual Bookmarks into a Browser”. In Proceedings of ACM CHI 2007 Conference on Human
Factors and Computing Systems, pages 337–346, April 2007. ACM.
22. C. Appert and M. Beaudouin-Lafon. “SwingStates : Adding State Machines to the
Swing Toolkit”. In UIST ’06 : Proceedings of the 19th annual ACM symposium on User
interface software and technology, pages 319–322, New York, NY, USA, October 2006. ACM
Press.
84
23. C. Appert and J-D. Fekete. “OrthoZoom Scroller : 1D Multi-Scale Navigation”. In Proceedings of ACM CHI 2006 Conference on Human Factors and Computing Systems, pages
21–30, April 2006. ACM Press.
24. R. Blanch and M. Beaudouin-Lafon. “Programming Rich Interactions using the Hierarchical State Machine Toolkit”. In Proceedings of ACM Conference on Advanced Visual
Interfaces, AVI 2006, pages 51-58, May 2006. ACM Press.
25. S. Cohen-Boulakia, C. Froidevaux and E. Pietriga. “Selecting Biological Data Sources
and Tools with XPR, a Path Language for RDF”. In Pacific Symposium on Biocomputing
(PSB), Maui, Hawaii, pages 116-127, January 2006.
26. Y. Du, O. Chapuis, Y. Guiard and M. Beaudouin-Lafon. “Assisting Target Acquisition
in Perspective Views”. In N. Bryan-Kinns, A. Blandford, P. Curzon and L. Nigay, editors, People and Computers XX - Proceedings of HCI 2006, pages 135-150, September 2006.
Springer.
27. J. Eisenstein and W. Mackay. “Interacting with Communication Appliances : An evaluation of two computer vision-based selection techniques”. In Proceedings of ACM
CHI 2006 Conference on Human Factors and Computing Systems, pages 1111-1114, April
2006. ACM Press.
28. S. Gueddana and N. Roussel. “Pêle-Mêle, a video communication system supporting a variable degree of engagement”. In Proceedings of ACM CSCW’06 Conference on
Computer-Supported Cooperative Work, pages 423-426, November 2006. ACM.
29. Y. Guiard, O. Chapuis, Y. Du and M. Beaudouin-Lafon. “Allowing Camera Tilts for
Document Navigation in Standard GUIs : A Discussion and an Experiment”. In Proceedings of AVI’06, the 8th International Working Conference on Advanced Visual Interfaces,
pages 241-244, May 2006. ACM Press.
30. N. Henry and J-D. Fekete. “MatrixExplorer : a Dual-Representation System to Explore
Social Networks”. IEEE Transactions on Visualization and Computer Graphics (Proceedings
Visualization / Information Visualization 2006), 12(5) :677-684, September-October 2006.
31. S. Huot and E. Lecolinet. “SpiraList : A Compact Visualization Technique for OneHanded Interaction with Large Lists on Mobile Devices”. In Proceedings of the 4th Nordic
Conference on Human-Computer Interaction, NordiCHI 2006, pages 445–448, New York, NY,
USA, 14–18 October 2006. Nordic HCI organizations, ACM Press.
32. J-B. Labrune and W. Mackay. “Telebeads : social network mnemonics for teenagers”.
In IDC ’06 : Proceeding of the 2006 conference on Interaction design and children, pages 57–64,
New York, NY, USA, 2006. ACM Press.
33. E. Pietriga. “Semantic Web Data Visualization with Graph Style Sheets”. In ACM
Symposium on Software Visualization (SoftVis’06), pages 177-178, September 2006.
34. E. Pietriga, C. Bizer, D. Karger and R. Lee. “Fresnel - A Browser-Independent Presentation Vocabulary for RDF”. In Lecture Notes in Computer Science (LNCS 4273), Proceedings
of the 5th International Semantic Web Conference (ISWC 2006), pages 158-171, November
2006. Springer.
35. W. Stuerzlinger, O. Chapuis, D. Phillips and N. Roussel. “User Interface Façades : Towards Fully Adaptable User Interfaces”. In Proceedings of UIST’06, the 19th ACM Symposium on User Interface Software and Technology, pages 309-318, October 2006. ACM.
36. O. Beaudoux. “XML active transformation (eXAcT) : transforming documents within
interactive systems”. In DocEng ’05 : Proceedings of the 2005 ACM symposium on Document
engineering, pages 146–148, New York, NY, USA, 2005. ACM Press.
85
37. O. Beaudoux. “Event points : annotating XML documents for remote sharing”. In DocEng ’05 : Proceedings of the 2005 ACM symposium on Document engineering, pages 159–161,
38. O. Beaudoux and M. Beaudouin-Lafon. “OpenDPI : A Toolkit for Developing
Document-centered Environments”. In Proc. 7th International Conference on Enterprise
Information Systems (ICEIS’2005), pages 39–47, 2005.
39. O. Chapuis and N. Roussel. “Metisse is not a 3D desktop !” In Proceedings of UIST’05,
the 18th ACM Symposium on User Interface Software and Technology, pages 13-22, October
2005. ACM.
40. M. Ghoniem, H. Cambazard, J-D. Fekete and N. Jussien. “Peeking in Solver Strategies
Using Explanations Visualization of Dynamic Graphs for Constraint Programming”.
In Proceedings of the ACM Symposium of Software Visualization (SoftVis’05), pages 27–36,
May 2005. ACM Press.
41. J-B. Labrune and W. Mackay. “Tangicam : exploring observation tools for children”. In
IDC ’05 : Proceeding of the 2005 conference on Interaction design and children, pages 95–102,
42. W. Mackay and M. Beaudouin-Lafon. “FamilyNet : A Tangible Interface for Managing
Intimate Social Networks”. In Proceedings of SOUPS’05, Symposium On Usable Privacy
and Security, July 2005. ACM Press.
43. E. Pietriga. “A Toolkit for Addressing HCI Issues in Visual Language Environments”.
In IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC’05), pages
145-152, September 2005.
44. Y. Riche and W. Mackay. “PeerCare : Challenging the monitoring approach to care for
the elderly”. In British HCI 2005 Workshop on HCI and the Older Population, Edinburg, UK,
2005.
45. C. Appert and J-D. Fekete. “Naviguer dans des grands arbres avec ControlTree”. In
Proceedings of IHM 2007, 19ème conférence francophone sur l’Interaction Homme-Machine,
pages 139-142, Novembre 2007. ACM, International Conference Proceedings Series.
46. S. Huot and E. Lecolinet. “ArchMenu et ThumbMenu : Contrôler son dispositif mobile
"sur le pouce"”. In Proceedings of IHM 2007, 19ème conférence francophone sur l’Interaction
Homme-Machine, pages 107-110, November 2007. ACM, International Conference Proceedings Series.
47. C. Letondal, W. Mackay and N. Donin. “Paperoles et musique”. In Proceedings of IHM
2007, 19ème conférence francophone sur l’Interaction Homme-Machine, pages 167-174, Novembre 2007. ACM, International Conference Proceedings Series.
48. C. Appert and M. Beaudouin-Lafon. “SMCanvas : augmenter la boîte à outils Java
Swing pour prototyper des techniques d’interaction avancées”. In Proceedings of IHM
2006, 18ème conférence francophone sur l’Interaction Homme-Machine, pages 99-106, Avril
2006. ACM Press, International Conference Proceedings Series. Best paper award.
49. N. Henry and J-D. Fekete. “MatrixExplorer : Un système pour l’analyse exploratoire
de réseaux sociaux”. In Proceedings of IHM 2006, International Conference Proceedings
Series, pages 67–74, Montréal, Canada, April 2006. ACM Press.
86
50. S. Huot, P. Dragicevic and C. Dumas. “Flexibilité et modularité pour la conception
d’interactions : Le modèle d’architecture logicielle des Graphes Combinés”. In Actes
de la 18ème conférence francophone sur l’Interaction Homme-Machine, IHM’06, pages 43–50,
New York, NY, USA, 18–21 April 2006. AFIHM, ACM Press.
51. N. Masson and W. Mackay. “Qui est connecté avec qui ? Personalisation et séparation dans les communication appliances”. In Proceedings of IHM 2006, 18ème conférence
francophone sur l’Interaction Homme-Machine, pages 191-194, Avril 2006. ACM Press, International Conference Proceedings Series.
52. R. Blanch, S. Conversy, T. Baudel, Y-P. Zhao, Y. Jestin and M. Beaudouin-Lafon. “INDIGO : une architecture pour la conception d’applications graphiques interactives
distribuées”. In Actes des dix-septièmes journées francophones sur l’Interaction HommeMachine (IHM 2005), pages 139–146, 2005.
53. O. Chapuis. “Gestion des fenêtres : enregistrement et visualisation de l’interaction”.
In Proceedings of IHM 2005, 17ème conférence francophone sur l’Interaction Homme-Machine,
pages 255-258, September 2005. ACM Press, International Conference Proceedings Series.
54. E. Nars. “Visualisation multi-échelles pour photos personnelles”. In Proceedings of IHM
2005, 17ème conférence francophone sur l’Interaction Homme-Machine, pages 259-262, September 2005. ACM Press, International Conference Proceedings Series.
55. N. Roussel and O. Chapuis. “Metisse : un système de fenêtrage hautement configurable
et utilisable au quotidien”. In Proceedings of IHM 2005, 17ème conférence francophone sur
l’Interaction Homme-Machine, pages 279-282, Septembre 2005. ACM, International Conference Proceedings Series.
56. N. Roussel, J-D. Fekete and M. Langet. “Vers l’utilisation de la mémoire épisodique
pour la gestion de données familières”. In Proceedings of IHM 2005, 17ème conférence
francophone sur l’Interaction Homme-Machine, pages 247-250, Septembre 2005. ACM, International Conference Proceedings Series.
57. O. Bau, A. Tanaka and W. Mackay. “The A20 : Musical Metaphors for Interface Design”.
In Proceedings of International Conference on New Interfaces for Musical Expression (NIME 08),
Genova, Italy, June 2008.
58. S. Gueddana and N. Roussel. “Designing new communication systems for the home”.
Position paper, InteractiveSpaces workshop on Imagining Domestic Interiors, Århus
(Denmark), January 2008. 3 pages.
59. C. Letondal and W. Mackay. “The Paperoles Project : An analysis of paper use by music
composer”. In Proceedings of CoPADD 2007, 2nd Workshop on Collaborating over Paper and
Digital Documents, December 2007.
60. Y. Guiard, M. Beaudouin-Lafon, Y. Du, C. Appert, J-D. Fekete and O. Chapuis. “Shakespeare’s complete works as a benchmark for evaluating multiscale document navigation techniques”. In BELIV ’06 : Proceedings of the 2006 conference on BEyond time and
errors, pages 1–6, New York, NY, USA, 2006. ACM Press.
61. N. Henry and J-D. Fekete. “Evaluating visual table data understanding”. In BELIV ’06 :
Proceedings of the 2006 conference on BEyond time and errors, pages 1–5, New York, NY,
USA, 2006. ACM Press.
87
62. B. Lee, C. Plaisant, C. S. Parr, J-D. Fekete and N. Henry. “Task taxonomy for graph
visualization”. In BELIV ’06 : Proceedings of the 2006 conference on BEyond time and errors,
pages 1–5, New York, NY, USA, 2006. ACM Press.
63. C. Bizer, R. Lee and E. Pietriga. “Fresnel - A Browser-Independent Presentation Vocabulary for RDF”. In Second International Workshop on Interaction Design and the Semantic
Web, October 2005.
64. W. Mackay and M. Beaudouin-Lafon. “Generative Approaches to Simplicity in Design”. In International Forum : Less is More - Simple Computing in an Age of Complexity,
2005. Microsoft.
65. G. Besacier, F. Vernier, O. Chapuis and N. Roussel. “Redirection d’applications existantes et nouvelles interactions pour des usages collaboratifs co-localisés sur une
table interactive”. In Proceedings of IHM 2007, 19ème conférence francophone sur l’Interaction Homme-Machine, pages 271-274, Novembre 2007. ACM, International Conference
Proceedings Series. Démonstration et article court.
66. Y. Riche. “PeerCare : Challenging the Monitoring Approach to Eldercare”. In Lecture
Notes in Computer Science - INTERACT 2007 Conference, pages 628-630, September 2007.
Springer Verlag. Doctoral Consortium.
67. Y. Riche and W. Mackay. “Une horloge communicante pour les séniors”. In Proceedings
of IHM 2007, 19ème conférence francophone sur l’Interaction Homme-Machine, pages 295-298,
Novembre 2007. ACM, International Conference Proceedings Series. Démonstration et
article court.
68. A. Tabard and T. Tsandilas. “The ReActive Notebook”. In Demonstration at CoPADD
2007, 2nd Workshop on Collaborating over Paper and Digital Documents, December 2007.
69. C. Appert. “How to Model, Evaluate and Generate Interaction Techniques ?” In adjunctProc. ACM symposium on User Interface Software and Technology (UIST 2006) Conference
Compendium, pages 15-18, October 2006. ACM Press. Doctoral Symposium.
70. C. Appert and J-D. Fekete. “ControlTree : Navigating and Selecting in a Large Tree”.
In Proc. ACM symposium on User Interface Software and Technology (UIST 2006) Conference
Compendium, pages 47-48, October 2006. ACM Press. Demonstration.
71. J. Foley, M. Beaudouin-Lafon, J. Grudin, J. D. Hollan, S. Hudson, J. Olson and B. Verplank. “Graduate Education in Human-Computer Interaction”. In J-G. Ganascia, editor,
CHI Extended Abstracts, pages 2113-2114, 2006. ACM.
72. S. Gueddana. “Designing video communication systems for the home”. In Proceedings
of ACM CSCW’06 Doctoral Colloquium, November 2006. 2 pages.
73. N. Roussel. “From analog to digital, from the office to the living room : why I happily
worked in a media space but don’t live in one”. Position paper, ACM CSCW 2006
Workshop "Media Space - Reflecting on 20 Years", November 2006. 4 pages.
74. N. Roussel. “POMDOM : Paradigmes, outils et méthodes pour l’interaction en environnement domestique”. Atelier organisé dans le cadre de la conférence UbiMob’06,
Septembre 2006.
75. N. Roussel, A. Tabard and C. Letondal. “All you need is log”. Position paper, WWW
2006 Workshop on Logging Traces of Web Activity : The Mechanics of Data Collection,
May 2006. 4 pages.
88
76. L. Terrenghi, R. May, P. Baudisch, W. Mackay, F. Paternò, J. Thomas and M. Billinghurst.
“Information visualization and interaction techniques for collaboration across multiple displays”. In CHI ’06 extended abstracts on Human factors in computing systems, pages
1643–1646, New York, NY, USA, 2006. ACM Press.
77. W. Mackay, Y. Riche and J-B. Labrune. “Communication Appliances : Shared Awareness for Intimate Social Networks”. In ACM SIGCHI 2005 Workshop on Awareness
Systems : Known results, theory, concepts and future challenges, Portland, USA, 2005.
78. E. Nars. “Communication appliances tools”. In Proceedings of SOUPS’05, Symposium On
Usable Privacy and Security, July 2005. ACM Press.
79. M. Beaudouin-Lafon. “Interaction is the Future of Computing”. In T. Erickson and
D. McDonald, editors, HCI Remixed, Reflections on Works That Have Influenced the HCI
Community, pages 263-266, MIT Press, 2008.
80. W. Mackay. “From Gaia to HCI : On Multi-disciplinary Design and Co-adaptation”.
In T. Erickson and D. McDonald, editors, HCI Remixed, Reflections on Works That Have
Influenced the HCI Community, pages 247-251, MIT Press, 2008.
81. M. Beaudouin-Lafon and W. Mackay. “Prototyping Tools and Techniques”. In A. Sears
and J. A. Jacko, editors, Human Computer Interaction Handbook : Fundamentals, Evolving
Technologies, and Emerging Applications (2nd edition), CRC Press, September 2007.
82. S. Lindquist, B. Westerlund, Y. Sundblad, H. Tobiasson, M. Beaudouin-Lafon and W.
Mackay. “Co-designing Technology with and for Families - Methods, Experiences, Results and Impact”. In N. Streitz, A. Kameas and I. Mavrommati, editors, The Disappearing
Computer, volume 4500 of LNCS, pages 99-119, Springer, 2007.
83. M. Beaudouin-Lafon. “Interaction graphique”. In J. Akoka and I. Comyn-Wattiau, editors, Encyclopédie de l’Informatique et des Systèmes d’Information, Vuibert, 2006.
84. M. Beaudouin-Lafon. “Interaction homme-machine”. In J. Akoka and I. ComynWattiau, editors, Encyclopédie de l’Informatique et des Systèmes d’Information, Vuibert, 2006.
85. M. Beaudouin-Lafon. “Human-Computer Interaction”. In D. Goldin, S. Smolka and P.
Wegner, editors, Interactive Computation : The New Paradigm, pages 227-254, Springer,
2006.
86. O. Beaudoux and M. Beaudouin-Lafon. “OpenDPI : A Toolkit for Developing
Document-centered Environments”. In C-S. Chen, J. Filipe, I. Secura and J. Corderio,
editors, Enterprise Information Systems VII (ICEIS 2005 best papers), pages 231-239, Springer, 2006.
87. J-D. Fekete. “Visualisation d’information”. In J. Akoka and I. Comyn-Wattiau, editors,
Encyclopédie de l’Informatique et des Systèmes d’Information, Vuibert, 2006.
88. J-B. Labrune and W. Mackay. “Can HCI inspire dynamic design ?” In DeSForM, European
workshop on Design & Semantics of Form and Movement, October 2006.
89. M. Beaudouin-Lafon. “Enjeux et perspectives en interaction homme-machine”. In N.
Bidoit, L. Fariñas del Cerro, S. Fdida and B. Vallée, editors, Paradigmes et enjeux de l’informatique, pages 197-201, 2005.
89
90. Y. Guiard and M. Beaudouin-Lafon. “Espace et échelle du mouvement : la loi de Fitts
dans le monde physique et dans les mondes électroniques”. In C. Thinus-Blanc and J.
Bullier, editors, Agir dans l’espace, Maison des Sciences de l’Homme, Décembre 2005. 28
pages.
91. P. Markopoulos, B. de Ruyter and W. Mackay, editors. Special issue of Human-Computer
Interaction on Awareness Systems Design : Theory, Methodology, and Applications. Lawrence
Erlbaum Associates, 2007.
92. N. Roussel, editor. Proceedings of IHM 2007, 19ème Conférence de l’Association Francophone
d’Interaction Homme-Machine, International Conference Proceedings Series. ACM, November 2007.
93. J-D. Fekete and E. Lecolinet, editors. Document Numérique — Visualisation pour les bibliothèques numériques, volume 9/2, Hermès - Lavoisier, 2006.
94. H. Gellersen, K. Schmidt, M. Beaudouin-Lafon and W. Mackay, editors. Proceedings of
the 9th European Conference on Computer-Supported Cooperative Work (ECSCW’05), Paris,
France. Springer, September 2005. 490 pages.
Diffusion de la connaissance : 1
95. M. Beaudouin-Lafon. “40 ans d’interaction homme-machine : points de repère et perspectives”. Interstices, Avril 2007.
96. J-B. Labrune. “Enfants et Technologies Créatives : Un Phénomène d’Exaptation”. Thèse
de Doctorat, Université Paris-Sud, Orsay, France, Décembre 2007. 152 pages.
97. E. Nars. “Support informatique à des communications de groupe”. Thèse de Doctorat,
Université Paris-Sud, Orsay, France, Septembre 2007. 185 pages.
98. N. Roussel. “Nouvelles formes de communication et nouvelles interactions hommemachine pour enrichir et simplifier le quotidien”. Habilitation à diriger des recherches,
Université Paris-Sud, Orsay, France, Décembre 2007. 171 pages.
99. R. Blanch. “Architecture logicielle et outils pour les interfaces hommes-machines graphiques avancées”. Thèse de Doctorat, Université Paris-Sud, Orsay (France), September
2005. 174 pages.
100. J-D. Fekete. “Nouvelle génération d’Interfaces Homme-Machine pour mieux agir et
mieux comprendre”. Présentation des travaux en vue de l’Habilitation à diriger des
recherches, Université Paris-Sud, Orsay (France), May 2005. 122 pages. Rapport de recherche LRI 1411.
101. S. Huot. “Une nouvelle approche pour la conception créative : De l’interprétation du
dessin à main levée au prototypage d’interactions non-standard”. Thèse de Doctorat,
Université de Nantes, École Nationale Supérieure des Techniques Industrielles et des
Mines de Nantes, July 2005.
90
102. O. Chapuis, R. Blanch and M. Beaudouin-Lafon. “Fitts’ Law in the Wild : A Field Study
of Aimed Movements”. Technical Report, LRI, Université Paris-Sud, France, December
2007. 11 pages.
103. S. Gueddana and N. Roussel. “Pêle-Mêle, a video communication system supporting a
variable degree of engagement”. Rapport de Recherche 1437, LRI, Université Paris-Sud,
France, Mars 2006. 4 pages. This is an earlier version of the CSCW’06 note.
104. W. Mackay. “The Interaction Museum”. Deliverable 1.1, Convivio Network of Excellence, February 2006.
105. Y. Riche. “Technology Probes for the design of a communication systems for seniors”.
Confirmation Report, University of Queensland, Université Paris Sud, August 2006. 48
pages.
106. N. Roussel. “Vers des systèmes de communication multi-échelles”. Rapport de Recherche 1431, LRI, Université Paris-Sud, France, Février 2006. 7 pages. This is an earlier
version of the CEREN report.
107. N. Roussel. “Towards multiscale communication systems”. Rapport de Recherche 1439,
LRI, Université Paris-Sud, France, March 2006. 9 pages. This is an earlier version of the
Multimedia’07 paper.
108. N. Roussel, H. Evans and H. Hansen. “More about MirrorSpace”. Rapport de Recherche
1438, LRI, Université Paris-Sud, France, Mars 2006. 8 pages.
109. N. Roussel and A. Sutan. “Vers des systèmes de communication multi-échelles”. In
Cahier du CEREN, number 16, pages 30-38, Octobre 2006. ESC Dijon Bourgogne, France.
110. V. Wauthier. “Nightboard : création d’un plafond communicant pour les couples physiquement distants”. Mémoire de Master Professionnel, Université Paris-Sud, Orsay,
France, Septembre 2006. 26 pages.
111. O. Zuckerman, B. Ullmer, L. E. Holmquist, H. Ishii, G. Fitzmaurice, Y. Rogers, W. Mackay
and T. Rodden. “The state of tangible interfaces : projects, studies, and open issues”.
In CHI ’06 extended abstracts on Human factors in computing systems, pages 61-64, 2006.
ACM Press.
112. R. Blanch. “Facilitating post-WIMP Interaction Programming using the Hierarchical
State Machine Toolkit”. Rapport de Recherche 1410, LRI, Université Paris-Sud, France,
2005. 15 pages.
113. O. Chapuis and N. Roussel. “Metisse is not a 3D desktop !” Rapport de Recherche 1407,
LRI, Université Paris-Sud, France, April 2005. 10 pages. This is an earlier version of the
UIST’05 paper.
114. S. Conversy, W. Mackay, M. Beaudouin-Lafon and N. Roussel. “VideoProbe : Sharing Pictures of Everyday Life”. Rapport de Recherche 1409, LRI, Université Paris-Sud,
France, April 2005. 8 pages.
115. S. Gueddana. “Conception d’un système de communication multiéchelle”. Rapport
de stage de Master Recherche, Université Paris-Sud, Orsay, France, September 2005. 22
pages.
116. Y. Guiard, O. Chapuis, Y. Du and M. Beaudouin-Lafon. “Navigation 3D pour explorer
une vaste surface 2D : les promesses de la vue en perspective”. Rapport de Recherche
1413, LRI, Université Paris-Sud, France, Juin 2005. 28 pages.
91
117. N. Masson. “Conception et évaluation des communication appliances”. Rapport de
stage de Master, ENST Bretagne, September 2005. 76 pages.
118. M. A. Shah. “Analysis of Temporal Data”. Rapport de stage de Master Recherche, Université Paris-Sud, Orsay, France, Septembre 2005. 18 pages.
119. W. Stuerzlinger, O. Chapuis and N. Roussel. “User interface façades : towards fully
adaptable user interfaces”. Rapport de Recherche 1408, LRI, Université Paris-Sud,
France, April 2005. 9 pages. This is an earlier version of the UIST’06 paper.
120. A. Tabard. “Conception d’un navigateur web spécifique pour la bio-informatique”.
Rapport de stage de Master, Université Pierre et Marie Curie, Paris 6, Septembre 2005.
67 pages.
92
Parallélisme
1. D. Buntinas, C. Coti, T. Herault, P. Lemarinier, L. Pilard, A. Rezmerita, E. Rodriguez and
F. Cappello. “Blocking vs. Non-Blocking Coordinated Checkpointing for Large-Scale
Fault Tolerant MPI”. Future Generation Computer Systems, 24 :1 :73–84, January 2008.
2. R. Lassaigne and S. Peyronnet. “Probabilistic Verification and Approximation”. Annals
of Pure and Applied Logic, 152(1–3) :122-131, 2008.
3. J. Beauquier, M. Gradinariu and C. Johnen. “Randomized Self-Stabilizing and Space
optimal Leader election under arbitrary scheduler on rings”. Distributed Computing,
20 :75-93, 2007.
4. J. Beauquier, S. Delaët, S. Dolev and S. Tixeuil. “Transient Fault Detectors”. Distributed
Computing, 20(1) :39-51, 2007.
5. S. Dolev, S. Messika, J. Rosen and N. Shaked. “Optical Solutions for Bounded NPComplete Problems”. Applied Optics, 46(5) :711-724, 2007.
6. S. Dolev, S. Messika, J. Rosen and N. Shaked. “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems”. Optical Engineering, 108201(46),
2007.
7. L. Grigori, M. Cosnard and E. G. Ng. “On the Row Merge Tree for Sparse LU Factorization with Partial Pivoting”. BIT Numerical Mathematics Journal, 47(1) :45-76, 2007.
8. L. Grigori, J. Demmel and X. S. Li. “Parallel Symbolic Factorization for Sparse LU
Factorization with Static Pivoting”. SIAM Journal on Scientific Computing, 29(3) :12891314, 2007.
9. W. Hoarau, S. Tixeuil and F. Vauchelles. “FAIL-FCI : Versatile Fault-Injection”. Future
Generation Computer Systems, 23(7) :913-919, 2007.
10. D. Kondo, G. Fedak, F. Cappello, A. A. Chien and H. Casanova. “Resource Availability in Enterprise Desktop Grids”. Future Generation Computer Systems, 23(7) :888-903,
August 2007.
11. S. Laplante, R. Lassaigne, F. Magniez, S. Peyronnet and M. de Rougemont. “Probabilistic
abstraction for model checking : An approach based on property testing”. ACM Trans.
Comput. Log., 8(4), 2007.
12. B. Wei, G. Fedak and F. Cappello. “Towards Efficient Data Distribution on Computational Desktop Grids with BitTorrent”. Future Generation Computer Systems, 23(7) :983-989,
August 2007.
13. H. Xiang and Y. Wei. “On normwise structured backward errors for saddle point systems”. SIAM Journal on Matrix Analysis and Applications, 29 :838-849, 2007.
93
14. J. Beauquier, L. Pilard and B. Rozoy. “Observing Locally Self-stabilization in a Probabilistic Way”. Journal of Aerospace Computing, Information and Communication, 3(10) :516–537,
October 2006.
15. R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez, E. Jeannot, Y. Jegou, S. Lanteri, J.
Leduc, N. Melab, G. Mornet, R. Namyst, P. Primet, B. Quetier, O. Richard, E-G. Talbi and
I. Touche. “Grid’5000 : A Large Scale And Highly Reconfigurable Experimental Grid
Testbed”. International Journal of High Performance Computing Applications, 20(4) :481-494,
2006.
16. A. Bouteiller, H-L. Bouziane, T. Herault, P. Lemarinier and F. Cappello. “Hybrid Preemptive Scheduling of MPI Applications on the Grids”. International Journal of High Performance Computing and Networking, 20 :1 :77–90, 2006.
17. A. Bouteiller, T. Herault, G. Krawezik, P. Lemarinier and F. Cappello. “MPICH-V Project : a Multiprotocol Automatic Fault Tolerant MPI”. International Journal of High Performance Computing Applications, 20(3) :319-333, 2006.
18. A. Bouteiller, P. Lemarinier, G. Krawezik and F. Cappello. “Coordinated checkpoint
versus message log for fault tolerant MPI”. Int. Journal of High Performance Computing
Applications (IJHPCA), 1(20) :77–90, 2006.
19. S. Delaët, B. Ducourthial and S. Tixeuil. “Self-Stabilization with r-Operators revisited”.
Journal of Aerospace Computing, Information, and Communication, 3(10) :498-514, October
2006.
20. L. Fribourg, S. Messika and C. Picaronny. “Coupling and Self-Stabilization”. Distributed
Computing, 18(3) :221-232, February 2006.
21. Y. Nakajima, M. Sato and F. Cappello. “Integrating Computing Resources on Multiple
Grid-enabled Job Scheduling Systems Through a Grid RPC System”. Journal of Grid
Computing, 2006.
22. B. Quetier, V. Neri and F. Cappello. “Scalability Comparison of Four Host Virtualization Tools”. Journal of Grid Computing, 2006.
23. F. Cappello, S. Djilali, G. Fedak, T. Herault, F. Magniette, V. Neri and O. Lodygensky.
“Computing on Large Scale Distributed Systems : XtremWeb Architecture, Programming Models, Security, Tests and Convergence with Grid.” Future Generation Computer
Systems, 21(3) :417–437, March 2005.
24. F. Cappello, P. Fraigniaud, B. Mans and A. Rosenberg. “An algorithmic model for heterogeneous clusters : rationale and experience”. International Journal of Foundations of
Computer Science, 16 :195–216, 2005.
25. T. Herman and C. Johnen. “Strategies for peer-to-peer downloading”. Information Processing letters, 94(5) :203–209, 2005.
26. N. Mitton, K. Paroux, Katy, B. Sericola and S. Tixeuil. “Ascending runs in dependent
uniformly distributed random variables : Application to wireless networks”. Methodology and Computing in Applied Probability, pages to appear, 2008.
27. L. Grigori and X. S. Li. “Towards an Accurate Performance Modeling of Parallel Sparse
Factorization”. Applicable Algebra in Engineering, Communication, and Computing Journal,
18(3) :241-261, 2007.
94
28. T. Masuzawa and S. Tixeuil. “Stabilizing Link-Coloration of Arbitrary Networks with
Unbounded Byzantine Faults”. International Journal of Principles and Applications of Information Science and Technology (PAIST), 1(1) :1-13, December 2007.
29. J. Beauquier, L. Pilard and B. Rozoy. “Observing locally self-stabilization”. J. High Speed
Networks, 14(1) :3-19, 2005.
30. Y. Chen, A. K. Datta and S. Tixeuil. “Stabilizing Inter-domain Routing in the Internet”.
Journal of High Speed Networks, 14(1) :21-37, 2005.
31. F. Cappello and H. E. Bal. “Toward an International "Computer Science Grids"”. In
Proceedings of IEEE/ACM CCGRID 2007, pages 3-12, Rio de Janeiro, May 2007. IEEE Press.
keynote address.
32. A. Borghi, T. Herault, R. Lassaigne and S. Peyronnet. “Cell assisted APMC”. In proceedings of the International Conference on Quantitative Evaluation of SysTems, pages to appear,
2008.
33. F. Bouabache, T. Hérault, G. Fedak and F. Cappello. “Hierarchical Replication Techniques to Ensure Checkpoint Storage Reliability in Grid Environment”. In 8th IEEE
International Symposium on Cluster Computing and the Grid (CCGrid 2008), 19-22 May 2008,
Lyon, France, pages 475-483, 2008. IEEE Computer Society.
34. C. Coti, T. Herault, S. Peyronnet, A. Rezmerita and F. Cappello. “Grid Services for
MPI”. In 8th IEEE International Symposium on Cluster Computing and the Grid (CCGrid
2008), pages 417-424, 2008. IEEE Computer Society.
35. S. Delaët, S. Devismes, M. Nesterenko and S. Tixeuil. “Brief Announcement : SnapStabilization in Message-Passing Systems”. In Principles of Distributed Computing
(PODC 2008), August 2008.
36. S. Delaët, P. S. Mandal, M. A. Rokicki and S. Tixeuil. “Deterministic Secure Positioning
in Wireless Sensor Networks”. In S. E. Nikoletseas, B. S. Chlebus, D. B. Johnson and
B. Krishnamachari, editors, Proceedings of the IEEE Conference on Distributed Computing
in Sensor Systems, volume 5067 of Lecture Notes in Computer Science, pages 469-477, 2008.
Springer.
37. C. Johnen and L. Higham. “Brief Announcement : Fault-tolerant Implementations of
Atomic Registers by Safe Registers in Networks”. In PODC, 2008. ACM.
38. J. Beauquier, J. Clement, S. Messika, L. Rosaz and B. Rozoy. “Self-stabilizing Counting
in Mobile Sensor Networks with a Base Station”. In A. Pelc, editor, DISC, volume 4731
of Lecture Notes in Computer Science, pages 63-76, 2007. Springer.
39. J. Beauquier, J. Clement, S. Messika, L. Rosaz and B. Rozoy. “Self-stabilizing Counting
in Mobile Sensor Networks with a Base Station”. In A. Pelc, editor, DISC, pages 63-76,
2007.
40. J. Beauquier, J. Clement, S. Messika, L. Rosaz and B. Rozoy. “Self-stabilizing counting
in mobile sensor networks”. In I. Gupta and R. Wattenhofer, editors, PODC, pages 396397, 2007. ACM.
95
41. L. Blin, M. G. Potop-Butucaru and S. Tixeuil. “On the self-stabilization of mobile robots
in graphs”. In International Conference on Principles of Distributed Systems (OPODIS 2007),
pages 301-314, December 2007. Springer-Verlag.
42. M. Cadilhac, T. Herault, R. Lassaigne, S. Peyronnet and S. Tixeuil. “Evaluating complex
MAC protocols for sensor networks with APMC”. In Proceedings of the 6th International
Workshop on Automated Verification of Critical Systems (AVoCS 2006), volume 185 of ENTCS,
pages 33–46, Nancy, France, July 2007.
43. M. Gradinariu and S. Tixeuil. “Conflict Managers for Self-stabilization without Fairness Assumption”. In Proceedings of the International Conference on Distributed Computing
Systems (ICDCS 2007), pages 46, June 2007. IEEE.
44. F. Greve and S. Tixeuil. “Knowledge Connectivity vs. Synchrony Requirements for
Fault-Tolerant Agreement in Unknown Networks”. In Proceedings of IEEE International
Conference on Dependable Systems and networks (DSN 2007), pages 82-91, June 2007. IEEE.
45. T. Herault, P. Lemarinier, O. Peres, L. Pilard and J. Beauquier. “A Model for Large Scale
Self-Stabilization”. In Proceedings of the 21st IEEE International Parallel and Distributed
Processing Symposium (IPDPS), pages 1 - 10, Long Beach, CA, USA, March 2007. IEEE.
46. A. Iosup, M. Jan, O. Sonmez and D. Epema. “On the Dynamic Resource Availability
in Grids”. In Proc. of the 8th IEEE/ACM International Conference on Grid Computing (Grid
2007), pages 26-33, Austin, TX, USA, September 2007.
47. C. Johnen and L. Higham. “Fault-tolerant Implementations of atomic-state communication model for distributed computing”. In DISC’07, the 21th International Symposium
on Distributed Computing, Springer LNCS :4731, pages 485-486, 2007. Brief announcement.
48. C. Johnen and L. Nguyen. “Self-Stabilizing Bounded Size Clustering Algorithm”. In
ISPA07, the 5th International Symposium on Parallel and Distributed Processing and Applications, 2007.
49. D. Kondo, D. P. Anderson and McLeod, VII, John. “Performance Evaluation of Scheduling Policies for Volunteer Computing”. In 3rd IEEE International Conference on e-Science
and Grid Computing (e-Science’07), 2007.
50. D. Kondo, F. Araujo, P. Malecot, P. Domingues, L. M. Silva, G. Fedak and F. Cappello.
“Characterizing Result Errors in Internet Desktop Grids”. In ACM European Conference
on Parallel and Distributed Computing EuroPar’07, Rennes, France, August 2007.
51. F. Manne, M. Mjelde, L. Pilard and S. Tixeuil. “A New Self-Stabilizing Maximal Matching Algorithm”. In Proceedings of the 14t h International Colloquium on Structural Information and Communication Complexity (Sirocco 2007), volume 4474, pages 96-108, June 2007.
Springer Verlag.
52. D. Anderson and G. Fedak. “The Computational and Storage Potential of Volunteer
Computing”. In Proceedings of the 6th IEEE International Symposium on Cluster Computing
and the Grid (CCGRID’06), pages 73–80, Singapore, May 2006.
53. J. Beauquier, S. Delaët and S. Haddad. “A 1-Strong Self-stabilizing Transformer”. In
A. K. Datta and M. Gradinariu, editors, SSS, volume 4280 of Lecture Notes in Computer
Science, pages 95-109, 2006. Springer.
54. J. Beauquier, S. Delaët and S. Haddad. “Necessary and sufficient conditions for 1adaptivity”. In Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes Island, Greece, April 2006. IEEE.
55. J. Beauquier, C. Johnen and S. Messika. “All k-Bounded Policies Are Equivalent for
Self-stabilization”. In A. K. Datta and M. Gradinariu, editors, SSS, pages 82-94, 2006.
Springer.
96
56. J. Beauquier, C. Johnen and S. Messika. “Brief Announcement : Computing Automatically the Stabilization Time Against the Worst and the Best Schedules”. In DISC,
pages 543-547, 2006. Springer.
57. C. Coti, T. Herault, P. Lemarinier, L. Pilard, A. Rezmerita, E. Rodriguez and F. Cappello.
“Blocking vs. Non-Blocking Coordinated Checkpointing for Large-Scale Fault Tolerant MPI”. In Int. Conf. for High Performance Computing, Networking, Storage and Analysis
(SC2006), pages 18–24, Tampa, USA, November 2006. IEEE/ACM.
58. P. Danturi, M. Nesterenko and S. Tixeuil. “Self-stabilizing Philosophers with Generic
Conflicts”. In A. K. Datta and M. Gradinariu, editors, Eighth International Symposium
on Stabilization, Safety, and Security on Distributed Systems (SSS 2006), Lecture Notes in
Computer Science, pages 214-230, Dallas, Texas, November 2006. Springer Verlag.
59. A. Dasgupta, S. Ghosh and S. Tixeuil. “Selfish Stabilization”. In A. K. Datta and M.
Gradinariu, editors, Eighth International Symposium on Stabilization, Safety, and Security
on Distributed Systems (SSS 2006), Lecture Notes in Computer Science, pages 231-243,
Dallas, Texas, November 2006. Springer Verlag.
60. K. G. Dastidar, T. Herman and C. Johnen. “Safe Peer-to-Peer Self-Downloading”. In
A. K. Datta and M. Gradinariu, editors, SSS, volume 4280 of Lecture Notes in Computer
Science, pages 324-334, 2006. Springer.
61. X. Defago, M. Gradinariu, S. Messika and P. R. Parvedy. “Fault-Tolerant and Selfstabilizing Mobile Robots Gathering”. In S. Dolev, editor, DISC, pages 46-60, 2006.
Springer.
62. A. Denise, M-C. Gaudel, S-D. Gouraud, R. Lassaigne and S. Peyronnet. “Uniform random sampling of traces in very large models”. In J. Mayer and R. G. Merkel, editors,
Proceedings of the 1st International Workshop on Random Testing, pages 10-19, 2006. ACM.
63. T. Herault, R. Lassaigne and S. Peyronnet. “APMC 3.0 : Approximate Verification of
Discrete and Continuous Time Markov Chains”. In Proceedings of the 3rd International
Conference on the Quantitative Evaluation of SysTems (QEST’06), pages 129 – 130, California,
USA, September 2006.
64. T. Herault, P. Lemarinier, O. Peres, L. Pilard and J. Beauquier. “Brief Announcement :
Self-stabilizing Spanning Tree Algorithm for Large Scale Systems”. In A. K. Datta
and M. Gradinariu, editors, SSS, volume 4280 of Lecture Notes in Computer Science, pages
574-575, 2006. Springer.
65. L. Higham and C. Johnen. “Relationships between communication models in networks
using atomic registers”. In Proceedings of the 20th International Parallel and Distributed
Processing Symposium (IPDPS 2006), Rhodes Island, Greece, April 2006. IEEE.
66. C. Johnen and L. H. Nguyen. “Robust Self-Stabilizing Clustering Algorithm”. In International Conference on Principles of Distributed Systems (OPODIS 2006), pages 408-422,
67. D. Kondo, G. Fedak, F. Cappello, A. A. Chien and H. Casanova. “On Resource Volatility in Enterprise Desktop Grids”. In Proceedings of the 2nd IEEE International Conference
on e-Science and Grid Computing (eScience’06), pages 78–86, Amsterdam, Netherlands, December 2006.
68. D. Kondo, B. Kindarji, G. Fedak and F. Cappello. “Towards Soft Real-Time Applications
on Enterprise Desktop Grids”. In Proceedings of the 6th IEEE International Symposium on
Cluster Computing and the Grid (CCGRID ’06), pages 65–72, Singapore, May 2006.
97
69. R. Lassaigne and S. Peyronnet. “Probabilistic Verification and Approximation”. In 12th
Workshop on Logic, Language, Information and Computation, volume 143 of ENTCS, pages
101-114, 2006.
70. T. Masuzawa and S. Tixeuil. “On Bootstrapping Topology Knowledge in Anonymous
Networks”. In A. K. Datta and M. Gradinariu, editors, Eighth International Symposium
on Stabilization, Safety, and Security on Distributed Systems (SSS 2006), Lecture Notes in
Computer Science, pages 454-468, Dallas, Texas, November 2006. Springer Verlag.
71. T. Masuzawa and S. Tixeuil. “Bounding the Impact of Unbounded Attacks in Stabilization”. In A. K. Datta and M. Gradinariu, editors, Eighth International Symposium on
Stabilization, Safety, and Security on Distributed Systems (SSS 2006), Lecture Notes in Computer Science, pages 440-453, Dallas, Texas, November 2006. Springer Verlag.
72. N. Mitton, E. Fleury, I. Guerin-Lassous, B. Sericola and S. Tixeuil. “On Fast Randomized
Colorings in Sensor Networks”. In Proceedings of ICPADS 2006, pages 31-38, July 2006.
IEEE Press.
73. Y. Nakajima, M. Sato, Y. Aida, T. Boku and F. Cappello. “Integrating Computing Resources on Multiple Grid-enabled Job Scheduling Systems Through a Grid RPC System”. In IEEE International Symposium on Cluster Computing and the Grid, Singapore, 2006.
74. M. Nesterenko and S. Tixeuil. “Discovering Network Topology in the Presence of Byzantine Nodes”. In Prooceedings of Sirocco 2006, pages 212-226, Chester, UK, July 2006.
Springer Verlag.
75. J. Beauquier, L. Pilard and B. Rozoy. “Observing Locally Self-stabilization in a Probabilistic Way”. In P. Fraigniaud, editor, DISC’05, the 19th International Symposium on
Distributed Computing, volume 3724 of Lecture Notes in Computer Science, pages 399-413,
2005. Springer.
76. F. Cappello, F. Desprez, M. Dayde, E. Jeannot, Y. Jegou, S. Lanteri, N. Melab, R. Namyst, P. Primet, O. Richard, E. Caron, J. Leduc and G. Mornet. “Grid’5000 : A Large
Scale, Reconfigurable, Controlable and Monitorable Grid Platform”. In 6th IEEE/ACM
International Workshop on Grid Computing, Seattle, USA, 2005.
77. J. Darbon and S. Peyronnet. “A Vectorial Self-dual Morphological Filter Based on Total
Variation Minimization”. In G. Bebis, R. D. Boyle, D. Koracin and B. Parvin, editors,
Advances in Visual Computing, First International Symposium, ISVC 2005, volume 3804 of
Lecture Notes in Computer Science, pages 388-395, 2005. Springer.
78. S. Delaët, B. Ducourthial and S. Tixeuil. “Self-stabilization with r-Operators Revisited”.
In T. Herman and S. Tixeuil, editors, Self-Stabilizing Systems, volume 3764 of Lecture Notes
in Computer Science, pages 68-80, 2005. Springer.
79. M. Duflot, L. Fribourg, T. Herault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet
and C. Picaronny. “Probabilistic Model Checking of the CSMA/CD Protocol Using
PRISM and APMC”. In Proceedings of the 4th International Workshop on Automated Verification of Critical Systems (AVoCS 2004), volume 128(6), pages 195-214, 2005.
80. P. Fraigniaud, D. Ilcinkas, S. Rajsbaum and S. Tixeuil. “Space lower bounds for graph
exploration via reduced automata”. In A. Pelc and M. Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont
Saint-Michel, France, May 24-26, 2005, Proceedings, volume 3499 of Lecture Notes in Computer Science, pages 140-154, May 2005. Springer Verlag.
81. L. Fribourg and S. Messika. “Brief Announcement : Coupling for Markov Decision
Processes — Application to Self-Stabilization with Arbitrary Schedulers”. In M. K.
98
Aguilera and J. Aspnes, editors, Proceedings of the Twenty-Fourth Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (PODC’05), pages 322, Las Vegas, Nevada, USA, July 2005. ACM Press.
82. G. Guirado, T. Herault, R. Lassaigne and S. Peyronnet. “Distribution, approximation
and probabilistic model checking”. In Proceedings of the 4th International Workshop on
Parallel and Distributed Methods in verifiCation (PDMC’05), pages 19–30, Lisbon, Portugal,
July 2005.
83. W. Hoarau and S. Tixeuil. “A language-driven tool for fault injection in distributed
applications”. In Proceedings of the IEEE/ACM Workshop GRID 2005, Seattle, USA, November 2005.
84. P. Lemarinier, A. Bouteiller, T. Herault, G. Krawezik and F. Cappello. “Impact of Event
Logger on Causal Message Logging Protocols for Fault Tolerant MPI”. In Proceedings of
the Int Parallel and Distributed Processing Symposium (IPDPS 05), Denver, USA April 2005,
pages 97–107, Denver, USA, April 2005.
85. T. Masuzawa and S. Tixeuil. “A Self-stabilizing Link Coloring Algorithm Resilient
to Unbounded Byzantine Faults in Arbitrary Networks”. In Proceedings of the International Conference On Principles Of DIstributed Systems (OPODIS 2005), Lecture Notes in
Computer Science, pages 118-129, Pisa, Italy, December 2005. Springer-Verlag.
86. N. Mitton, E. Fleury, I. Guerin-Lassous and S. Tixeuil. “Self-stabilization in Selforganized Wireless Multihop Networks”. In Proceedings of International Workshop on Wireless Ad Hoc Networking (WWAN’05), pages 909-915, Columbus, Ohio, USA, June 2005.
IEEE Press.
87. B. Wei, G. Fedak and F. Cappello. “Collaborative Data Distribution with BitTorrent for
Computational Desktop Grids”. In Proceedings of the The 4th International Symposium on
Parallel and Distributed Computing (ISPDC’05), pages 250-257, Lille, France, June 2005.
88. B. Wei, G. Fedak and F. Cappello. “Scheduling Independent Tasks Sharing Large Data
Distributed with BitTorrent”. In 6th IEEE/ACM International Workshop on Grid Computing, pages 219–226, Seattle, USA, November 2005.
89. P. Malecot, D. Kondo and G. Fedak. “XtremLab : Une plateforme pour l’observation et
la caracterisation des grilles de PC sur Internet”. In Rencontres francophones du parallelisme (Renpar’06), Perpignan, France, October 2006.
90. B. Quetier and V. Neri. “V-Meter : Microbenchmark pour evaluer les utilitaires de
virtualisation dans la perspective de systemes d’emulation a grande echelle”. In 16eme
Rencontres Francophones du Parallelisme (RenPar’16), Le Croisic, France, April 2005.
91. J. Beauquier and Y-J. Hu. “Intrusion detection based on distance combination”. In
Proceedings of the International Conference on Computer, Electrical, and Systems Science, and
Engineering, Venice, Italy, November 2007. World Acacemy of Sciences, WAS.
99
92. F. Bouabache, T. Herault, G. Fedak and F. Cappello. “A Distributed and Replicated
Service for Checkpoint Storage”. In CoreGRID Workshop on Grid programming model, Grid
and P2P systems architecture and Grid systems, tools and environments, Heraklion, Greece,
2007.
93. F. Greve and S. Tixeuil. “Connaissance vs. Synchronie pour l’Accord Tolerant aux
Pannes dans les Reseaux Inconnus”. In INRIA, editor, Proceedings of Algotel 2007, Oleron, May 2007.
94. F. Greve and S. Tixeuil. “Condicoes de Conectividade para Realizacao de Acordo Tolerante a Falhas em Sistemas Auto-Organizaveis”. In Simposio Brasileiro de Redes de Computadores e Sistemas Distribuidos (SBRC 2007), May 2007.
95. L. Grigori and X. S. Li. “Towards An Accurate Performance Modeling of Parallel Sparse
LU Factorization”. In SIAM Conference on Computational Science and Engineering, 2007.
Asbtract Proceedings.
96. L. Grigori, H. Xiang, J. Demmel, M. Hoemmen and J. Langou. “Communication avoiding dense QR and LU factorizations”. In Matrix Analysis and Applications (M2A07),
2007. Abstract Proceedings.
97. D. Kondo, F. Araujo, P. Domingues and L. M. Silva. “Result Error Detection on Heterogeneous and Volatile Resources Via Intermediate Checkpointing”. In Coregrid Integration Workshop, Crete, Greece, 2007.
98. X. S. Li, J. Demmel, L. Grigori, M. Gu, J. Xia, S. Jardin, C. Sovinec and L-Q. Lee. “Enhancing scalability of sparse direct methods”. In Journal of Physics : Conference Series,
volume 78, 2007.
99. F. Araujo, P. Domingues, D. Kondo and L. M. Silva. “Validating Desktop Grid Results
By Comparing Intermediate Checkpoints”. In CoreGRID Integration Workshop 2006, Krakow, Poland, October 2006.
100. M. Cadilhac, T. Herault and P. Lemarinier. “Message Relaying Techniques for Computational Grids and their Relations to Fault Tolerant Message Passing for the Grid”.
In Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, Paris, France,
January 2006.
101. A. Demaille, T. Herault and S. Peyronnet. “Probabilistic verification of sensor networks”. In Proceedings of the 4th IEEE International Conference on Computer Science, Research, Innovation and Vision for the Future, pages 45–54, 2006.
102. H. He, G. Bergere, Z. Wang and S. G. Petiton. “Solving linear systems on global computing architecture with GMRES method”. In International Conference on Distributed Computing and Applications for Business Engineering and Sciences, Hangzhou, China, October
12-15 2006.
103. W. Hoarau, P. Lemarinier, T. Herault, E. Rodriguez, S. Tixeuil and F. Cappello. “FAILMPI : How fault-tolerant is fault-tolerant MPI ?” In Proceedings of Cluster 2006, pages
electronic, Barcelona, Spain, September 2006.
104. W. Hoarau, L. Silva and S. Tixeuil. Integrated Research in Grid Computing, chapter Faultinjection and Dependability Benchmarking for GRID Computing Middleware, CoreGRID, Springer Verlag, 2006.
105. W. Hoarau and S. Tixeuil. “Easy fault injection and stress testing with FAIL-FCI”. In
Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, Paris, France,
January 2006.
100
106. W. Hoarau, S. Tixeuil, N. Moreno, D. Sousa and L. Silva. “Benchmarking the OGSADAI Middleware”. In Second Coregrid Integration Workshop, Krakow, Poland, October
2006.
107. W. Hoarau, S. Tixeuil and F. Vauchelles. “Fault Injection in Distributed Java Applications”. In International Workshop on Java for Parallel and Distributed Computing (joint with
IPDPS 2006), Greece, April 2006. IEEE.
108. C. Johnen and L. H. Nguyen. “Clustering Algorithm for Ad hoc Networks”. In AlgoSensors’2006, the 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks,
Springer LNCS :4240, pages 83-94, 2006.
109. N. Mitton, E. Fleury, I. Guerin-Lassous, B. Sericola and S. Tixeuil. “Convergence dans
les reseaux sans fil”. In Proceedings of Algotel 2006, May 2006. INRIA.
110. B. Quetier, V. Neri and F. Cappello. “Selecting A Virtualization System For Grid/P2P
Large Scale Emulation”. In Workshop on Experimental Grid testbeds for the assessment of
large-scale distributed applications and tools (EXPGRID’06) (HPDC-15’s workshop), Paris,
France, 19-23 june 2006.
111. A. Rezmerita, T. Morlier, V. Neri and F. Cappello. “Private Virtual Cluster : infrastructure and protocol for Instant Grids”. In Proc. of the Int. Euro-Par Conf. on Parallel Processing (Euro-Par 2006), pages 393-404, Dresden, Germany, 2006.
112. S. Tixeuil, W. Hoarau and L. Silva. “An Overview of Existing Tools for Fault-Injection
and Dependability Benchmarking in Grids”. In Second CoreGRID Workshop on Grid and
Peer to Peer Systems Architecture, Paris, France, January 2006.
113. N. Mitton, E. Fleury, I. Guerin-Lassous and S. Tixeuil. “Auto-stabilisation dans les reseaux ad hoc”. In Proceedings of Algotel 2005, pages 45-48, May 2005.
114. S. G. Petiton, H. He and G. Bergere. “Large Scale Linear System Global Computing”.
In IMACS’2005, the 17th IMACS World Congress on Scientific Computation, Applied Mathematics and Simulation, Paris, France, 11–15 July 2005.
115. B. Quetier and F. Cappello. “A survey of Grid research tools : simulators, emulators
and real life platforms”. In IMACS’2005, the 17th IMACS World Congress on Scientific
Computation, Applied Mathematics and Simulation, Paris, France, July 2005.
116. S. Tixeuil, L. M. Silva, W. Hoarau, G. Jesus, J. Bento and F. Telles. “Fault-Injection and
Dependability Benchmarking for Grid Computing Middleware”. In Proceedings of CoreGrid Integration Workshop, November 2005.
117. C. Coti, A. Rezmerita, T. Herault and F. Cappello. “Grid Services for MPI”. In F. Cappello, J. Dongarra and T. Herault, editors, Poster in Proceedings of the 14th European
PVM/MPI User’s Group Meeting, number 4757 in LNCS, pages 388-389, Paris, France,
October 2007. LNCS.
118. B. Quetier, T. Herault, V. Neri and F. Cappello. “Virtual Parallel Machines Through
Virtualization : Impact on MPI Executions”. In F. Cappello, J. Dongarra and T. Herault,
editors, Poster in Proceedings of the 14th European PVM/MPI User’s Group Meeting, number
4757 in LNCS, pages 378-379, Paris, France, October 2007. LNCS.
119. H. Xiang and L. Grigori. “Kronecker product approximation preconditioner for
convection-diffusion model problems”. In International Conference on Preconditioning
Techniques, July 2007. Abstract Proceedings.
101
120. P. Malecot, D. Kondo and G. Fedak. “XtremLab : A System for Characterizing Internet
Desktop Grids”. In Poster in The 15th IEEE International Symposium on High Performance
Distributed Computing HPDC’06, Paris, France, June 2006.
121. F. Cappello, G. Fedak, T. Morlier and O. Lodygensky. Encyclopedie de l’informatique et
des systemes d’information, chapter Des systemes client-serveur aux systemes pair a pair,
Vuibert, 2007.
122. W. Hoarau, S. Tixeuil, N. Rodrigues, D. Sousa and L. Silva. Integrated Research in GRID
COmputing, chapter Benchmarking the OGSA-DAI middleware, Springer Verlag, 2007.
123. S. Tixeuil. Wireless Ad Hoc and Sensor Networks, chapter Fault-tolerant distributed algorithms for scalable systems, pages 251-284, Information, Commande, Communication,
ISTE, October 2007. ISBN : 978 1 905209 86.
124. P. Fraigniaud, D. Ilcinkas, S. Rajsbaum and S. Tixeuil. Shimon Even Festschrift, chapter
The reduced automata technique for graph exploration space lower bounds, pages 126, number 3895 in Lecture Notes in Computer Science, Springer-Verlag Berlin Heidelberg,
2006.
125. S. Tixeuil. Reseaux mobiles ad hoc et reseaux de capteurs sans fils, chapter Algorithmique
repartie tolerante aux pannes dans les systemes a grande echelle, pages 251-284, Information, Commande, Communication, Lavoisier, March 2006.
126. F. Cappello. Les enjeux de l’informatique de demain, chapter Les Grilles : les defis de la globalisation des ressources informatiques et des donnees (Luis Farinas del Cerro editor),
Lavoisier, 2005.
127. F. Cappello, G. Fedak, T. Morlier and O. Lodygensky. Encyclopedie Vuibert, chapter Des
systemes client-serveur aux systemes pair a pair, Vuibert, 2005.
128. F. Cappello, T. Herault and J. Dongarra, editors. Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User’s Group Meeting, number
4757 in LNCS, Paris, France. Springer, October 2007.
129. T. Masuzawa and S. Tixeuil, editors. Reliability, Availibility, and Security, 1st International
Workshop, WRAS 2007, Paris, France, November 16, 2007, Proceedings. Univ. Paris 6, 2007.
130. T. Masuzawa and S. Tixeuil, editors. Stabilization, Safety, and Security of Distributed Systems, 9th International Symposium, SSS 2007, Paris, France, November 14-16, 2007, Proceedings, volume 4838 of Lecture Notes in Computer Science. Springer, 2007.
131. F. Cappello, H. Bal and R. Wolski, editors. proceedings of the IEEE HPDC’15 conference,
"High Performance Distributed Computing". IEEE, June 2006. electronic proceedings :
http ://ieeexplore.ieee.org/servlet/opac ?punumber=10993.
132. F. Cappello, M. Sato and A. Iamnitchi, editors. special issue on "Global and Peer-to-Peer
Computing", volume 4(3) of Journal of Grid Computing (JoGC), Springer Netherlands, August 2006. pages 223–353.
133. T. Herman and S. Tixeuil, editors. Self-stabilizing Systems, volume 3764 of Lecture Notes in
Computer Science, Barcelona, Spain. Springer Verlag, October 2005.
102
134. C. Johnen. “Quelques contributions à l’auto-stabilisation”. Rapport scientifique pour
l’obtention de l’Habilitation à diriger des Recherches, Ecole Doctorale d’Informatique
Paris-Sud, Novembre 2007. rapport de recherche du LRI n° 1479.
135. A. Bouteiller. “Conception, comparaison et évaluation de mécanismes de tolérance
aux défaillance pour les applications MPI à très haute performances”. Universite Paris
Sud-XI, 2006.
136. P. Lemarinier. “Fault Tolerant MPI for Global Computing Systems”. Universite Paris
Sud-XI, 2006.
137. O. Lodygensky. “XtremWeb-AUGER : delegation inter plates formes, integration de
services standards, et application a la physique des hautes energies”. Universite Paris
Sud-XI, 2006.
138. S. Tixeuil. “Vers l’Auto-stabilisation des Systemes a Grande Echelle”. Habilitation a
Diriger les Recherches, Universite Paris Sud-XI, Orsay, France, May 2006.
139. G. Krawezik. “Programmation avancee OpenMP des machines NUMA”. Universite
Paris Sud-XI, 2005.
140. S. Delaët, P. S. Mandal, M. Rokicki and S. Tixeuil. “Deterministic Secure Positioning
in Wireless Sensor Networks”. In Proceedings of the ACM/IEEE International Conference
on Distributed Computing in Sensor Networks (DCOSS 2008), Lecture Notes in Computer
Science, June 2008. Springer-Verlag.
141. S. Devismes, S. Tixeuil and M. Yamashita. “Weak vs. Self vs. Probabilistic Stabilization”. In Proceedings of the IEEE International Conference on Distributed Computing Systems
(ICDCS 2008), Beijin, China, June 2008.
142. T. Masuzawa and S. Tixeuil. “Quiescence of Self-stabilizing Gossiping among Mobile
Agents in Graphs”. In Proceedings of 15th International Colloquium on Structural Information and Communication Complexity (Sirocco 2008), Lecture Notes in Computer Science,
Villars-sur-Ollon, Switzerland, June 2008. Springer-Verlag.
143. T. Masuzawa and S. Tixeuil. “Strong Stabilization : Bounding Times Affected by Byzantine Processes in Stabilization”. In Asian Association for Algorithms and Computation
annual meeting (AAAC 2008), Hong Kong, April 2008.
144. H. He, G. Bergere and S. G. Petiton. “A Hybrid GMRES-LS-Arnoldi method to accelerate the parallel solution of linear systems”. An International Journal : Computer and
Mathematics with Applications, 2005.
145. H. He, G. Bergere and S. G. Petiton. “GMRES Method on Lightweight GRID System”.
In 4th International Symposium on Parallel and Distributed Computing, Lille, France, 2005.
103

Publications du LRI pour la période 2005 - 2008

Transcription

Documents pareils

Repérage multilingue des contenus culturels numériques

SOA Mini - David Bonnet

Accès personnalisé multicritères à de multiples sources d

EM Strasbourg Business School

universite de droit d`economie et des sciences

Alienation and Alterity:

La collection M de WETSTYLE remporte le 1er prix à la DPHA

Programme

Appel à communication - University of Wisconsin

2017 CAMPUT CONFERENCE VANCOUVER, BC