{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":32,"n_cols":5,"rows_kept":32,"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],[10,2,10,3],[10,4,10,5],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[26,2,26,3],[27,2,27,3],[30,2,30,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISOBSOBE00062558"]
[null,null,"Autore",null,"Bredekamp, Horst"]
[null,null,"Titolo",null,"Galileo's thinking hand : mannerism, anti-mannerism and the virtue of drawing in the foundation of early modern science / Horst Bredekamp ; translated by Mitch Cohen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; Boston : De Gruyter, 2019"]
[null,null,"Titolo uniforme",null,"Galileis denkende Hand"]
[null,null,"ISBN",null,"9783110520064"]
[null,null,"Descrizione fisica",null,"IX, 366 p. : ill. ; 25 cm"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996465329103316"]
[null,null,"Autore",null,"Ramalingam G"]
[null,null,"Titolo",null,"Bounded Incremental Computation [[electronic resource] /] / by G. Ramalingam"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996"]
[null,null,"ISBN",null,"3-540-68458-1"]
[null,null,"Edizione",null,"[1st ed. 1996.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 196 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 1089"]
[null,null,"Disciplina",null,"004/.01/5114"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Operating systems (Computers)"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Operating Systems"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"On incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions."]
[null,null,null,"Sommario/riassunto","Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs."]