Abstract is missing.
- Noetherian Spaces in VerificationJean Goubault-Larrecq. 2-21 [doi]
- Towards a Theory of Time-Bounded VerificationJoël Ouaknine, James Worrell. 22-37 [doi]
- Physical AlgorithmsRoger Wattenhofer. 38-51 [doi]
- Optimal Zielonka-Type Construction of Deterministic Asynchronous AutomataBlaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. 52-63 [doi]
- Pumping and Counting on the Regular Post Embedding ProblemPierre Chambart, Philippe Schnoebelen. 64-75 [doi]
- Alternation Removal in Büchi AutomataUdi Boker, Orna Kupferman, Adin Rosenberg. 76-87 [doi]
- Linear Orders in the Pushdown HierarchyLaurent Braud, Arnaud Carayol. 88-99 [doi]
- The Serializability of Network CodesAnna Blasiak, Robert D. Kleinberg. 100-114 [doi]
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam. 115-126 [doi]
- Efficient Information Exchange in the Random Phone-Call ModelPetra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec. 127-138 [doi]
- An ::::O::::(log::::n::::)-Competitive Online Centralized Randomized Packet-Routing Algorithm for LinesGuy Even, Moti Medina. 139-150 [doi]
- A Topological Approach to RecognitionMai Gehrke, Serge Grigorieff, Jean-Eric Pin. 151-162 [doi]
- On ::::LR::::(::::k::::)-Parsers of Polynomial SizeNorbert Blum. 163-174 [doi]
- On Erasing Productions in Random Context GrammarsGeorg Zetzsche. 175-186 [doi]
- Game Semantics for Call-by-Value PolymorphismJames Laird. 187-198 [doi]
- What Is a Pure Functional?Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl. 199-210 [doi]
- Example-Guided Abstraction SimplificationRoberto Giacobazzi, Francesco Ranzato. 211-222 [doi]
- Compositional Closure for Bayes Risk in Probabilistic NoninterferenceAnnabelle McIver, Larissa Meinicke, Carroll Morgan. 223-235 [doi]
- Asynchronous Throughput-Optimal Routing in Malicious NetworksPaul Bunn, Rafail Ostrovsky. 236-248 [doi]
- Improved Fault Tolerance and Secure Computation on Sparse NetworksNishanth Chandran, Juan A. Garay, Rafail Ostrovsky. 249-260 [doi]
- Sparse Reliable Graph BackbonesShiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg. 261-272 [doi]
- Approximation Algorithms for Diversified Search RankingNikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor. 273-284 [doi]
- Rewriting Measurement-Based Quantum Computations with Generalised FlowRoss Duncan, Simon Perdrix. 285-296 [doi]
- The Compositional Structure of Multipartite Quantum EntanglementBob Coecke, Aleks Kissinger. 297-308 [doi]
- Compositionality in Graph TransformationArend Rensink. 309-320 [doi]
- On ::::p::::-Optimal Proof Systems and Logics for PTIMEYijia Chen, Jörg Flum. 321-332 [doi]
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of RequestsGeorge B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks. 333-344 [doi]
- Maximal Decidable Fragments of Halpern and Shoham s Modal Logic of IntervalsAngelo Montanari, Gabriele Puppis, Pietro Sala. 345-356 [doi]
- B and D Are Enough to Make the Halpern-Shoham Logic UndecidableJerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski. 357-368 [doi]
- Parameterized Modal SatisfiabilityAntonis Achilleos, Michael Lampis, Valia Mitsou. 369-380 [doi]
- Automata for Coalgebras: An Approach Using Predicate LiftingsGaëlle Fontaine, Raul Andres Leal, Yde Venema. 381-392 [doi]
- Resolving the Complexity of Some Data Privacy ProblemsJeremiah Blocki, Ryan Williams. 393-404 [doi]
- Private and Continual Release of StatisticsT.-H. Hubert Chan, Elaine Shi, Dawn Song. 405-417 [doi]
- Envy-Free Pricing in Multi-item MarketsNing Chen, Xiaotie Deng. 418-429 [doi]
- Contention Resolution under SelfishnessGeorge Christodoulou, Katrina Ligett, Evangelia Pyrga. 430-441 [doi]
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process CalculiIvan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt. 442-453 [doi]
- On Bisimilarity and Substitution in Presence of ReplicationDaniel Hirschkoff, Damien Pous. 454-465 [doi]
- The Downward-Closure of Petri Net LanguagesPeter Habermehl, Roland Meyer, Harro Wimmel. 466-477 [doi]
- Reachability Games on Extended Vector Addition Systems with StatesTomás Brázdil, Petr Jancar, Antonín Kucera. 478-489 [doi]
- Modelling Mobility: A ::::Discrete:::: RevolutionAndrea E. F. Clementi, Angelo Monti, Riccardo Silvestri. 490-501 [doi]
- Tell Me Where I Am So I Can Meet You SoonerAndrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel. 502-514 [doi]
- Rendezvous of Mobile Agents without Agreement on Local OrientationJérémie Chalopin, Shantanu Das. 515-526 [doi]
- Probabilistic Automata on Finite Words: Decidable and Undecidable ProblemsHugo Gimbert, Youssouf Oualhadj. 527-538 [doi]
- Space-Efficient Scheduling of Stochastically Generated TasksTomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger. 539-550 [doi]
- Exponential Lower Bounds for Policy IterationJohn Fearnley. 551-562 [doi]
- Regular Temporal Cost FunctionsThomas Colcombet, Denis Kuperberg, Sylvain Lombardy. 563-574 [doi]
- Model Checking Succinct and Parametric One-Counter AutomataStefan Göller, Christoph Haase, Joël Ouaknine, James Worrell. 575-586 [doi]
- Pebble Weighted Automata and Transitive Closure LogicsBenedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. 587-598 [doi]
- Energy Parity GamesKrishnendu Chatterjee, Laurent Doyen. 599-610 [doi]