Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas
Proceedings of the 36th International Colloquium on Automata, Languages and Programming, Part II
ICALP (2), 2009.

@proceedings{ICALP-v2-2009,
	address       = "Rhodes, Greece",
	doi           = "10.1007/978-3-642-02930-1",
	editor        = "Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas",
	isbn          = "978-3-642-02929-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 36th International Colloquium on Automata, Languages and Programming, Part II}",
	volume        = 5556,
	year          = 2009,
}

Contents (48 items)

7 ×#network
5 ×#probability
4 ×#game studies
4 ×#on the
3 ×#analysis
3 ×#automaton
3 ×#graph
3 ×#monad
3 ×#multi
2 ×#algorithm

ICALP-v2-2009-ChatterjeeDH #game studies #overview #probability

A Survey of Stochastic Games with Limsup and Liminf Objectives (KC, LD, TAH), pp. 1–15.

ICALP-v2-2009-GottlobGS #optimisation #problem #strict

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (GG, GG, FS), pp. 16–30.

ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus

Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.

ICALP-v2-2009-BaierBBB #automaton #question

When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.

ICALP-v2-2009-BeaudryL #monad

Faithful Loops for Aperiodic E-Ordered Monoids (MB, FL), pp. 55–66.

ICALP-v2-2009-BlumensathOW #bound #finite #higher-order #monad #word

Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.

ICALP-v2-2009-BodirskyJO #linear

Semilinear Program Feasibility (MB, PJ, TvO), pp. 79–90.

ICALP-v2-2009-Boldo #case study #float #verification

Floats and Ropes: A Case Study for Formal Numerical Program Verification (SB), pp. 91–102.

ICALP-v2-2009-BouyerF #game studies #probability #reachability

Reachability in Stochastic Timed Games (PB, VF), pp. 103–114.

ICALP-v2-2009-BrancoP #equation #polynomial #regular expression

Equations Defining the Polynomial Closure of a Lattice of Regular Languages (MJJB, JÉP), pp. 115–126.

ICALP-v2-2009-ChaputDPP #approximate #markov #process

Approximating Markov Processes by Averaging (PC, VD, PP, GDP), pp. 127–138.

ICALP-v2-2009-Colcombet #cost analysis #formal method #monad

The Theory of Stabilisation Monoids and Regular Cost Functions (TC), pp. 139–150.

ICALP-v2-2009-ColcombetZ #automaton #bound

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.

ICALP-v2-2009-LagoM #on the #term rewriting #λ-calculus

On Constructor Rewrite Systems and the λ-Calculus (UDL, SM), pp. 163–174.

ICALP-v2-2009-DaxKL #logic #on the

On Regular Temporal Logics with Past, (CD, FK, ML), pp. 175–187.

ICALP-v2-2009-FinkelG #analysis

Forward Analysis for WSTS, Part II: Complete WSTS (AF, JGL), pp. 188–199.

ICALP-v2-2009-GriponS #concurrent #game studies #probability

Qualitative Concurrent Stochastic Games with Imperfect Information (VG, OS), pp. 200–211.

ICALP-v2-2009-JouannaudO #confluence #diagrams

Diagrammatic Confluence and Completion (JPJ, VvO), pp. 212–222.

ICALP-v2-2009-KobayashiO #calculus #complexity #model checking #recursion #μ-calculus

Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.

ICALP-v2-2009-KuhtzF #ltl

LTL Path Checking Is Efficiently Parallelizable (LK, BF), pp. 235–246.

ICALP-v2-2009-MelliesTT #exponential #linear #logic

An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.

ICALP-v2-2009-Michaliszyn #decidability #transitive

Decidability of the Guarded Fragment with the Transitive Closure (JM), pp. 261–272.

ICALP-v2-2009-ParysW #automaton

Weak Alternating Timed Automata (PP, IW), pp. 273–284.

ICALP-v2-2009-PlaceS #decidability

A Decidable Characterization of Locally Testable Tree Languages (TP, LS), pp. 285–296.

ICALP-v2-2009-UmmelsW #complexity #game studies #multi #nash #probability

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.

ICALP-v2-2009-NisanBCFGMRSTVZ

Google’s Auction for TV Ads (NN, JB, DC, TF, RG, YM, NR, MS, DT, HRV, DZ), pp. 309–327.

ICALP-v2-2009-AhnG #graph

Graph Sparsification in the Semi-streaming Model (KJA, SG), pp. 328–338.

ICALP-v2-2009-AnagnostopoulosKMU #how

Sort Me If You Can: How to Sort Dynamic Data (AA, RK, MM, EU), pp. 339–350.

ICALP-v2-2009-AzarMMPS #adaptation #network

Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.

ICALP-v2-2009-ChatzigiannakisMS #protocol

Mediated Population Protocols (IC, OM, PGS), pp. 363–374.

ICALP-v2-2009-ChierichettiLP #network #social

Rumor Spreading in Social Networks (FC, SL, AP), pp. 375–386.

ICALP-v2-2009-ClementiPS #named

MANETS: High Mobility Can Make Up for Low Transmission Power (AEFC, FP, RS), pp. 387–398.

ICALP-v2-2009-CooperFR #multi #random

Multiple Random Walks and Interacting Particle Systems (CC, AMF, TR), pp. 399–410.

ICALP-v2-2009-CooperIKK #graph #random #using

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.

ICALP-v2-2009-DaskalakisP #network #on the #theorem

On a Network Generalization of the Minmax Theorem (CD, CHP), pp. 423–434.

ICALP-v2-2009-NicolaLLM #calculus #probability #process

Rate-Based Transition Systems for Stochastic Process Calculi (RDN, DL, ML, MM), pp. 435–446.

ICALP-v2-2009-FanghanelKV #algorithm #latency #network

Improved Algorithms for Latency Minimization in Wireless Networks (AF, TK, BV), pp. 447–458.

ICALP-v2-2009-FotakisKS #design #network #performance

Efficient Methods for Selfish Network Design (DF, ACK, PGS), pp. 459–471.

ICALP-v2-2009-FriedrichSV #analysis #network

Smoothed Analysis of Balancing Networks (TF, TS, DV), pp. 472–483.

ICALP-v2-2009-GuerraouiR #mobile

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures (RG, ER), pp. 484–495.

ICALP-v2-2009-GuhaM #metric #multi

Multi-armed Bandits with Metric Switching Costs (SG, KM), pp. 496–507.

ICALP-v2-2009-KorulaP #algorithm #graph #problem

Algorithms for Secretary Problems on Graphs and Hypergraphs (NK, MP), pp. 508–520.

ICALP-v2-2009-KowalskiP #ad hoc #network

Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps (DRK, AP), pp. 521–533.

ICALP-v2-2009-IbrahimKYZ #sublinear

Secure Function Collection with Sublinear Storage (MHI, AK, MY, HSZ), pp. 534–545.

ICALP-v2-2009-Mosk-AoyamaR #analysis #performance #worst-case

Worst-Case Efficiency Analysis of Queueing Disciplines (DMA, TR), pp. 546–557.

ICALP-v2-2009-PuglieseTY #on the

On Observing Dynamic Prioritised Actions in SOC (RP, FT, NY), pp. 558–570.

ICALP-v2-2009-ScheidelerS #distributed

A Distributed and Oblivious Heap (CS, SS), pp. 571–582.

ICALP-v2-2009-Zhang

Proportional Response Dynamics in the Fisher Market (LZ), pp. 583–594.