|Listed in category:
Have one to sell?

Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probab

Condition:
Brand New
3 available
Price:
US $126.99
ApproximatelyRM 598.50
Postage:
Free Economy Shipping. See detailsfor shipping
Located in: Fairfield, Ohio, United States
Delivery:
Estimated between Tue, 9 Jul and Fri, 19 Jul to 43230
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. See details- for more information about returns
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. 

Seller information

Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:386666243501
Last updated on May 19, 2024 16:23:17 MYTView 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
9783764369330
Book Title
Mathematics and Computer Science II
ISBN
9783764369330
Subject Area
Computers, Mathematics
Publication Name
Mathematics and Computer Science II : Algorithms, Trees, Combinatorics and Probabilities
Publisher
Springer Basel A&G
Item Length
9.3 in
Subject
Computer Science, Graphic Methods, Combinatorics, Applied, Databases / General, Discrete Mathematics
Publication Year
2002
Series
Trends in Mathematics Ser.
Type
Textbook
Format
Hardcover
Language
English
Author
Philippe Flajolet
Item Weight
74.8 Oz
Item Width
6.1 in
Number of Pages
Xiii, 543 Pages

About this product

Product Information

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.

Product Identifiers

Publisher
Springer Basel A&G
ISBN-10
3764369337
ISBN-13
9783764369330
eBay Product ID (ePID)
2265621

Product Key Features

Number of Pages
Xiii, 543 Pages
Language
English
Publication Name
Mathematics and Computer Science II : Algorithms, Trees, Combinatorics and Probabilities
Publication Year
2002
Subject
Computer Science, Graphic Methods, Combinatorics, Applied, Databases / General, Discrete Mathematics
Type
Textbook
Subject Area
Computers, Mathematics
Author
Philippe Flajolet
Series
Trends in Mathematics Ser.
Format
Hardcover

Dimensions

Item Weight
74.8 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2002-027905
Dewey Edition
21
Number of Volumes
1 Vol.
Illustrated
Yes
Dewey Decimal
511
Lc Classification Number
T57-57.97
Table of Content
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.- 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.- Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs.- Key words.- List of Authors.
Copyright Date
2002

Item description from the seller

grandeagleretail

grandeagleretail

98.3% positive feedback
2.7M items sold
Usually responds within 24 hours

Detailed Seller Ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
4.9
Communication
4.9

Seller feedback (1,025,595)

r***e (230)- Feedback left by buyer.
Past month
Verified purchase
Thank you!
2***1 (59)- Feedback left by buyer.
Past month
Verified purchase
Fast and easy!
s***- (528)- Feedback left by buyer.
Past month
Verified purchase
Great book. Thank you.