Abstract is missing.
- A Survey of Stochastic Games with Limsup and Liminf ObjectivesKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. 1-15 [doi]
- Tractable Optimization Problems through Hypergraph-Based Structural RestrictionsGeorg Gottlob, Gianluigi Greco, Francesco Scarcello. 16-30 [doi]
- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural TypesLucia Acciai, Michele Boreale. 31-42 [doi]
- When Are Timed Automata Determinizable?Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye. 43-54 [doi]
- Faithful Loops for Aperiodic E-Ordered MonoidsMartin Beaudry, François Lemieux. 55-66 [doi]
- Boundedness of Monadic Second-Order Formulae over Finite WordsAchim Blumensath, Martin Otto, Mark Weyer. 67-78 [doi]
- Semilinear Program FeasibilityManuel Bodirsky, Peter Jonsson, Timo von Oertzen. 79-90 [doi]
- Floats and Ropes: A Case Study for Formal Numerical Program VerificationSylvie Boldo. 91-102 [doi]
- Reachability in Stochastic Timed GamesPatricia Bouyer, Vojtech Forejt. 103-114 [doi]
- Equations Defining the Polynomial Closure of a Lattice of Regular LanguagesMário J. J. Branco, Jean-Eric Pin. 115-126 [doi]
- Approximating Markov Processes by AveragingPhilippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin. 127-138 [doi]
- The Theory of Stabilisation Monoids and Regular Cost FunctionsThomas Colcombet. 139-150 [doi]
- A Tight Lower Bound for Determinization of Transition Labeled Büchi AutomataThomas Colcombet, Konrad Zdanowski. 151-162 [doi]
- On Constructor Rewrite Systems and the Lambda-CalculusUgo Dal Lago, Simone Martini. 163-174 [doi]
- On Regular Temporal Logics with Past, Christian Dax, Felix Klaedtke, Martin Lange. 175-187 [doi]
- Forward Analysis for WSTS, Part II: Complete WSTSAlain Finkel, Jean Goubault-Larrecq. 188-199 [doi]
- Qualitative Concurrent Stochastic Games with Imperfect InformationVincent Gripon, Olivier Serre. 200-211 [doi]
- Diagrammatic Confluence and CompletionJean-Pierre Jouannaud, Vincent van Oostrom. 212-222 [doi]
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-CalculusNaoki Kobayashi, C.-H. Luke Ong. 223-234 [doi]
- LTL Path Checking Is Efficiently ParallelizableLars Kuhtz, Bernd Finkbeiner. 235-246 [doi]
- An Explicit Formula for the Free Exponential Modality of Linear LogicPaul-André Melliès, Nicolas Tabareau, Christine Tasson. 247-260 [doi]
- Decidability of the Guarded Fragment with the Transitive ClosureJakub Michaliszyn. 261-272 [doi]
- Weak Alternating Timed AutomataPawel Parys, Igor Walukiewicz. 273-284 [doi]
- A Decidable Characterization of Locally Testable Tree LanguagesThomas Place, Luc Segoufin. 285-296 [doi]
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer GamesMichael Ummels, Dominik Wojtczak. 297-308 [doi]
- Google s Auction for TV AdsNoam Nisan, Jason Bayer, Deepak Chandra, Tal Franji, Robert Gardner, Yossi Matias, Neil Rhodes, Misha Seltzer, Danny Tom, Hal R. Varian, Dan Zigmond. 309-327 [doi]
- Graph Sparsification in the Semi-streaming ModelKook Jin Ahn, Sudipto Guha. 328-338 [doi]
- Sort Me If You Can: How to Sort Dynamic DataAris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal. 339-350 [doi]
- Maximum Bipartite Flow in Networks with Adaptive Channel WidthYossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan. 351-362 [doi]
- Mediated Population ProtocolsIoannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. 363-374 [doi]
- Rumor Spreading in Social NetworksFlavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi. 375-386 [doi]
- MANETS: High Mobility Can Make Up for Low Transmission PowerAndrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri. 387-398 [doi]
- Multiple Random Walks and Interacting Particle SystemsColin Cooper, Alan M. Frieze, Tomasz Radzik. 399-410 [doi]
- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration StrategiesColin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski. 411-422 [doi]
- On a Network Generalization of the Minmax TheoremConstantinos Daskalakis, Christos H. Papadimitriou. 423-434 [doi]
- Rate-Based Transition Systems for Stochastic Process CalculiRocco De Nicola, Diego Latella, Michele Loreti, Mieke Massink. 435-446 [doi]
- Improved Algorithms for Latency Minimization in Wireless NetworksAlexander Fanghänel, Thomas Keßelheim, Berthold Vöcking. 447-458 [doi]
- Efficient Methods for Selfish Network DesignDimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. 459-471 [doi]
- Smoothed Analysis of Balancing NetworksTobias Friedrich, Thomas Sauerwald, Dan Vilenchik. 472-483 [doi]
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine FailuresRachid Guerraoui, Eric Ruppert. 484-495 [doi]
- Multi-armed Bandits with Metric Switching CostsSudipto Guha, Kamesh Munagala. 496-507 [doi]
- Algorithms for Secretary Problems on Graphs and HypergraphsNitish Korula, Martin Pál. 508-520 [doi]
- Leader Election in Ad Hoc Radio Networks: A Keen Ear HelpsDariusz R. Kowalski, Andrzej Pelc. 521-533 [doi]
- Secure Function Collection with Sublinear StorageMaged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong-Sheng Zhou. 534-545 [doi]
- Worst-Case Efficiency Analysis of Queueing DisciplinesDamon Mosk-Aoyama, Tim Roughgarden. 546-557 [doi]
- On Observing Dynamic Prioritised Actions in SOCRosario Pugliese, Francesco Tiezzi, Nobuko Yoshida. 558-570 [doi]
- A Distributed and Oblivious HeapChristian Scheideler, Stefan Schmid. 571-582 [doi]
- Proportional Response Dynamics in the Fisher MarketLi Zhang. 583-594 [doi]