Abstract is missing.
- New Developments in Quantum AlgorithmsAndris Ambainis. 1-11 [doi]
- Persistent Homology under Non-uniform ErrorPaul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel. 12-23 [doi]
- Information Complexity of Online ProblemsJuraj Hromkovic, Rastislav Královic, Richard Královic. 24-36 [doi]
- Algorithmic Lower Bounds for Problems on Decomposable GraphsDaniel Lokshtanov. 37 [doi]
- Do We Really Understand the Crossing Numbers?Bojan Mohar. 38-41 [doi]
- Balanced Queries: Divide and ConquerDmitri Akatov, Georg Gottlob. 42-54 [doi]
- Slowly Synchronizing Automata and DigraphsDimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov. 55-65 [doi]
- Weights of Exact Threshold FunctionsLászló Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun. 66-77 [doi]
- Proof Systems and Transformation GamesYoram Bachrach, Michael Zuckerman, Michael Wooldridge, Jeffrey S. Rosenschein. 78-89 [doi]
- Scheduling Real-Time Mixed-Criticality JobsSanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie. 90-101 [doi]
- A dexptime-Complete Dolev-Yao Theory with Distributive EncryptionAnguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh. 102-113 [doi]
- On Problem Kernels for Possible Winner Determination under the ::::k::::-Approval ProtocolNadja Betzler. 114-125 [doi]
- Counting Minimum (::::s::::, ::::t::::)-Cuts in Weighted Planar Graphs in Polynomial TimeIvona Bezáková, Adam J. Friedlander. 126-137 [doi]
- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning TreeDavide Bilò, Luciano Gualà, Guido Proietti. 138-149 [doi]
- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing ProblemsDavide Bilò, Luciano Gualà, Guido Proietti. 150-161 [doi]
- Distance Constraint Satisfaction ProblemsManuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker. 162-173 [doi]
- Faster Algorithms on Branch and Clique DecompositionsHans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle. 174-185 [doi]
- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 NetworksBeate Bollig. 186-197 [doi]
- Robust Computations with Dynamical SystemsOlivier Bournez, Daniel S. Graça, Emmanuel Hainry. 198-208 [doi]
- On Factor Universality in Symbolic SpacesLaurent Boyer, Guillaume Theyssier. 209-220 [doi]
- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query ComplexityNader H. Bshouty, Hanna Mazzawi. 221-232 [doi]
- Resource Combinatory AlgebrasAlberto Carraro, Thomas Ehrhard, Antonino Salibra. 233-245 [doi]
- Randomness for FreeKrishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger. 246-257 [doi]
- Qualitative Analysis of Partially-Observable Markov Decision ProcessesKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. 258-269 [doi]
- All Symmetric Predicates in ::::NSPACE::::(::::n:::::::2:::) Are Stably Computable by the Mediated Population Protocol ModelIoannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis. 270-281 [doi]
- Online Clustering with Variable Sized ClustersJános Csirik, Leah Epstein, Csanád Imreh, Asaf Levin. 282-293 [doi]
- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal TerrainsJurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. 294-305 [doi]
- Counting Classes and the Fine Structure between NC:::1::: and LSamir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer. 306-317 [doi]
- The Average Complexity of Moore s State Minimization Algorithm Is ::::O::::( ::::n:::: loglog::::n::::)Julien David. 318-329 [doi]
- Connected Searching of Weighted TreesDariusz Dereniowski. 330-341 [doi]
- Iterated Regret Minimization in Game GraphsEmmanuel Filiot, Tristan Le Gall, Jean-François Raskin. 342-354 [doi]
- Properties of Visibly Pushdown TransducersEmmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot. 355-367 [doi]
- Second-Order Algebraic Theories - (Extended Abstract)Marcelo P. Fiore, Ola Mahmoud. 368-380 [doi]
- Frame Definability for Classes of Trees in the ::::µ::::-calculusGaëlle Fontaine, Thomas Place. 381-392 [doi]
- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-ModelGero Greiner, Riko Jacob. 393-404 [doi]
- Finding and Counting Vertex-Colored SubtreesSylvain Guillemot, Florian Sikora. 405-416 [doi]
- Limiting Negations in Bounded Treewidth and Upward Planar CircuitsJing He, Hongyu Liang, Jayalal M. N. Sarma. 417-428 [doi]
- On the Topological Complexity of MSO+U and Related Automata ModelsSzczepan Hummel, Michal Skrzypczak, Szymon Torunczyk. 429-440 [doi]
- Least and Greatest Solutions of Equations over Sets of IntegersArtur Jez, Alexander Okhotin. 441-452 [doi]
- Improved Simulation of Nondeterministic Turing MachinesSubrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh. 453-464 [doi]
- The Prize-Collecting Edge Dominating Set Problem in TreesNaoyuki Kamiyama. 465-476 [doi]
- The Multivariate Resultant Is NP-hard in Any CharacteristicBruno Grenet, Pascal Koiran, Natacha Portier. 477-488 [doi]
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones ProblemsStefan Kratsch, Dániel Marx, Magnus Wahlström. 489-500 [doi]
- Meta-Envy-Free Cake-Cutting ProtocolsYoshifumi Manabe, Tatsuaki Okamoto. 501-512 [doi]
- Two Variables and Two SuccessorsAmaldev Manuel. 513-524 [doi]
- Harnessing ML:::F::: with the Power of System FGiulio Manzonetto, Paolo Tranquilli. 525-536 [doi]
- Describing Average- and Longtime-Behavior by Weighted MSO LogicsManfred Droste, Ingmar Meinecke. 537-548 [doi]
- Solving minones-2-sat as Fast as vertex coverNeeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar. 549-555 [doi]
- Unambiguous Finite Automata over a Unary AlphabetAlexander Okhotin. 556-567 [doi]
- The Complexity of Finding Reset Words in Finite AutomataJörg Olschewski, Michael Ummels. 568-579 [doi]
- Does Treewidth Help in Modal Satisfiability? - (Extended Abstract)M. Praveen. 580-591 [doi]
- Asynchronous Omega-Regular Games with Partial InformationBernd Puchala. 592-603 [doi]
- Parity Games with Partial Information Played on Graphs of Bounded ComplexityBernd Puchala, Roman Rabinovich. 604-615 [doi]
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri NetsPhilippe Schnoebelen. 616-628 [doi]
- Enumeration of the Monomials of a Polynomial and Related Complexity ClassesYann Strozecki. 629-640 [doi]
- Faster Approximation Schemes and Parameterized Algorithms on ::::H::::-Minor-Free and Odd-Minor-Free GraphsSiamak Tazari. 641-652 [doi]
- Semi-linear Parikh Images of Regular Expressions via ReductionBahareh Badban, Mohammad Torabi Dashti. 653-664 [doi]
- Breaking the Rectangle Bound Barrier against Formula Size Lower BoundsKenya Ueno. 665-676 [doi]
- Mesh Deformation of Dynamic Smooth Manifolds with Surface CorrespondencesHo-Lun Cheng, Ke Yan. 677-688 [doi]
- Impossibility of Independence Amplification in Kolmogorov Complexity TheoryMarius Zimand. 701-712 [doi]