{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":26,"n_cols":5,"rows_kept":26,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[20,2,20,3],[21,2,21,3],[23,2,23,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910392742103321"]
[null,null,"Autore",null,"Chauvin Brigitte"]
[null,null,"Titolo",null,"Arbres pour l’Algorithmique / / by Brigitte Chauvin, Julien Clément, Danièle Gardy"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018"]
[null,null,"ISBN",null,"3-319-93725-1"]
[null,null,"Edizione",null,"[1st ed. 2018.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXXI, 513 p. 223 ill., 51 ill. en couleurs.)"]
[null,null,"Collana",null,"Mathématiques et Applications, , 1154-483X ; ; 83"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Probabilities"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Combinatorial analysis"]
[{"$nulls":4},"Mathematical Applications in Computer Science"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Probability Theory and Stochastic Processes"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Combinatorics"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Introduction -- Partie I Modèles -- 1.Botanique -- 2.Aléa sur les arbres -- 3.Arbres, algorithmes et données -- Partie II Analyses -- 4.Approche combinatoire -- 5.Approche probabiliste -- 6.Arbres binaires de recherche -- 7.Arbres digitaux -- 8.Arbres m-aires et quadrants -- 9.Urnes de Pólya et applications -- A.Rappels algorithmiques -- B.Rappels mathématiques : combinatoire -- C.Rappels mathématiques : probabilités -- D.Un peu d’histoire -- E.Rappel des notations utilisées -- References -- Index -- Liste des auteurs."]
[null,null,null,"Sommario/riassunto","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 "]
[{"$nulls":4},"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 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."]