ANR SADA : PUBLICATIONS

De nombreux documents peuvent être obtenus sur la page des membres.


retour


Thèses soutenues

O. Bernardi, LaBRI, Bordeaux. Soutenance prévue le 8 septembre 2006. Direction : M. Bousquet-Mélou. Financement : allocation couplée.

Julien Fayolle. Compression de données sans perte et combinatoire analytique. Thèse, Université Paris VI, mars 2006.

L. Lhote, GREYC, Caen « Algorithmes du PGCD et Fouille de Données : un point de vue dynamique ». Direction : B. Vallée, allocataire-moniteur, soutenance prévue le 8 septembre 2006.



Articles publiés, acceptés ou soumis

A. Akhavi, J.-F. Marckert, A. Rouault , On the reduction of a random basis. Soumis.

Nelson Antunes, Christine Fricker, Philippe Robert, et Danielle Tibi. Analysis of loss networks with routing. Annals of Applied Probability, 2006.

M. Archibald, J. Clément, Average depth in a binary search tree with repeated keys, à paraître dans DMTCS, in Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy.

F. Bassino , J. Clément, G. Seroussi, et A.Viola, Optimal prefix codes for pairs of geometrically-distributed random variables, à paraître dans IEEE International Symposium on Information Theory (ISIT 2006).

F. Bassino , J. Clément, G. Seroussi, et A.Viola, Optimal prefix codes for some families of two-dimensional geometric distributions, in Data Compression Conference (DCC) 2006, IEEE Computer Society Press: 113-122 (2006).

J. Bourdon et B. Vallée, Pattern Matching Statistics on Correlated sources, Proceedings of LATIN'06, LNCS 3887, pp 224-237.

O. Bernardi, Bijective counting of tree-rooted maps and shuffles of parenthesis systems, math.CO/0601684. Soumis.

O. Bernardi, Bijective counting of Kreweras walks and loopless triangulations, FPSAC 06, math.CO/0605320.

O. Bernardi, On triangulations with high vertex degree, ArXiv: math.CO/0601678, à paraître dans
Annals of Combinatorics.

O. Bernardi, A new characterization of the Tutte polynomial via embedded graphs, soumis, 2006.

Olivier Bodini, Eric Fusy, et Carine Pivoteau. Random sampling of plane partitions. A paraître dans Proceedings of GASCOM'06 (Dijon, September 2006).

M. Bousquet-Mélou, Rational and algebraic series in combinatorial enumeration, Actes du Congrès International des Mathématiciens, Madrid, août 2006.

M. Bousquet-Mélou, Limit laws for embedded trees. Applications to the integrated superBrownian excursion, math.CO/0501266. À paraître dans Random Structures Algorithms.

M. Bousquet-Mélou et S. Janson, The density of the ISE and local limit laws for embedded trees, à paraître dans Annals of Applied Probability.

M. Bousquet-Mélou et S. Butler, Forest-like permutations, ArXiv math.CO/0603617. Soumis.

M. Bousquet-Mélou, Three osculating walkers, à paraître dans Journal of Physics: Conference Series.

E. Cesaratto et B. Vallée, Hausdorff dimension of real numbers with bounded digit averages [33 pages], soumis à Acta Arithmetic.

E. Cesaratto , A. Plagne et B. Vallée, On the non-randomness of modular arithmetic progressions: a solution to a problem of V. I. Arnold [12 pages], à paraître dans DMTCS, in Fourth Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probability.

E. Cesaratto, Remarks and extensions on the paper « Euclidean algorithms are Gaussian » by V. Baladi and B. Vallée, soumis.

B. Chauvin, P. Cenac, S. Ginouillac et N. Pouyanne. Digital Search Trees and Chaos Game Representation, Soumis, ESAIM, P-S, (2006)

Eric Conrad et Philippe Flajolet. The Fermat cubic, elliptic functions, continued fractions, and a combinatorial excursion. In Séminaire Lotharingien de Combinatoire (SLC) volume
54 (2006), pages 1--44.

B. Daireaux, L. Lhote, V. Maume-Deschamps et B. Vallée, Analysis of fast versions of the Euclid Algorithm} [20 pages], soumis.

E. Duchi, S. Rinaldi et G. Schaeffer, The number of Z-convex polyominos, FPSAC’06

P. Duchon, N. Hanusse, N. Saheb, A. Zemmari, Broadcast in the rendezvous model. Information and Computation 204(5), pp 697-712, 2006.

P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel, Could any graph be turned into a small-world? Theoretical Computer Science 355(1), pp. 96-103, 2006.

P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel, Towards small world emergence. To appear in SPAA 2006 proceedings (Symposium on Parallelism in Algorithms and Architectures)

P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel, Could any graph be turned into a small world? Proceedings of DISC 2005 (Distributed Computing), LNCS 3724, pp 511-513, 2005.

Philippe Flajolet, Wojciech Szpankowski, et Brigitte Vallée. Hidden Word Statistics. In Journal of the ACM, Volume 53:1, January 2006, pages 147--183.

Philippe Flajolet. The Ubiquitous Digital Tree. Invited lecture at the annual Symposium on Theoretical Aspects of Computer Science, Marseille, February 2006. In STACS 2006, Volume 3884 of Lecture Notes in Computer Science, B. Durand and W. Thomas Ed., pp. 1-22.

Philippe Flajolet, Eric Fusy, et Carine Pivoteau Boltzmann sampling of unlabelled structures. En préparation.

J.-M. Labarbe, J.-F. Marckert, Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks (Arxiv : math.PR/0601624).

C. Lavault, J.-F. Marckert, V. Ravelomanana, Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks. Soumis.

Y. Le Borgne, Counting upper interactions in Dyck paths, Séminaire Lotharingien de Combinatoire, 54, 2006.

Y. Le Borgne, An algorithm to describe bijections involving Dyck paths, FPSAC 06 (San Diego).

L. Lhote et B. Vallée, Sharp estimates for the main parameters of the Euclid Algorithm, Proceedings of LATIN'06, LNCS 3887, pp 689-702.

L. Lhote et B. Vallée, Gaussian laws for the main parameters of the Euclid Algorithms, [35 pages] article invité dans le numéro spécial d’Algorithmica pour LATIN’06

J.-F. Marckert,
G. Miermont, Invariance principles for random bipartite planar maps (Arxiv: math.PR/0504110) à paraître dans Annals of Probability.

J.-F. Marckert, Globally centered discrete snakes,
Arxiv : math.PR/0606338.

J.-F. Marckert, A. Mokkadem, Limit of Normalized Quadrangulations: the Brownian map (Arxiv : math.PR/0403398), à paraître dans Annals of Probability.

Hanene Mohamed et Philippe Robert. A probabilistic analysis of a leader election algorithm. Mathematics and Computer Science (Nancy 2006), à paraître.

N. Pouyanne, (2005). Classification of large Pólya-Eggenberger urns with regard to their asymptotics, Discrete Mathematics and Theoretical Computer Science, AD, 275-286.

N. Pouyanne, An algebraic approach of large Pólya processes, soumis Annales de l'IHP (2006), 44 pages.

G. Schaeffer et E. Vassilieva, A bijection for unicellular partitioned bicolored maps, FPSAC’06.

B. Vallée, Statistics for dynamical sources, Proceedings of ITW'06.

B. Vallée, Euclidean Dynamics, Discrete and Continuous Dynamical Systems, 15 (1) May 2006, pp 281-352.





retour