LEADER 06356nam 22007575 450 001 996465839303316 005 20230320191343.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$b[electronic resource] $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 $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 with Adaptive 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?Mathematics 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?Mathematics. 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 $a996465839303316 996 $aAutomata, languages and programming$9339738 997 $aUNISA