|
|
|
|
| LEADER |
03754nmm a2200469 u 4500 |
| 001 |
EB000636797 |
| 003 |
EBX01000000000000000489879 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783034882118
|
| 100 |
1 |
|
|a Chauvin, Brigitte
|e [editor]
|
| 245 |
0 |
0 |
|a Mathematics and Computer Science II
|h Elektronische Ressource
|b Algorithms, Trees, Combinatorics and Probabilities
|c edited by Brigitte Chauvin, Philippe Flajolet, Daniele Gardy, Abdelkader Mokkadem
|
| 250 |
|
|
|a 1st ed. 2002
|
| 260 |
|
|
|a Basel
|b Birkhäuser
|c 2002, 2002
|
| 300 |
|
|
|a XIII, 543 p
|b online resource
|
| 505 |
0 |
|
|a A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources -- Analysis of Quickfind with Small Subfiles -- Distribution of the Size of Simplified or Reduced Trees -- Digits and Beyond -- Growth Rate and Ergodicity Conditions for a Class of Random Trees -- Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method -- On Random Walks in Random Environment on Trees and Their Relationship with Multiplicative Chaos -- Note on Exact and Asymptotic Distributions of the Parameters of the Loop-Erased Random Walk on the Complete Graph -- Convergence Rate for Stable Weighted Branching Processes -- Reduced Branching Processes in Random Environment -- A Cooperative Approach to Rényi’s Parking Problem on the Circle -- On the Noise Sensitivity of Monotone Functions -- Apprentissage de Séquences Non-Indépendantesd’Exemples -- Entropy Reduction Strategies on Tree Structured Retrieval Spaces -- Zero-One Law Characterizations of ?0 --
|
| 505 |
0 |
|
|a n-Colored Maps and Multilabel n-Colored Trees -- Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps -- Counting Walks in the Quarter Plane -- Bijective Construction of Equivalent Eco-systems -- Random Boundary of a Planar Map -- Enumération des 2-arbres k-gonaux -- Breadth First Search, Triangle-Free Graphs and Brownian Motion -- Random Planar Lattices and Integrated SuperBrownian Excursion -- The Diameter of a Long-Range Percolation Graph -- Giant Components for Two Expanding Graph Processes -- Coloring Random Graphs — an Algorithmic Perspective -- A Sharp Threshold for a Non-monotone Digraph Property -- Approximability of Paths Coloring Problem in Mesh and Torus Networks -- Minimal Spanning Trees for Graphs with Random Edge Lengths -- Generalized Pattern Matching Statistics -- A Note on Random Suffix Search Trees -- On the Profile of Random Forests -- On the Number of Heaps and the Cost of Heap Construction --
|
| 505 |
0 |
|
|a Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs -- Key words -- List of Authors
|
| 653 |
|
|
|a Mathematical statistics
|
| 653 |
|
|
|a Coding and Information Theory
|
| 653 |
|
|
|a Coding theory
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Probability and Statistics in Computer Science
|
| 653 |
|
|
|a Data Structures and Information Theory
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data structures (Computer science)
|
| 653 |
|
|
|a Applications of Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Mathematics
|
| 700 |
1 |
|
|a Flajolet, Philippe
|e [editor]
|
| 700 |
1 |
|
|a Gardy, Daniele
|e [editor]
|
| 700 |
1 |
|
|a Mokkadem, Abdelkader
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Trends in Mathematics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-0348-8211-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-0348-8211-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 519
|