Arbres pour l’Algorithmique
Brigitte Chauvin · Julien Clément · Danièle Gardy
pro 2018. · Mathématiques et Applications Knjiga 83 · Springer
E-knjiga
513
str.
reportOcjene i recenzije nisu potvrđene Saznajte više
O ovoj e-knjizi
Cet ouvrage présente les types d'arbres les plus utilisés en informatique, sous les angles algorithmique et mathématique. Pour chaque type, nous donnons les algorithmes courants associés et des exemples d'utilisation, directe ou en modélisation, puis nous étudions leurs performances d'un point de vue mathématique. Nos outils sont les mathématiques discrètes, les probabilités et la combinatoire analytique, présentés ici simultanément.Le public visé est d'abord celui des étudiants de niveau master scientifique ou en dernière année d’école d’ingénieurs avec un cursus préalable en informatique ou en mathématiques, ou ceux visant une double compétence en mathématiques et informatique ; ainsi que toute personne dotée d’un bagage scientifique « minimal » et amenée à utiliser des structures arborescentes liées à des algorithmes, qui souhaiterait avoir une meilleure connaissance de ces structures et une idée des performances des algorithmes associés sans se plonger dans les travaux originaux.
This book presents a wide range of tree structures, from both a computer science and a mathematical point of view. For each of these structures we give the algorithms that allow us to visit or update the structure, and discuss their potential uses, either directly (for storing data) or in modelling a variety of situations. We present a mathematical approach to their performances; this is done by the systematic and parallel use of tools from discrete mathematics, probability and analytic combinatorics.The book is intended for graduate students in mathematics or computer science (or both) and in engineering schools. It is also suitable for anyone with a basic level of scientific knowledge who may have to use tree structures and related algorithms, and who wishes to get a rigorous knowledge of their performance without going back to the original, often specialized, results.
This book presents a wide range of tree structures, from both a computer science and a mathematical point of view. For each of these structures we give the algorithms that allow us to visit or update the structure, and discuss their potential uses, either directly (for storing data) or in modelling a variety of situations. We present a mathematical approach to their performances; this is done by the systematic and parallel use of tools from discrete mathematics, probability and analytic combinatorics.The book is intended for graduate students in mathematics or computer science (or both) and in engineering schools. It is also suitable for anyone with a basic level of scientific knowledge who may have to use tree structures and related algorithms, and who wishes to get a rigorous knowledge of their performance without going back to the original, often specialized, results.
Ocijenite ovu e-knjigu
Recite nam što mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinkronizira s vašim računom i omogućuje vam da čitate online ili offline gdje god bili.
Prijenosna i stolna računala
Audioknjige kupljene na Google Playu možete slušati pomoću web-preglednika na računalu.
Elektronički čitači i ostali uređaji
Za čitanje na uređajima s elektroničkom tintom, kao što su Kobo e-čitači, trebate preuzeti datoteku i prenijeti je na svoj uređaj. Slijedite detaljne upute u centru za pomoć za prijenos datoteka na podržane e-čitače.
