Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 30,00 per la spedizione da Germania a U.S.A.
Destinazione, tempi e costiEUR 8,00 per la spedizione da Italia a U.S.A.
Destinazione, tempi e costiDa: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
XXXI, 513 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Mathématiques et Applications. Volume 83. Sprache: Englisch. Codice articolo 1620LB
Quantità: 1 disponibili
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo 96cdae3a5ee45f63c25b81005bfc944f
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 32979692-n
Quantità: 15 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. Cet ouvrage presente les types d'arbres les plus utilises en informatique, sous les angles algorithmique et mathematique. Pour chaque type, nous donnons les algorithmes courants associes et des exemples d'utilisation, directe ou en modelisation, puis nous etudions leurs performances d'un point de vue mathematique. Nos outils sont les mathematiques discretes, les probabilites et la combinatoire analytique, presentes ici simultanement.Le public vise est d'abord celui des etudiants de niveau master scientifique ou en derniere annee decole dingenieurs avec un cursus prealable en informatique ou en mathematiques, ou ceux visant une double competence en mathematiques et informatique ; ainsi que toute personne dotee dun bagage scientifique minimal et amenee a utiliser des structures arborescentes liees a des algorithmes, qui souhaiterait avoir une meilleure connaissance de ces structures et une idee des performances des algorithmes associes 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9783319937243
Quantità: 1 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar3113020112886
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 32979692
Quantità: 15 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In French. Codice articolo ria9783319937243_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9783319937243
Quantità: 10 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 544. Codice articolo 26382819124
Quantità: 4 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 548 pp. Französisch. Codice articolo 9783319937243
Quantità: 2 disponibili