01159nam--2200385---450-99000271461020331620060224141816.088-7011-443-0000271461USA01000271461(ALEPH)000271461USA0100027146120060224d1991----km-y0itay0103----baitaIT||||||||001yy<<Il>> linguaggio delle variabilistrumenti per la ricerca socialea cura di Mario Cardano, Renato MiceliTorinoRosenberg & Selliercopyr. 1991346 p.24 cmMateriali100012001MaterialiScienze socialiMetodi300.7CARDANO,MarioMICELI,RenatoITsalbcISBD990002714610203316II.5. 5262 (XV A 432)186513 L.M.XV A00176280BKUMACHIARA9020060224USA011414CHIARA9020060224USA011417CHIARA9020060224USA011418Linguaggio delle variabili506344UNISA06115nam 22007695 450 99646615430331620230405232206.03-540-32288-410.1007/11672142(CKB)1000000000232816(SSID)ssj0000320184(PQKBManifestationID)11235203(PQKBTitleCode)TC0000320184(PQKBWorkID)10342799(PQKB)11218795(DE-He213)978-3-540-32288-7(MiAaPQ)EBC3067518(PPN)12313143X(EXLCZ)99100000000023281620100301d2006 u| 0engurnn|008mamaatxtccrSTACS 2006[electronic resource] 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings /edited by Bruno Durand, Wolfgang Thomas1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XIX, 714 p.) Theoretical Computer Science and General Issues,2512-2029 ;3884Bibliographic Level Mode of Issuance: Monograph3-540-32301-5 Includes bibliographical references and index.The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem.Theoretical Computer Science and General Issues,2512-2029 ;3884Computer scienceAlgorithmsMachine theoryArtificial intelligence—Data processingComputer science—MathematicsDiscrete mathematicsTheory of ComputationAlgorithmsComputer Science Logic and Foundations of ProgrammingFormal Languages and Automata TheoryData ScienceDiscrete Mathematics in Computer ScienceComputer science.Algorithms.Machine theory.Artificial intelligence—Data processing.Computer science—Mathematics.Discrete mathematics.Theory of Computation.Algorithms.Computer Science Logic and Foundations of Programming.Formal Languages and Automata Theory.Data Science.Discrete Mathematics in Computer Science.004.0151Durand Brunoedthttp://id.loc.gov/vocabulary/relators/edtThomas Wolfgangedthttp://id.loc.gov/vocabulary/relators/edtSymposium on Theoretical Aspects of Computer ScienceBOOK996466154303316STACS 2006772399UNISA00929nam a2200253 i 450099100200710970753620020508184930.0960219s1990 it ||| | ita 3110122847b10945519-39ule_instPARLA152798ExLDip.to Scienze dell'AntichitàitaTränkle, Hermann387981Appendix tibulliana /herausgegeben und kommentiert von Hermann TränkleBerlin ; New York :De Gruyter,1990VI, 381 p. ;24 cm.Texte und Kommentare ;16Tibullo, Albio.b1094551923-02-1728-06-02991002007109707536LE007 870.1 Tibullus TRA 01.50112015000105196le007-E0.00-l- 00000.i1105275228-06-02Appendix Tibulliana488455UNISALENTOle00701-01-96ma -itait 01