Abstract is missing.
- Determinism and Nondeterminism in Finite Automata with AdvicePavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic. 3-16 [doi]
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic ComplexityMichal Hospodár, Galina Jirásková, Peter Mlynárcik. 17-32 [doi]
- Optimal 2DFA Algorithms for One-Way Liveness on Two and Three SymbolsChristos A. Kapoutsis. 33-48 [doi]
- Regularity of k-Abelian Equivalence Classes of Fixed CardinalityJuhani Karhumäki, Markus A. Whiteland. 49-62 [doi]
- Reaction Systems, Transition Systems, and EquivalencesJetty Kleijn, Maciej Koutny, Lukasz Mikulski, Grzegorz Rozenberg. 63-84 [doi]
- On Usefulness of Information: Framework and NFA CaseBranislav Rovan, Simon Sádovský. 85-99 [doi]
- Parikh Matrices: Subword Indicators and Degrees of AmbiguityArto Salomaa. 100-112 [doi]
- Probabilism versus Alternation for AutomataGeorg Schnitger. 113-126 [doi]
- Classical and Quantum Computations with Restricted MemoryFarid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev. 129-155 [doi]
- Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) ProblemAnnalisa D'Andrea, Luca Forlizzi, Guido Proietti. 156-171 [doi]
- Fully Online Matching with Advice on General Bipartite Graphs and PathsHans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger. 172-190 [doi]
- Sequence Hypergraphs: Paths, Flows, and CutsKaterina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer. 191-215 [doi]
- Relative Worst-Order Analysis: A SurveyJoan Boyar, Lene M. Favrholdt, Kim S. Larsen. 216-230 [doi]
- Length-Weighted Disjoint Path Allocation - Advice and ParametrizationElisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner. 231-256 [doi]
- Universal Hashing via Integer Arithmetic Without Primes, RevisitedMartin Dietzfelbinger. 257-279 [doi]
- Small Complexity Gaps for Comparison-Based SortingShogo Ehara, Kazuo Iwama, Junichi Teruyama. 280-296 [doi]
- Online Matching in Regular Bipartite Graphs with Randomized AdversaryJosep Fàbrega, Xavier Muñoz. 297-310 [doi]
- A Dynamic Distributed Data Structure for Top-k and k-Select QueriesBjörn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide. 311-329 [doi]
- What Is Known About Vertex Cover Kernelization?Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller. 330-356 [doi]
- A Survey on the Complexity of Flood-Filling GamesMichael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza. 357-376 [doi]
- Infinity and Finite ArithmeticWalter Gander. 377-392 [doi]
- A Modern View on Stability of ApproximationRalf Klasing, Tobias Mömke. 393-408 [doi]
- NP NP -Hardness of Equilibria in Case of Risk-Averse PlayersMarios Mavronicolas, Burkhard Monien. 409-422 [doi]
- Firefly-Inspired Algorithm for Job Shop SchedulingJoss Miller-Todd, Kathleen Steinhöfel, Patrick Veenstra. 423-433 [doi]
- Rendezvous of Asynchronous Mobile Robots with LightsTakashi Okumura, Koichi Wada, Yoshiaki Katayama. 434-448 [doi]
- On the Advice Complexity of Online Edge- and Node-Deletion ProblemsPeter Rossmanith. 449-462 [doi]
- Second Thoughts on the Second LawStefan Wolf. 463-476 [doi]
- Reoptimization of NP-Hard ProblemsAnna Zych-Pawlewicz. 477-494 [doi]
- CS Unplugged - How Is It Used, and Does It Work?Tim Bell, Jan Vahrenhold. 497-521 [doi]
- Resurgence of Informatics Education in Schools - A Way to a Deeper Understanding of Informatics ConceptsValentina Dagiene. 522-537 [doi]
- The Adventure of Computer Science - Understanding the Impact of Informatics on General Education and Designing the Living EnvironmentJens Gallenbacher. 538-548 [doi]
- Toward Scenario-Based AlgorithmicsDavid Harel, Assaf Marron. 549-567 [doi]
- That Most Important IntersectionLane A. Hemaspaandra. 568-589 [doi]
- Paving the Way for Computer Science in German SchoolsUlrik Schroeder, Nadine Bergner, Thiemo Leonhardt. 590-609 [doi]
- A Master Class on RecursionTom Verhoeff. 610-633 [doi]
- About Place Cells and Grid Cells - About Place Cells and Grid CellsChristos H. Papadimitriou. 637-640 [doi]