Automata, Languages and Programming
36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II
Published on 24. June 2009
Book
Paperback/Softback
XXI, 597 pages
978-3-642-02929-5 (ISBN)
Description
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6-10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.
More details
Series
Edition
2009 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XXI, 597 p.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
927 gr
ISBN-13
978-3-642-02929-5 (9783642029295)
DOI
10.1007/978-3-642-02930-1
Schweitzer Classification
Persons
Content
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 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.