{"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":51,"n_cols":5,"rows_kept":51,"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],[11,2,11,3],[14,2,14,3],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[43,2,43,3],[44,2,44,3],[48,2,48,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNIBAS000039997"]
[null,null,"Autore",null,"Seneca, Lucius Annaeus <5/4 a.C. - 65 d.C.>"]
[null,null,"Titolo",null,"Dialogues / Sénèque"]
[null,null,"Pubbl/distr/stampa",null,"Paris : <<Les>> belles lettres"]
[null,null,"Titolo uniforme",null,"De ira / Seneca, Lucius Annaeus"]
[null,null,"ISBN",null,"2-251-01232-X"]
[null,null,"Descrizione fisica",null,"4 volumi ; 20 cm"]
[null,null,"Collana",null,"Collection des universités de France"]
[null,null,"Disciplina",null,"188"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[{"$nulls":4},"Latino"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Traduzione francese con testo latino a fronte"]
[null,null,"Nota di contenuto",null,"Tome premier: De ira / texte établi et traduit par A. Bourgery. - Cinquième tirage. - 1971. - XXIV, 109 p. Tome second: De la vie heureuse ; De la brièveté de la vie / texte établi et traduit par A. Bourgery. - Neuvième tirage revu et corrigé. - 1989. - X, 81 p. Tome troisième: Consolations / texte établi et traduit par René Waltz. - Sixième tirage. - 1975. - VIII, 123 p. Tome IV: De la providence ; De la constance du sage ; De la tranquillité de l'ame ; De l'oisiveté / texte établi et traduit par René Waltz. - Sixième tirage. - 1970. - 129 p."]
[null,"2.","Record Nr.",null,"UNISA996392779903316"]
[null,null,"Titolo",null,"To the Kings Most Excellent Majesty, and the Lords and Commons assembled in this present Parliament [[electronic resource] ] : The most humble supplication of all those commission-officers, &c. that have faithfully and constantly served and suffered for your Majesty's royal father of ever blessed memory, and your most sacred Majesty"]
[null,null,"Pubbl/distr/stampa",null,"London, : Printed by R.D., 1661"]
[null,null,"Descrizione fisica",null,"1 sheet ([1] p.)"]
[null,null,"Soggetti",null,"Great Britain History Charles II, 1660-1685 Early works to 1800"]
[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","Verse: \"Nor honour, power, place, preheminence ...\""]
[{"$nulls":4},"Reproduction of original in the British Library."]
[null,null,null,"Sommario/riassunto","eebo-0018"]
[null,"3.","Record Nr.",null,"UNINA9910143898803321"]
[null,null,"Titolo",null,"Randomization and Approximation Techniques in Computer Science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings / / edited by Jose D.P. Rolim, Salil Vadhan"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002"]
[null,null,"ISBN",null,"3-540-45726-7"]
[null,null,"Edizione",null,"[1st ed. 2002.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 284 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2483"]
[null,null,"Disciplina",null,"004/.07/27"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Numeric Computing"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[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,"Counting Distinct Elements in a Data Stream -- On Testing Convexity and Submodularity -- ?-Regular Languages Are Testable with a Constant Number of Queries -- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes -- Counting and Sampling H-Colourings -- Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs -- On the 2-Colorability of Random Hypergraphs -- Percolation on Finite Cayley Graphs -- Computing Graph Properties by Randomized Subcube Partitions -- Bisection of Random Cubic Graphs -- Small k-Dominating Sets of Regular Graphs -- Finding Sparse Induced Subgraphs of Semirandom Graphs -- Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View -- Quantum Walks on the Hypercube -- Randomness-Optimal Characterization of Two NP Proof Systems -- A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms -- Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good -- Is Constraint "]
[{"$nulls":4},"Satisfaction Over Two Variables Always Easy? -- Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications -- On the Eigenvalue Power Law -- Classifying Special Interest Groups in Web Graphs."]
[null,null,null,"Sommario/riassunto","This volume contains the papers presented at the 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RAN- DOM 2002), which took place at Harvard University, Cambridge, Massachusetts, from September 13-15, 2002. RANDOM 2002 was concerned with applications of randomness to computational and combinatorial problems, and was the sixth workshop in the series following Bologna, Barcelona, Berkeley, Geneva, and B- keley again. The volume contains 21 contributed papers, selected by the program c- mittee from 48 submissions received in response to the call for papers. We thank all of the authors who submitted papers, our invited speakers, the members of the program committee: Dimitris Achlioptas, Microsoft Research Martin Dyer, U. of Leeds Uriel Feige, Weizmann Institute Russell Impagliazzo, UC San Diego Sampath Kannan, U. of Pennsylvania David Karger, MIT Nati Linial, Hebrew U. Rafail Ostrovsky, Telcordia Technologies Paul Spirakis, U. of Patras and CTI Angelika Steger, TU Munich R¨udiger Urbanke, Swiss Federal Inst. of Tech. Salil Vadhan, Harvard U., chair, and the external reviewers: N. Alon, R. Alur, A. Ambainis, T. Batu, J. Feig- baum, S. Gerke, Y. Gertner, A. Goerdt, L. Goldberg, J. Hastad, C. Iliopoulos, Y. Ishai, V. Kabanets, S. Khot, L. Kirousis, S. Kontogiannis, M. Krivelevich, M. Mavronicolas, A. McGregor, F. McSherry, D. van Melkebeek, M. Molloy, E. Mossel, S. Nikoletseas, R. Raz, D. Ron, P. Tetali, L. Trevisan, E. Vigoda, J. Watrous, and P. Winkler."]