LEADER 01139nam0-22003491--450- 001 990008234580403321 005 20051128122316.0 010 $a88-324-8649-0 020 $aIT$b98-12795 035 $a000823458 035 $aFED01000823458 035 $a(Aleph)000823458FED01 035 $a000823458 100 $a20051128d1998----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay---n----00yy 200 1 $aUnico '98$epersone fisiche$ele nuove dichiarazioni fiscali : guida alla compilazione del modello unificato$eimposte sui redditi, imposta sul valore aggiunto, sostituto d'imposta, acconto IRAP$fRoberto Lugano, Paolo Meneghetti, Raffaele Rizzardi 205 $a25. ed 210 $aMilano$cIl sole-24 ore norme e tributi$d1998 215 $aV, 353 p.$d24 cm 676 $a343.4505262$v20$zita 700 1$aLugano,$bRoberto$0303397 701 1$aRizzardi,$bRaffaele$089391 701 1$aMeneghetti,$bPaolo$0499150 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990008234580403321 952 $aSCUOLA F 34$b171$fDDA 959 $aDDA 996 $aUnico '98$9737885 997 $aUNINA LEADER 01004nam0-2200349li-450 001 990000137660203316 005 20180312154737.0 010 $a0-471-55380-8 035 $a0013766 035 $aUSA010013766 035 $a(ALEPH)000013766USA01 035 $a0013766 100 $a20001109d1993----km-y0itay0103----ba 101 0 $aeng 102 $aUS 200 1 $aAdvanced engineering mathematics$fErwin Kreyszig 205 $a7th ed 210 $aNew York [etc.]$cJohn Wiley & Sons$dcopyr. 1993 610 1 $aingegneria matematica 676 $a510.2462$9. 700 1$aKreyszig,$bErwin$01138 801 $aSistema bibliotecario di Ateneo dell' Università di Salerno$gRICA 912 $a990000137660203316 951 $a510.246 2 KRE$b0005285 959 $aBK 969 $aTEC 979 $c19970610 979 $c20001110$lUSA01$h1711 979 $c20020403$lUSA01$h1621 979 $aPATRY$b90$c20040406$lUSA01$h1610 996 $aAdvanced engineering mathematics$936902 997 $aUNISA LEADER 06328nam 22007575 450 001 9910484940603321 005 20251226203916.0 010 $a1-282-33202-3 010 $a9786612332029 010 $a3-642-02930-2 024 7 $a10.1007/978-3-642-02930-1 035 $a(CKB)1000000000761216 035 $a(EBL)450389 035 $a(OCoLC)437345741 035 $a(DE-He213)978-3-642-02930-1 035 $a(MiAaPQ)EBC450389 035 $a(MiAaPQ)EBC6511691 035 $a(Au-PeEL)EBL6511691 035 $z(PPN)204537061 035 $a(PPN)136310648 035 $a(EXLCZ)991000000000761216 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAutomata, Languages and Programming $e36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II /$fedited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (616 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5556 300 $aIncludes index. 311 08$a3-642-02929-9 327 $aTrack B: Invited Lectures -- A Survey of Stochastic Games with Limsup and Liminf Objectives -- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions -- Track B: Contributed Papers -- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types -- When Are Timed Automata Determinizable? -- Faithful Loops for Aperiodic E-Ordered Monoids -- Boundedness of Monadic Second-Order Formulae over Finite Words -- Semilinear Program Feasibility -- Floats and Ropes: A Case Study for Formal Numerical Program Verification -- Reachability in Stochastic Timed Games -- Equations Defining the Polynomial Closure of a Lattice of Regular Languages -- Approximating Markov Processes by Averaging -- The Theory of Stabilisation Monoids and Regular Cost Functions -- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata -- On Constructor Rewrite Systems and the Lambda-Calculus -- On Regular Temporal Logics with Past, -- Forward Analysis for WSTS, Part II: Complete WSTS -- Qualitative Concurrent Stochastic Games with Imperfect Information -- Diagrammatic Confluence and Completion -- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus -- LTL Path Checking Is Efficiently Parallelizable -- An Explicit Formula for the Free Exponential Modality of Linear Logic -- Decidability of the Guarded Fragment with the Transitive Closure -- Weak Alternating Timed Automata -- A Decidable Characterization of Locally Testable Tree Languages -- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games -- Track C: Invited Lecture -- Google?s Auction for TV Ads -- Track C: Contributed Papers -- Graph Sparsification in the Semi-streaming Model -- Sort Me If You Can: How to Sort Dynamic Data -- Maximum Bipartite Flow in Networks withAdaptive Channel Width -- Mediated Population Protocols -- Rumor Spreading in Social Networks -- MANETS: High Mobility Can Make Up for Low Transmission Power -- Multiple Random Walks and Interacting Particle Systems -- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies -- On a Network Generalization of the Minmax Theorem -- Rate-Based Transition Systems for Stochastic Process Calculi -- Improved Algorithms for Latency Minimization in Wireless Networks -- Efficient Methods for Selfish Network Design -- Smoothed Analysis of Balancing Networks -- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures -- Multi-armed Bandits with Metric Switching Costs -- Algorithms for Secretary Problems on Graphs and Hypergraphs -- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps -- Secure Function Collection with Sublinear Storage -- Worst-Case Efficiency Analysis of Queueing Disciplines -- On Observing Dynamic Prioritised Actions in SOC -- A Distributed and Oblivious Heap -- Proportional Response Dynamics in the Fisher Market. 330 $aThe two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming, as well as on foundations of networked computation: models, algorithms and information management. LNCS 5556 contains 46 contributions of tracks B and C selected from 147 submissions as well as 2 invited lectures. This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5556 606 $aSoftware engineering 606 $aComputer programming 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aSoftware Engineering 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aMathematics of Computing 615 0$aSoftware engineering. 615 0$aComputer programming. 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aSoftware Engineering. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematics of Computing. 676 $a005.131 702 $aAlbers$b Susanne 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484940603321 996 $aAutomata, languages and programming$9339738 997 $aUNINA