{"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":50,"n_cols":5,"rows_kept":50,"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],[21,2,21,3],[22,2,22,3],[26,2,26,3],[30,2,30,3],[30,4,30,5],[31,2,31,3],[31,4,31,5],[32,2,32,3],[32,4,32,5],[33,2,33,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[41,2,41,3],[42,2,42,3],[46,2,46,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465917103316"]
[null,null,"Titolo",null,"Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008"]
[null,null,"ISBN",null,"3-540-70575-9"]
[null,null,"Edizione",null,"[1st ed. 2008.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXIII, 896 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5125"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Data 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","Includes index."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects -- Internet Ad Auctions: Insights and Directions -- Track A: Algorithms, Automata, Complexity, and Games -- The Complexity of Boolean Formula Minimization -- Optimal Cryptographic Hardness of Learning Monotone Functions -- On Berge Multiplication for Monotone Boolean Dualization -- Diagonal Circuit Identity Testing and Lower Bounds -- Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity -- Constructing Efficient Dictionaries in Close to Sorting Time -- On List Update with Locality of "]
[{"$nulls":4},"Reference -- A New Combinatorial Approach for Sparse Graph Problems -- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) -- Networks Become Navigable as Nodes Move and Forget -- Fast Distributed Computation of Cuts Via Random Circulations -- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time -- Function Evaluation Via Linear Programming in the Priced Information Model -- Improved Approximation Algorithms for Budgeted Allocations -- The Travelling Salesman Problem in Bounded Degree Graphs -- Treewidth Computation and Extremal Combinatorics -- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines -- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 -- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation -- Optimal Monotone Encodings -- Polynomial-Time Construction of Linear Network Coding -- Complexity of Decoding Positive-Rate Reed-Solomon Codes -- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) -- The Randomized Coloring Procedure with Symmetry-Breaking -- The Local Nature of List Colorings for Graphs of High Girth -- Approximating List-Coloring on a Fixed Surface -- Asymptotically Optimal Hitting Sets Against Polynomials -- The Smoothed Complexity of Edit Distance -- Randomized Self-assembly for Approximate Shapes -- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) -- Competitive Weighted Matching in Transversal Matroids -- Scheduling for Speed Bounded Processors -- Faster Algorithms for Incremental Topological Ordering -- Dynamic Normal Forms and Dynamic Characteristic Polynomial -- Algorithms for ?-Approximations of Terrains -- An Approximation Algorithm for Binary Searching in Trees -- Algorithms for 2-Route Cut Problems -- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs -- Efficiently Testing Sparse GF(2) Polynomials -- Testing Properties of Sets of Points in Metric Spaces -- An Expansion Tester for Bounded Degree Graphs -- Property Testing on k-Vertex-Connectivity of Graphs -- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) -- On Problems without Polynomial Kernels (Extended Abstract) -- Faster Algebraic Algorithms for Path and Packing Problems -- Understanding the Complexity of Induced Subgraph Isomorphisms -- Spanners in Sparse Graphs -- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error -- All-Pairs Shortest Paths with a Sublinear Additive Error -- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations -- The Complexity of the Counting Constraint Satisfaction Problem -- On the Hardness of Losing Weight -- Product Theorems Via Semidefinite Programming -- Sound 3-Query PCPPs Are Long -- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations -- Recursive Stochastic Games with Positive Rewards -- Complementation, Disambiguation, and Determinization of Büchi Automata Unified -- Tree Projections: Hypergraph Games and Minimality -- Explicit Non-adaptive Combinatorial Group Testing Schemes -- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination -- Impossibility of a Quantum Speed-Up with a Faulty Oracle -- Superpolynomial Speedups Based on Almost Any Quantum Circuit -- The Speed of Convergence in Congestion Games under Best-Response Dynamics -- Uniform Budgets and the Envy-Free Pricing Problem -- Bayesian Combinatorial Auctions -- Truthful Unification Framework for Packing Integer Programs with Choices -- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing -- Finding Optimal "]
[{"$nulls":4},"Flows Efficiently -- Optimal Quantum Adversary Lower Bounds for Ordered Search -- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete -- Superpolynomial Speedups Based on Almost Any Quantum Circuit."]
[null,null,null,"Sommario/riassunto","The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5125 contains 70 contributions of track A selected from 269 submissions as well as 2 invited lectures. The papers are organized in topical sections on complexity: boolean functions and circuits, data structures, random walks and random structures, design and analysis of algorithms, scheduling, codes and coding, coloring, randomness in computation, online and dynamic algorithms, approximation algorithms, property testing, parameterized algorithms and complexity, graph algorithms, computational complexity, games and automata, group testing, streaming, and quantum, algorithmic game theory, and quantum computing."]
[null,"2.","Record Nr.",null,"UNINA9910797140703321"]
[null,null,"Autore",null,"Boesveldt Nienke Fredrika"]
[null,null,"Titolo",null,"Planet homeless : governance arrangements in Amsterdam, Copenhagen and Glasgow / / Nienke Fredrika Boesveldt"]
[null,null,"Pubbl/distr/stampa",null,"Hague, Netherlands : , : Eleven International Publishing, , 2015"]
[{"$nulls":4},"©2015"]
[null,null,"Descrizione fisica",null,"1 online resource (233 p.)"]
[null,null,"Disciplina",null,"305.5692"]
[null,null,"Soggetti",null,"Homeless persons"]
[{"$nulls":4},"Homelessness - Europe"]
[{"$nulls":4},"Homelessness - European Union countries"]
[{"$nulls":4},"Homelessness - Netherlands"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"Cover\"\"; \"\"Title page\"\"; \"\"Preface\"\"; \"\"Table of Contents\"\"; \"\"1. The research problem of homelessness\"\"; \"\"2. The governance perspective\"\"; \"\"2.1 Governance: policy, structure and management\"\"; \"\"2.2 Quality of output and outcome\"\"; \"\"2.3 Conceptual model and hypotheses\"\"; \"\"3. Comparative case study design\"\"; \"\"3.1 Selection of cases\"\"; \"\"3.2 Methods\"\"; \"\"4. Scandinavian case: Copenhagen\"\"; \"\"4.1 Problematic policy\"\"; \"\"4.2 Archipelago structure\"\"; \"\"4.3 Highly flexible management\"\"; \"\"4.4 Questionable output\"\"; \"\"4.5 Congested outcome\"\"; \"\"5 Anglo-Saxon case: Glasgow\"\""]
[{"$nulls":4},"\"\"5.1 A policy of self-responsibility\"\"\"\"5.2 Centralised structure\"\"; \"\"5.3 Corporate-style management\"\"; \"\"5.4 Success on targeted preventative output\"\"; \"\"5.5 Improved outcome\"\"; \"\"6. Continental case: Amsterdam\"\"; \"\"6.1 Specialised policy\"\"; \"\"6.2 Intense and exclusive structures\"\"; \"\"6.3 Games of management\"\"; \"\"6.4 High risk targeted output\"\"; \"\"6.5 Varying outcomes\"\"; \"\"7. Comparative analysis of empirical findings\"\"; \"\"7.1 Variation in governance arrangements\"\"; \"\"7.2 Variation in the quality of outputs and outcomes\"\"; \"\"7.3 Testing three hypotheses\"\"; \"\"8. Conclusion and discussion\"\""]
[{"$nulls":4},"\"\"8.1 Answer to the central question\"\"\"\"8.2 Theoretical implications\"\"; \"\"8.3 Practical implications\"\"; \"\"8.4 Recommendation for further study\"\"; \"\"Dutch summary\"\"; \"\"English summary\"\"; \"\"Appendices\"\"; \"\"Bibliography\"\""]
[null,null,null,"Sommario/riassunto","Nowadays, homelessness is predominantly a local responsibility. The policy challenges that local authorities face in dealing with this issue are complex or, according to some commentators, can even be described as \"\"wicked.\"\" Until recently, local authorities have had limited success in addressing homelessness for reasons including a lack of information and fragmentation of services, to name just a couple. In a new attempt to face up to these challenges, several northern European metropolises have published similar strategic approaches to ending homelessness. By studying their policy, structur"]