Track 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.
The 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).
