Picture 1 of 1

Have one to sell?

Sell it yourself

Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Proba

grandeagleretail

(927807)

US $124.47

ApproximatelyS$ 160.60

Condition:

Brand New

Quantity:

3 available

Postage:

Free Economy Shipping.

Located in: Fairfield, Ohio, United States

Delivery:

Estimated between Tue, 8 Oct and Tue, 15 Oct to 43230

Returns:

30 days return. Buyer pays for return shipping.

Coverage:

Read item description or contact seller for details. See all detailsSee all details on coverage

(Not eligible for eBay purchase protection programmes)

Shop with confidence

eBay Premium Service

Trusted seller, fast shipping, and easy returns. Learn more- Top Rated Plus - opens in a new window or tab

Report this item - opens in new window or tab

Seller assumes all responsibility for this listing.

eBay item number:395144502445

Last updated on Sep 22, 2024 17:50:07 SGTView all revisionsView all revisions

Item specifics

Condition: Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab

ISBN-13: 9783764371289

Book Title: Mathematics and Computer Science III

ISBN: 9783764371289

Subject Area: Mathematics, Computers

Publication Name: Mathematics and Computer Science III : Algorithms, Trees, Combinatorics and Probabilities

Publisher: Springer Basel A&G

Item Length: 9.3 in

Subject: Computer Science, Graphic Methods, Combinatorics, Discrete Mathematics

Publication Year: 2004

Series: Trends in Mathematics Ser.

Type: Textbook

Format: Hardcover

Language: English

Item Height: 0.5 in

Author: Philippe Flajolet

Item Weight: 36 Oz

Item Width: 6.1 in

Number of Pages: Xv, 556 Pages

About this product

Product Identifiers

Publisher

Springer Basel A&G

ISBN-10

3764371285

ISBN-13

9783764371289

eBay Product ID (ePID)

30969942

Product Key Features

Number of Pages

Xv, 556 Pages

Language

English

Publication Name

Mathematics and Computer Science III : Algorithms, Trees, Combinatorics and Probabilities

Subject

Computer Science, Graphic Methods, Combinatorics, Discrete Mathematics

Publication Year

2004

Type

Textbook

Author

Philippe Flajolet

Subject Area

Mathematics, Computers

Series

Trends in Mathematics Ser.

Format

Hardcover

Dimensions

Item Height

0.5 in

Item Weight

36 Oz

Item Length

9.3 in

Item Width

6.1 in

Additional Product Features

Intended Audience

Scholarly & Professional

LCCN

2004-054580

Dewey Edition

Number of Volumes

1 vol.

Illustrated

Yes

Volume Number

Vol. III

Dewey Decimal

511/.6

Table Of Content

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.- 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.- 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.- 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.

Synopsis

Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers., This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. They will find here current questions in Computer Science and the related modern and powerful mathematical methods. The range of applications is very wide and goes beyond Computer Science., These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the Vienna University of Technology, September 13-17, 2004. This colloquium is the third one in a now regularly established series following the first two venues in September 2000 and September 2002 in Ver sailles. The present issue is centered around Combinatorics and Random Struc tures, Graph Theory, Analysis of Algorithms, Trees, Probability, Combinatorial Stochastic Processes, and Applications. It contains invited papers, contributed papers (lectures) and short communications (posters). The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by Michael Drmota (Vienna Uni versity of Technology, Austria) and composed of Brigitte Chauvin (Universite de Versailles, France), Luc Devroye (McGill University, Canada), Daniele Gardy (Uni versite de Versailles, France), Philippe Flajolet (INRIA Rocquencourt, France), Michal Karonski (Adam Mickiewicz University, Poland), Abdelkader Mokkadem (Universite de Versailles, France), Helmut Prodinger (University of Witwatersrand, South Africa), J. Michael Steele (University of Pennsylvania, Philadelphia, USA), Brigitte Vallee (Universite de Caen, France). We thank them and all anonymous referees for their impressive work.

LC Classification Number

QA75.5-76.95