Abstract is missing.
- On High-Quality SynthesisOrna Kupferman. 1-15 [doi]
- Sensitivity Versus Certificate Complexity of Boolean FunctionsAndris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs. 16-28 [doi]
- Algorithmic Decidability of Engel's Property for Automaton GroupsLaurent Bartholdi. 29-40 [doi]
- The Next Whisky BarMike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. 41-56 [doi]
- Parameterizing Edge Modification Problems Above Lower BoundsRené van Bevern, Vincent Froese, Christian Komusiewicz. 57-72 [doi]
- Completing Partial Schedules for Open Shop with Unit Processing Times and RoutingRené van Bevern, Artem V. Pyatkin. 73-87 [doi]
- Max-Closed Semilinear Constraint SatisfactionManuel Bodirsky, Marcello Mamino. 88-101 [doi]
- Computing and Listing st-Paths in Public Transportation NetworksKaterina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot. 102-116 [doi]
- Compositional Design of Stochastic Timed AutomataPatricia Bouyer, Thomas Brihaye, Pierre G. Carlier, Quentin Menet. 117-130 [doi]
- Online Bounded AnalysisJoan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin. 131-145 [doi]
- Affine Computation and Affine AutomatonAlejandro Díaz-Caro, Abuzer Yakaryilmaz. 146-160 [doi]
- On Approximating (Connected) 2-Edge Dominating Set by a TreeToshihiro Fujito, Tomoaki Shimoda. 161-176 [doi]
- Graph Editing to a Given Degree SequencePetr A. Golovach, George B. Mertzios. 177-191 [doi]
- Subclasses of Baxter Permutations Based on Pattern AvoidanceShankar Balachandran, Sajin Koroth. 192-206 [doi]
- On Slepian-Wolf Theorem with InteractionAlexander Kozachinskiy. 207-222 [doi]
- Level Two of the Quantifier Alternation Hierarchy over Infinite WordsManfred Kufleitner, Tobias Walter. 223-236 [doi]
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract)Manfred Kufleitner, Jan Philipp Wächter. 237-250 [doi]
- Some Complete and Intermediate Polynomials in Algebraic Complexity TheoryMeena Mahajan, Nitin Saurabh. 251-265 [doi]
- Sums of Read-Once Formulas: How Many Summands Suffice?Meena Mahajan, Anuj Tawari. 266-279 [doi]
- Algorithmic Statistics: Normal Objects and Universal ModelsAlexey Milovanov. 280-293 [doi]
- Subquadratic Algorithms for Succinct Stable MatchingDaniel Moeller, Ramamohan Paturi, Stefan Schneider. 294-308 [doi]
- Depth-4 Identity Testing and Noether's Normalization LemmaPartha Mukhopadhyay. 309-323 [doi]
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation ProblemsZeev Nutov. 324-339 [doi]
- The Hardest Language for Conjunctive GrammarsAlexander Okhotin. 340-351 [doi]
- Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and ExtensionsVictor Y. Pan, Liang Zhao. 352-366 [doi]
- Representations of Analytic Functions and Weihrauch DegreesArno Pauly, Florian Steinberg. 367-381 [doi]
- On Expressive Power of Regular Expressions over Infinite OrdersAlexander Rabinovich. 382-393 [doi]
- Prediction of Infinite Words with AutomataTim Smith. 394-408 [doi]
- Fourier Sparsity of GF(2) PolynomialsHing Yin Tsang, Ning Xie, Shengyu Zhang. 409-424 [doi]