Abstract is missing.
- Algorithms, Networks, and Social PhenomenaJon M. Kleinberg. 1-3 [doi]
- Recent Advances for a Classical Scheduling ProblemSusanne Albers. 4-14 [doi]
- Formalizing and Reasoning about QualityShaull Almagor, Udi Boker, Orna Kupferman. 15-27 [doi]
- The Square Root Phenomenon in Planar GraphsDániel Marx. 28 [doi]
- A Guided Tour in Random Intersection GraphsPaul G. Spirakis, Sotiris E. Nikoletseas, Christoforos Raptopoulos. 29-35 [doi]
- To Be Uncertain Is Uncomfortable, But to Be Certain Is RidiculousPeter Widmayer. 36 [doi]
- Decision Problems for Additive Regular FunctionsRajeev Alur, Mukund Raghothaman. 37-48 [doi]
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic ProgramsGilles Barthe, Federico Olmedo. 49-60 [doi]
- A Maximal Entropy Stochastic Process for a Timed Automaton, Nicolas Basset. 61-73 [doi]
- Complexity of Two-Variable Logic on Finite TreesSaguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell. 74-88 [doi]
- Nondeterminism in the Presence of a Diverse or Unknown FutureUdi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak. 89-100 [doi]
- Coalgebraic Announcement LogicsFacundo Carreiro, Daniel Gorín, Lutz Schröder. 101-112 [doi]
- Self-shuffling WordsEmilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni. 113-124 [doi]
- Block-Sorted Quantified Conjunctive QueriesHubie Chen, Dániel Marx. 125-136 [doi]
- From Security Protocols to Pushdown AutomataRémy Chrétien, Véronique Cortier, Stéphanie Delaune. 137-149 [doi]
- Efficient Separability of Regular Languages by Subsequences and SuffixesWojciech Czerwinski, Wim Martens, Tomás Masopust. 150-161 [doi]
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. 162-173 [doi]
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session TypesPierre-Malo Deniélou, Nobuko Yoshida. 174-186 [doi]
- Component Reconfiguration in the Presence of ConflictsRoberto Di Cosmo, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro. 187-198 [doi]
- Stochastic Context-Free Grammars, Regular Languages, and Newton's MethodKousha Etessami, Alistair Stewart, Mihalis Yannakakis. 199-211 [doi]
- Reachability in Two-Clock Timed Automata Is PSPACE-CompleteJohn Fearnley, Marcin Jurdzinski. 212-223 [doi]
- Ramsey Goes Visibly PushdownOliver Friedmann, Felix Klaedtke, Martin Lange. 224-237 [doi]
- Checking Equality and Regularity for Normed BPA with Silent MovesYuxi Fu. 238-249 [doi]
- FO Model Checking of Interval GraphsRobert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska. 250-262 [doi]
- Strategy Composition in Compositional GamesMarcus Gelderie. 263-274 [doi]
- Asynchronous Games over Tree ArchitecturesBlaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. 275-286 [doi]
- Querying the Guarded Fragment with TransitivityGeorg Gottlob, Andreas Pieris, Lidia Tendera. 287-298 [doi]
- Contractive Signatures with Recursive Types, Type Parameters, and Abstract TypesHyeonseung Im, Keiko Nakata, Sungwoo Park. 299-311 [doi]
- Algebras, Automata and Logic for Languages of Labeled Birooted TreesDavid Janin. 312-323 [doi]
- One-Variable Word Equations in Linear TimeArtur Jez. 324-335 [doi]
- The IO and OI Hierarchies RevisitedGregory M. Kobele, Sylvain Salvati. 336-348 [doi]
- Evolving Graph-Structures and Their Implicit Computational ComplexityDaniel Leivant, Jean-Yves Marion. 349-360 [doi]
- Rational Subsets and Submonoids of Wreath ProductsMarkus Lohrey, Benjamin Steinberg, Georg Zetzsche. 361-372 [doi]
- Fair Subtyping for Open Session TypesLuca Padovani. 373-384 [doi]
- Coeffects: Unified Static Analysis of Context-DependenceTomas Petricek, Dominic A. Orchard, Alan Mycroft. 385-397 [doi]
- Proof Systems for Retracts in Simply Typed Lambda CalculusColin Stirling. 398-409 [doi]
- Presburger Arithmetic, Rational Generating Functions, and Quasi-PolynomialsKevin Woods. 410-421 [doi]
- Revisiting the Equivalence Problem for Finite Multitape AutomataJames Worrell. 422-433 [doi]
- Silent Transitions in Automata with StorageGeorg Zetzsche. 434-445 [doi]
- New Online Algorithms for Story Scheduling in Web AdvertisingSusanne Albers, Achim Passen. 446-458 [doi]
- Sketching for Big Data Recommender Systems Using Fast Pseudo-random FingerprintsYoram Bachrach, Ely Porat. 459-471 [doi]
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity BoundsLuca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn. 472-483 [doi]
- On Revenue Maximization for Agents with Costly Information Acquisition - Extended AbstractL. Elisa Celis, Dimitrios C. Gklezakos, Anna R. Karlin. 484-495 [doi]
- Price of Stability in Polynomial Congestion GamesGeorge Christodoulou 0001, Martin Gairing. 496-507 [doi]
- Localization for a System of Colliding RobotsJurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco. 508-519 [doi]
- Fast Collaborative Graph ExplorationDariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski. 520-532 [doi]
- Deterministic Polynomial Approach in the PlaneYoann Dieudonné, Andrzej Pelc. 533-544 [doi]
- Outsourced Pattern MatchingSebastian Faust, Carmit Hazay, Daniele Venturi. 545-556 [doi]
- Learning a Ring Cheaply and FastEmanuele G. Fusco, Andrzej Pelc, Rossella Petreschi. 557-568 [doi]
- Competitive Auctions for Markets with Positive ExternalitiesNick Gravin, Pinyan Lu. 569-580 [doi]
- Efficient Computation of Balanced StructuresDavid G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan. 581-593 [doi]
- A Refined Complexity Analysis of Degree Anonymization in GraphsSepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý. 594-606 [doi]
- Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic NetworksMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 607-619 [doi]
- Locally Stable Marriage with Strict PreferencesMartin Hoefer, Lisa Wagner. 620-631 [doi]
- Distributed Deterministic Broadcasting in Wireless Networks of Weak DevicesTomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak. 632-644 [doi]
- Secure Equality and Greater-Than Tests with Sublinear Online ComplexityHelger Lipmaa, Tomas Toft. 645-656 [doi]
- Temporal Network Optimization Subject to Connectivity ConstraintsGeorge B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. 657-668 [doi]
- Strong Bounds for Evolution in NetworksGeorge B. Mertzios, Paul G. Spirakis. 669-680 [doi]
- Fast Distributed Coloring Algorithms for Triangle-Free GraphsSeth Pettie, Hsin-Hao Su. 681-693 [doi]