|
|
|
|
| LEADER |
05008nmm a2200421 u 4500 |
| 001 |
EB000636645 |
| 003 |
EBX01000000000000000489727 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783034879156
|
| 100 |
1 |
|
|a Drmota, Michael
|e [editor]
|
| 245 |
0 |
0 |
|a Mathematics and Computer Science III
|h Elektronische Ressource
|b Algorithms, Trees, Combinatorics and Probabilities
|c edited by Michael Drmota, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Basel
|b Birkhäuser
|c 2004, 2004
|
| 300 |
|
|
|a XV, 556 p. 26 illus
|b online resource
|
| 505 |
0 |
|
|a I. Combinatorics and Random Structures -- Common Intervals of Permutations -- Overpartitions and Generating Functions for Generalized Frobenius Partitions -- Enumerative Results on Integer Partitions Using the ECO Method -- 321-Avoiding Permutations and Chebyshev Polynomials -- Iterated Logarithm Laws and the Cycle Lengths of a Random Permutation -- Transcendence of Generating Functions of Walks on the Slit Plane -- Some Curious Extensions of the Classical Beta Integral Evaluation -- Divisor Functions and Pentagonal Numbers -- II. Graph Theory -- On Combinatorial Hoeffding Decomposition and Asymptotic Normality of Subgraph Count Statistics -- Avalanche Polynomials of Some Families of Graphs -- Perfect Matchings in Random Graphs with Prescribed Minimal Degree -- Estimating the Growth Constant of Labelled Planar Graphs -- The Number of Spanning Trees in P4-Reducible Graphs -- III. Analysis of Algorithms -- On the Stationary Search Cost for the Move-to-Root Rule with Random Weights --
|
| 505 |
0 |
|
|a Dual Random Fragmentation and Coagulation and an Application to the Genealogy of Yule Processes -- Semi-Markov Walks in Queueing and Risk Theory -- Representation of Fixed Points of a Smoothing Transformation -- Stochastic Fixed Points for the Maximum -- The Number of Descents in Samples of Geometric Random Variables -- Large Deviations for Cascades and Cascades of Large Deviations -- Partitioning with Piecewise Constant Eigenvectors -- Yaglom Type Limit Theorem for Branching Processes in Random Environment -- Two-Dimensional Limit Theorem for a Critical Catalytic Branching Random Walk -- VI. Combinatorial Stochastic Processes -- A Combinatorial Approach to Jumping Particles II: General Boundary Conditions -- Stochastic Deformations of Sample Paths of Random Walks and Exclusion Models -- A Markov Chain Algorithm for Eulerian Orientations of Planar Triangular Graphs -- Regenerative Composition Structures: Characterisation and Asymptotics of Block Counts --
|
| 505 |
0 |
|
|a Average-Case Analysis for the Probabilistic Bin Packing Problem -- Distribution of Wht Recurrences -- Probabilistic Analysis for Randomized Game Tree Evaluation -- Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables -- An Efficient Generic Algorithm for the Generation of Unlabelled Cycles -- Using Tries for Universal Data Compression -- IV. Trees -- New Strahler Numbers for Rooted Plane Trees -- An Average-Case Analysis of Basic Parameters of the Suffix Tree -- Arms and Feet Nodes Level Polynomial in Binary Search Trees -- Random Records and Cuttings in Complete Binary Trees -- Multidimensional Interval Trees -- Edit Distance between Unlabelled Ordered Trees -- Number of Vertices of a Given Outdegree in a Galton–Watson Forest -- Destruction of Recursive Trees -- V. Probability -- Restrictions on thePosition of the Maximum/Minimum in a Geometrically Distributed Sample --
|
| 505 |
0 |
|
|a Random Walks on Groups With a Tree-Like Cayley Graph -- Nested Regenerative Sets and Their Associated Fragmentation Process -- VII. Applications -- Real Numbers with Bounded Digit Averages -- Large Deviation Analysis of Space-Time Trellis Codes -- A Zero-One Law for First-Order Logic on Random Images -- Coarse and Sharp Transitions for Random Generalized Satisfyability Problems -- Stochastic Chemical Kinetics with Energy Parameters -- Large Deviations of Bellinger Distance on Partitions -- Estimation of the Offspring Mean for a General Class of Size-Dependent Branching Processes. Application to Quantitative Polymerase Chain Reaction -- A Constrained Version of Sauer’s Lemma -- Author Index
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer Science
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Information visualization
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Data and Information Visualization
|
| 653 |
|
|
|a Probabilities
|
| 700 |
1 |
|
|a Flajolet, Philippe
|e [editor]
|
| 700 |
1 |
|
|a Gardy, Danièle
|e [editor]
|
| 700 |
1 |
|
|a Gittenberger, Bernhard
|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-7915-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-0348-7915-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|