{"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":58,"n_cols":5,"rows_kept":58,"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,4,3,5],[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],[15,2,15,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[24,2,24,3],[25,2,25,3],[28,2,28,3],[30,2,30,3],[30,4,30,5],[31,2,31,3],[31,4,31,5],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[49,2,49,3],[50,2,50,3],[54,2,54,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990001795250403321"]
[null,null,"Autore",null,"Convegno per l'alberatura da legno nella bonifica del Mezzogiorno : <1956"]
[null,null,"Titolo"]
[{"$nulls":4},"Atti del convegno per l'alberatura da legno nella bonifica del Mezzogiorno : Roma, 7-8 aprile 1956 / Ente Nazionale per la Cellulosa e per la Carta"]
[null,null,"Pubbl/distr/stampa",null,"Roma : Ente nazionale per la cellulosa e per la carta, 1956"]
[null,null,"Descrizione fisica",null,"180 p. ; 24 cm"]
[null,null,"Disciplina",null,"634.95"]
[null,null,"Locazione",null,"FAGBC"]
[null,null,"Collocazione",null,"60 582.16 B 1"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910455296903321"]
[null,null,"Titolo",null,"Leadership and administration of successful archival programs [[electronic resource] /] / edited by Bruce W. Dearstyne"]
[null,null,"Pubbl/distr/stampa",null,"Westport, CT, : Greenwood Press, 2001"]
[null,null,"ISBN",null,"1-280-86894-5"]
[{"$nulls":4},"9786610868940"]
[{"$nulls":4},"0-313-00698-9"]
[null,null,"Descrizione fisica",null,"1 online resource (167 p.)"]
[null,null,"Collana",null,"Greenwood library management collection, , 0894-2986"]
[null,null,"Disciplina",null,"025.1/97"]
[null,null,"Soggetti",null,"Archives - Administration"]
[{"$nulls":4},"Leadership"]
[{"$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,"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"\"\"Contents\"\"; \"\"Introduction\"\"; \"\"1 Leadership and Archival Education\"\"; \"\"2 The Art of the Possible: The Archivist as Administrator\"\"; \"\"3 Ways and Means: Thinking and Acting to Strengthen the Infrastructure of Archival Programs\"\"; \"\"4 Strategic Approaches to Program Building in Government: From Local to International and Back\"\"; \"\"5 Strategic Planning and Implementation at the National Archives and Records Administration: 1992â€? 2000\"\"; \"\"6 Corporate Culture and the Archives\"\"; \"\"7 Archival Programs in the Academic Library\"\"; \"\"8 Leadership of Archival Programs\"\""]
[{"$nulls":4},"\"\"9 Building Strong Archival Programs: Insights and Approaches\"\"\"\"Index\"\"; \"\"About the Contributors\"\""]
[null,"3.","Record Nr.",null,"UNINA9910143628403321"]
[null,null,"Titolo",null,"Fundamentals of Computation Theory : 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings / / edited by Rusins Freivalds"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-44669-9"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 550 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2138"]
[null,null,"Disciplina",null,"004"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Logic, Symbolic and mathematical"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Towards Axiomatic Basis of Inductive Inference -- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications -- Challenges of Commutation -- Approximating Bounded Degree Instances of NP-Hard Problems -- Universal Algebra and Computer Science -- Quantum Algorithms -- Regular Papers -- A Discrete Approximation and Communication Complexity Approach to the Superposition Problem -- On Computational Power of Quantum Branching Programs -- Efficient Computation of Singular Moduli with Application in Cryptography -- Ambainis-Freivalds’ Algorithm for Measure-Once Automata -- Are There Essentially Incomplete Knowledge Representation Systems? -- Best Increments for the Average Case of Shellsort -- Approximating Minimum Cocolourings -- Curved Edge Routing -- Time/Space Efficient "]
[{"$nulls":4},"Compressed Pattern Matching -- Modelling Change with the Aid of Knowledge and Time -- If P ? NP then Some Strongly Noninvertible Functions Are Invertible -- Prediction-Preserving Reducibility with Membership Queries on Formal Languages -- Dense Families and Key Functions of Database Relation Instances -- On the Complexity of Decidable Cases of Commutation Problem for Languages -- Cones, Semi-AFPs, and AFPs of Algebraic Power Series -- New Small Universal Circular Post Machines -- Divisibility Monoids: Presentation, Word Problem, and Rational Languages -- Concurrency in Timed Automata -- How Powerful Are Infinite Time Machines? -- Equivalence Problem of Composite Class Diagrams -- Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2 -- On the Category of Event Structures with Dense Time -- Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions -- Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case -- Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies -- Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables -- Piecewise and Local Threshold Testability of DFA -- Compositional Homomorphisms of Relational Structures -- Short Papers -- Representation of Autonomous Automata -- Quantum Reversibility and a New Model of Quantum Automaton -- Space-Efficient 1.5-Way Quantum Turing Machine -- A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain -- A Primitive for Proving the Security of Every Bit and about Universal Hash Functions & Hard Core Bits -- Pythagorean Triples in Unification Theory of Nilpotent Rings -- Two-States Bilinear Intrinsically Universal Cellular Automata -- Linear Time Recognizer for Subsets of ?2 -- Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents -- On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ) -- Quantum Real - Time Turing Machine -- Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control -- Linear Automata and Recognizable Subsets in Free Semirings -- On Logical Method for Counting Dedekind Numbers -- A General Method for Graph Isomorphism -- WEA Invited Papers -- Designing PTASs for MIN-SUM Scheduling Problems -- On Robust Algorithms for the Maximum Weight Stable Set Problem -- Multicasting in Optical Networks -- WEA Regular Papers -- Structured Randomized Rounding and Coloring -- Optimal Online Flow Time with Resource Augmentation -- New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs -- On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks -- Approximation Algorithms for Time-Dependent Orienteering -- On Complexity of Colouring Mixed Hypertrees -- Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems -- The Complexity of Maximum Matroid-Greedoid Intersection."]
[null,null,null,"Sommario/riassunto","ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the ?rst FCT 1977, the conference brings together specialists in theoretical ?elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE'cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ?ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide'nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane "]
[{"$nulls":4},"algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: - Poznan-K´ ornik, Poland, 1977 - Wendish-Rietz, Germany, 1979 - Szeged, Hungary, 1981 - Borgholm, Sweden, 1983 - Cottbus, Germany, 1985 - Kazan, Russia, 1987 - Szeged, Hungary, 1989 - Gosen-Berlin, Germany, 1991 - Szeged, Hungary, 1993 - Dresden, Germany, 1995 - Krak´ ow, Poland, 1997 - Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers."]