{"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":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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[19,2,19,3],[20,2,20,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],[28,4,28,5],[29,2,29,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[39,2,39,3],[40,2,40,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465891203316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-48224-5"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 1086 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2076"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Computer communication systems"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Software Engineering/Programming and Operating Systems"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Computer Graphics"]
[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","Includes index."]
[null,null,"Nota di contenuto",null,"Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object—Oriented System Models -- Modelling with Partial Orders — Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of "]
[{"$nulls":4},"Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- "]
[{"$nulls":4},"On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning."]
[null,"2.","Record Nr.",null,"UNINA9910648574003321"]
[null,null,"Autore",null,"López-Guadalupe Pallarés Miguel José"]
[null,null,"Titolo",null,"Redes y Estrategias de Ascenso en la Monarquía Hispánica. la Familia Malvezzi y el Colegio de España en Bolonia (siglos XV-XVI)"]
[null,null,"Pubbl/distr/stampa",null,"Madrid, : Universidad Carlos III de Madrid. Figuerola Institute of Social Science History, 2023"]
[{"$nulls":4},"Madrid : , : Dykinson, S.L., , 2023"]
[{"$nulls":4},"©2023"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (338 pages)"]
[null,null,"Collana",null,"Historia de las Universidades"]
[null,null,"Disciplina",null,"508.98"]
[null,null,"Soggetti",null,"Scientific expeditions"]
[{"$nulls":4},"Libros electrónicos."]
[{"$nulls":4},"España Historía"]
[null,null,"Lingua di pubblicazione",null,"Spagnolo"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Incluye anexos."]
[{"$nulls":4},"Incluye epílogo."]
[{"$nulls":4},"Incluye índice."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,null,"Sommario/riassunto","En este libro se analizan las relaciones sociales entre el linaje Malvezzi y el Colegio de España en Bolonia. La aparentemente extraña simbiosis entre una familia de la oligarquía urbana y un colegio secular universitario se explica en el contexto de creación."]
[{"$nulls":4},"This book analyses the social relations between the Malvezzi lineage and the College of Spain in Bologna. The apparently strange symbiosis between a family of the urban oligarchy and a secular university college can be explained in the context of the creation."]