{"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":48,"n_cols":5,"rows_kept":48,"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],[10,2,10,3],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[14,4,14,5],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[22,2,22,3],[23,2,23,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],[42,2,42,3],[43,2,43,3],[46,2,46,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990008587470403321"]
[null,null,"Autore",null,"Coomans, Gery"]
[null,null,"Titolo",null,"1929 : la crise en France, Belgique, Grande-Bretagne / Gery Coomans"]
[null,null,"Pubbl/distr/stampa",null,"Grenoble : Presses universitaires de Grenoble, 1989"]
[null,null,"ISBN",null,"27-061-0340-X"]
[null,null,"Descrizione fisica",null,"250 P. ; 24 cm"]
[null,null,"Collana",null,"Influences"]
[null,null,"Locazione",null,"DECTS"]
[null,null,"Collocazione",null,"N1.110"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910465779003321"]
[null,null,"Autore",null,"Mui Alexander"]
[null,null,"Titolo",null,"Army & Navy Academy : history of the West Point of the West / / Alexander Mui"]
[null,null,"Pubbl/distr/stampa",null,"Charleston, SC : , : The History Press, , 2017"]
[null,null,"ISBN",null,"1-4396-6047-6"]
[null,null,"Descrizione fisica",null,"1 online resource (287 pages) : illustrations, map"]
[null,null,"Disciplina",null,"355.007"]
[null,null,"Soggetti",null,"Military education - California - San Diego - History"]
[{"$nulls":4},"Preparatory schools - California - San Diego - History"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (pages 283-284) and index."]
[null,"3.","Record Nr.",null,"UNISA996466107903316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings / / edited by Wilfried Brauer"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985"]
[null,null,"ISBN",null,"3-540-39557-1"]
[null,null,"Edizione",null,"[1st ed. 1985.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 524 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 194"]
[null,null,"Disciplina",null,"005.11"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[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,"Vertex packing algorithms -- Linear and branching structures in the semantics and logics of reactive systems -- About rational sets of factors of a bi-infinite word -- A fair protocol for signing contracts -- The influence of key length on the area-time complexity of sorting -- Repeated synchronous snapshots and their implementation in CSP -- On total regulators generated by derivation relations -- Optimal solutions for a class of point retrieval problems -- Fractional cascading: A data structuring technique with geometric applications -- Hierarchies of one-way multihead automata languages -- Partitioning point sets in 4 dimensions -- A completeness theorem for recursively defined types -- Categorical combinatory logic -- Towards a uniform topological treatment of streams and functions on streams -- Infinite streams and finite observations in the semantics of uniform concurrency -- Imposed-functional dependencies inducing horizontal decompositions -- Characterization of high level tree transducers -- Ambiguity and transcendence -- A fast algorithm for polygon containment by translation -- Deterministic and Las Vegas primality testing algorithms "]
[{"$nulls":4},"-- Efficient algorithms for graphic matroid intersection and parity -- Operational semantics for order-sorted algebra -- A universal domain technique for profinite posets -- A simple proof of the Skolem-Mahler-Lech theorem -- On complete problems for NP?CoNP -- An algebraic theory of fair asynchronous communicating processes -- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem -- Powerdomains as algebraic lattices preliminary report -- Random generation of combinatiorial structures from a uniform distribution -- Do rational equivalence relations have regular cross-sections? -- On probabilistic time and space -- The nearest neighbor problem on bounded domains -- Routing through a generalized switchbox -- On k-repetition free words generated by length uniform morphisms over a binary alphabet -- Every commutative quasirational language is regular -- A probabilistic distributed algorithm for set intersection and its analysis -- Distributed algorithms in synchronous broadcasting networks -- A context dependent equivalence between processes -- Lower bounds by kolmogorov-complexity -- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version) -- Applications of an infinite squarefree CO-CFL -- Special relations in automated deduction -- Dynamic interpolation search -- Polynomial levelability and maximal complexity cores -- Finite group topology and p-adic topology for free monoids -- On the use of relational expressions in the design of efficient algorithms -- The complementation problem for Büchi automata with applications to temporal logic -- A complete compositional modal proof system for a subset of CCS -- On matrix multiplication using array processors -- Optimal parallel pattern matching in strings -- Compositionality and concurrent networks: Soundness and completeness of a proofsystem."]