LEADER 01025cam a2200241 i 4500 001 991001725969707536 008 120523s1959 it k d 000 0 ita 035 $ab14059769-39ule_inst 040 $aDip.to Studi Giuridici$bita 082 04$a336 100 1 $aCordaro, Paolo$0407194 245 10$aDizionario del contribuente;$bpiccola enciclopedia fiscale con riferimenti a leggi, istruzioni e giurisprudenza e con apprendice ricca di esempi e modelli /$cPaolo Cordaro 250 $a2. ed. 260 $a[Torino] :$bUnione tipografico editrice torinese,$c[1959] 300 $avii, 1135 p.;$c25 cm 650 4$aTributi$xEnciclopedie e dizionari 740 0 $aPiccola enciclopedia fiscale / Paolo Cordaro 907 $a.b14059769$b23-05-12$c23-05-12 912 $a991001725969707536 945 $aLE027 336.00 COR01.01$g1$i2027000319602$lle027$og$pE30.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i15412957$z23-05-12 996 $aDizionario del contribuente$9239414 997 $aUNISALENTO 998 $ale027$b23-05-12$cm$da $e-$fita$git $h0$i0 LEADER 06642nam 22008415 450 001 9910768161803321 005 20251226202457.0 010 $a3-540-32288-4 024 7 $a10.1007/11672142 035 $a(CKB)1000000000232816 035 $a(SSID)ssj0000320184 035 $a(PQKBManifestationID)11235203 035 $a(PQKBTitleCode)TC0000320184 035 $a(PQKBWorkID)10342799 035 $a(PQKB)11218795 035 $a(DE-He213)978-3-540-32288-7 035 $a(MiAaPQ)EBC3067518 035 $a(PPN)12313143X 035 $a(BIP)34163965 035 $a(BIP)13291374 035 $a(EXLCZ)991000000000232816 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSTACS 2006 $e23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings /$fedited by Bruno Durand, Wolfgang Thomas 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIX, 714 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3884 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-32301-5 320 $aIncludes bibliographical references and index. 327 $aThe 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 andResource-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. 330 $aThis book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3884 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 701 $aDurand$b Bruno$01456764 701 $aThomas$b Wolfgang$f1947-$0725869 712 12$aAnnual Symposium on Theoretical Aspects of Computer Science. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768161803321 996 $aSTACS 2006$94186835 997 $aUNINA