These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20, 2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support.q2. i. (-5+*aquot;Ad. r(2)r(i-s). 3 2mJ-i_-ix F(2-s)s 3-2*-1-l Now we perform the limit N a agt; oo and get eventually (the computations are not displayed here): ... More general results of this type are currently worked out in collaboration with F. Bassino .
|Title||:||Mathematics and Computer Science II|
|Publisher||:||Springer Science & Business Media - 2002-08-01|