Mathematics and Computer Science II

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 n-Colored Maps and Multilabel n-Colored Trees
3. Altmetric Badge
   Chapter 2 Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps
4. Altmetric Badge
   Chapter 3 Counting Walks in the Quarter Plane
5. Altmetric Badge
   Chapter 4 Bijective Construction of Equivalent Eco-systems
6. Altmetric Badge
   Chapter 5 Random Boundary of a Planar Map
7. Altmetric Badge
   Chapter 6 Enumération des 2-arbres k -gonaux
8. Altmetric Badge
   Chapter 7 Breadth First Search, Triangle-Free Graphs and Brownian Motion
9. Altmetric Badge
   Chapter 8 Random Planar Lattices and Integrated SuperBrownian Excursion
10. Altmetric Badge
    Chapter 9 The Diameter of a Long-Range Percolation Graph
11. Altmetric Badge
    Chapter 10 Giant Components for Two Expanding Graph Processes
12. Altmetric Badge
    Chapter 11 Coloring Random Graphs — an Algorithmic Perspective
13. Altmetric Badge
    Chapter 12 A Sharp Threshold for a Non-monotone Digraph Property
14. Altmetric Badge
    Chapter 13 Approximability of Paths Coloring Problem in Mesh and Torus Networks
15. Altmetric Badge
    Chapter 14 Minimal Spanning Trees for Graphs with Random Edge Lengths
16. Altmetric Badge
    Chapter 15 Generalized Pattern Matching Statistics
17. Altmetric Badge
    Chapter 16 A Note on Random Suffix Search Trees
18. Altmetric Badge
    Chapter 17 On the Profile of Random Forests
19. Altmetric Badge
    Chapter 18 On the Number of Heaps and the Cost of Heap Construction
20. Altmetric Badge
    Chapter 19 A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources
21. Altmetric Badge
    Chapter 20 Analysis of Quickfind with Small Subfiles
22. Altmetric Badge
    Chapter 21 Distribution of the Size of Simplified or Reduced Trees
23. Altmetric Badge
    Chapter 22 Digits and Beyond
24. Altmetric Badge
    Chapter 23 Growth Rate and Ergodicity Conditions for a Class of Random Trees
25. Altmetric Badge
    Chapter 24 Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method
26. Altmetric Badge
    Chapter 25 On Random Walks in Random Environment on Trees and Their Relationship with Multiplicative Chaos
27. Altmetric Badge
    Chapter 26 Note on Exact and Asymptotic Distributions of the Parameters of the Loop-Erased Random Walk on the Complete Graph
28. Altmetric Badge
    Chapter 27 Convergence Rate for Stable Weighted Branching Processes
29. Altmetric Badge
    Chapter 28 Reduced Branching Processes in Random Environment
30. Altmetric Badge
    Chapter 29 A Cooperative Approach to Rényi’s Parking Problem on the Circle
31. Altmetric Badge
    Chapter 30 On the Noise Sensitivity of Monotone Functions
32. Altmetric Badge
    Chapter 31 Apprentissage de Séquences Non-Indépendantes d’Exemples
33. Altmetric Badge
    Chapter 32 Entropy Reduction Strategies on Tree Structured Retrieval Spaces
34. Altmetric Badge
    Chapter 33 Zero-One Law Characterizations of ε 0
35. Altmetric Badge
    Chapter 34 Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs