Imagen 1 de 2
Galería
Imagen 1 de 2
¿Quieres vender uno?
Mathematics and Computer Science II Algorithms Trees Combinato
USD119,99
Aproximadamente102,40 EUR
o Mejor oferta
Estado:
Como nuevo
Libro en perfecto estado y poco leído. La tapa no tiene desperfectos y si procede, con sobrecubierta para las tapas duras. Incluye todas las páginas sin arrugas ni roturas. El texto no está subrayado ni resaltado de forma alguna, y no hay anotaciones en los márgenes. Puede presentar marcas de identificación mínimas en la contraportada o las guardas. Muy poco usado. Consulta el anuncio del vendedor para obtener más información y la descripción de cualquier posible imperfección.
- ¡Cómpralo ya!Mathematics and Computer Science II Algorithms Trees Combinato
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Envío:
Gratis USPS Media MailTM.
Ubicado en: Prospect, Kentucky, Estados Unidos
Entrega:
Entrega prevista entre el jue. 28 ago. y el jue. 4 sep.
Devoluciones:
30 días para devoluciones. El vendedor paga el envío de la devolución.
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:204397304239
Última actualización el 28 dic 2023 20:11:21 H.EspVer todas las actualizacionesVer todas las actualizaciones
Características del artículo
- Estado
- Book title
- Mathematics and Computer Science II Algorithms Trees Combinato
- Subject
- Computer Science
- ISBN
- 9783764369330
Acerca de este producto
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, Databases / General, Applied, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics, Computers
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
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.
Synopsis
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., This is the second volume in a series of innovative proceedings entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep and innovative mathematical approaches. The book serves as an outstanding tool and a main information source for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and the related modern and powerful mathematical methods. The range of applications is very wide and reaches beyond computer science.
LC Classification Number
T57-57.97
Descripción del artículo del vendedor
Acerca de este vendedor
videogameflips185
100% de votos positivos
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
Votos de vendedor (77)
- r***t (470)- Votos emitidos por el comprador.Último añoCompra verificadaBook arrived very late 11 days after purchase! That is only bad part- book better then expected. Looks almost brand new- bargain compared to others on eBay - true description 5 starStandard Catalog of United States Tokens 1700-1900 3rd- Paperback - Light wear (#205211820285)
- o***m (286)- Votos emitidos por el comprador.Último añoCompra verificadaA+ seller thank you1953-D 90% Silver Franklin Half Dollar 50c / NGC / MS63 FBL (#205211948600)
- a***l (16)- Votos emitidos por el comprador.Hace más de un añoCompra verificadaIt was in great condition as ot was advertised. Came really fast, faster than I expected and very excited that it also had the manual. Love it very much.Metroid Prime with Bonus Disc Echoes Nintendo Gamecube CIB- Tested/ Authentic (#204851717478)