{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"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":64,"n_cols":5,"rows_kept":64,"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],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[32,2,32,3],[33,2,33,3],[36,2,36,3],[36,4,36,5],[37,2,37,3],[37,4,37,5],[38,2,38,3],[39,2,39,3],[40,2,40,3],[41,2,41,3],[42,2,42,3],[43,2,43,3],[44,2,44,3],[56,2,56,3],[57,2,57,3],[61,2,61,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990008303650403321"]
[null,null,"Autore",null,"Italia : . Ministero delle finanze : . Provveditorato generale dello Stato"]
[null,null,"Titolo",null,"Disposizioni legislative e regolamentari di normale applicazione per i servizi del provveditorato generale : (aggiornate al 31 luglio 1940-XVIII) / Ministero delle finanze. Provveditorato generale dello Stato"]
[null,null,"Pubbl/distr/stampa",null,"Roma : Istituto poligrafico dello Stato. Libreria, 1940"]
[null,null,"Descrizione fisica",null,"v. ; 24 vm"]
[null,null,"Disciplina",null,"330"]
[null,null,"Locazione",null,"DDA"]
[null,null,"Collocazione",null,"Dono Prof.Di Renzo 45 (2)"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","volume II"]
[null,"2.","Record Nr.",null,"UNINA9910407552603321"]
[null,null,"Titolo",null,"Itinerario"]
[null,null,"Pubbl/distr/stampa",null,"[Leyden], : [Leiden Centre for the History of European Expansion]"]
[{"$nulls":4},"[Cambridge], : Cambridge University Press"]
[null,null,"ISSN",null,"2041-2827"]
[null,null,"Disciplina",null,"325.305"]
[null,null,"Soggetti",null,"Colonies - History"]
[{"$nulls":4},"Imperialism - History"]
[{"$nulls":4},"Colonies"]
[{"$nulls":4},"Imperialism"]
[{"$nulls":4},"Netherlandish colonies"]
[{"$nulls":4},"Imperialisme"]
[{"$nulls":4},"Colònies"]
[{"$nulls":4},"History"]
[{"$nulls":4},"Periodicals."]
[{"$nulls":4},"Internet resources."]
[{"$nulls":4},"Revistes electròniques."]
[{"$nulls":4},"Netherlands Colonies Periodicals"]
[{"$nulls":4},"Països Baixos"]
[{"$nulls":4},"Europa"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Periodico"]
[null,null,null,"Note generali","Refereed/Peer-reviewed"]
[null,"3.","Record Nr.",null,"UNINA9910767575803321"]
[null,null,"Titolo",null,"Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-44808-X"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 236 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2153"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Database management"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Database Management"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Numeric Computing"]
[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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven "]
[{"$nulls":4},"Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001.The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining."]