{"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":47,"n_cols":5,"rows_kept":47,"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],[16,2,16,3],[17,2,17,3],[21,2,21,3],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[27,2,27,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[40,2,40,3],[41,2,41,3],[45,2,45,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466061103316"]
[null,null,"Titolo",null,"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings / / edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-38045-0"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 522 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4110"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[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 Talks -- On Nontrivial Approximation of CSPs -- Analysis of Algorithms on the Cores of Random Graphs -- Contributed Talks of APPROX -- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs -- Approximating Precedence-Constrained Single Machine Scheduling by Coloring -- Minimizing Setup and Beam-On Times in Radiation Therapy -- On the Value of Preemption in Scheduling -- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs -- Tight Results on Minimum Entropy Set Cover -- A Tight Lower Bound for the Steiner Point Removal Problem on Trees -- Single-Source Stochastic Routing -- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem -- Online Algorithms to Minimize Resource Reallocations and Network Communication -- Weighted Sum "]
[{"$nulls":4},"Coloring in Batch Scheduling of Conflicting Jobs -- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time -- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times -- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees -- Improved Algorithms for Data Migration -- Approximation Algorithms for Graph Homomorphism Problems -- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem -- Hardness of Preemptive Finite Capacity Dial-a-Ride -- Minimum Vehicle Routing with a Common Deadline -- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level -- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems -- Better Approximations for the Minimum Common Integer Partition Problem -- Contributed Talks of RANDOM -- On Pseudorandom Generators with Linear Stretch in NC0 -- A Fast Random Sampling Algorithm for Sparsifying Matrices -- The Effect of Boundary Conditions on Mixing Rates of Markov Chains -- Adaptive Sampling and Fast Low-Rank Matrix Approximation -- Robust Local Testability of Tensor Products of LDPC Codes -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods -- Dobrushin Conditions and Systematic Scan -- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems -- Robust Mixing -- Approximating Average Parameters of Graphs -- Local Decoding and Testing for Homomorphisms -- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy -- Randomness-Efficient Sampling Within NC 1 -- Monotone Circuits for the Majority Function -- Space Complexity vs. Query Complexity -- Consistency of Local Density Matrices Is QMA-Complete -- On Bounded Distance Decoding for General Lattices -- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques -- Distance Approximation in Bounded-Degree and General Sparse Graphs -- Fractional Matching Via Balls-and-Bins -- A Randomized Solver for Linear Systems with Exponential Convergence -- Maintaining External Memory Efficient Hash Tables."]
[null,"2.","Record Nr.",null,"UNINA9910780026403321"]
[null,null,"Autore",null,"O'Donnell Patrick <1948->"]
[null,null,"Titolo",null,"Latent destinies [[electronic resource] ] : cultural paranoia and contemporary U.S. narrative / / Patrick O'Donnell"]
[null,null,"Pubbl/distr/stampa",null,"Durham, N.C., : Duke University Press, 2000"]
[null,null,"ISBN",null,"1-282-90357-8"]
[{"$nulls":4},"9786612903571"]
[{"$nulls":4},"0-8223-8064-1"]
[null,null,"Descrizione fisica",null,"1 online resource (207 p.)"]
[null,null,"Collana",null,"New Americanists"]
[null,null,"Classificazione",null,"HU 1819"]
[null,null,"Disciplina",null,"700/.1/030973"]
[null,null,"Soggetti",null,"American fiction - 20th century - History and criticism"]
[{"$nulls":4},"Paranoia in literature"]
[{"$nulls":4},"Literature and society - United States - History - 20th century"]
[{"$nulls":4},"Narration (Rhetoric) - History - 20th century"]
[{"$nulls":4},"Motion pictures - United States - History"]
[{"$nulls":4},"Postmodernism - United States"]
[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,"Entry: The Time of Paranoia -- 1 Postmodernity and the Symptom of Paranoia -- 2 Head Shots: The Theater of Paranoia -- 3 Engendering Paranoia -- 4 Criminality and Paranoia -- Exit: Under History: Underworld."]
[null,null,null,"Sommario/riassunto","Uses a discussion of contemporary films and literary works to present an understanding of paranoia  as a defining element in postmodern late-capitalist structure."]