Abstract is missing.
- Type Theory and Formalisation of MathematicsThierry Coquand. 1-6 [doi]
- Advances in Parameterized Verification of Population ProtocolsJavier Esparza. 7-14 [doi]
- Verification of Quantum Computation and the Price of TrustAlexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi. 15-19 [doi]
- Graph Sketching and Streaming: New Approaches for Analyzing Massive GraphsAndrew McGregor. 20-24 [doi]
- Concatenation Hierarchies: New Bottle, Old WineThomas Place, Marc Zeitoun. 25-37 [doi]
- Can We Locally Compute Sparse Connected Subgraphs?Ronitt Rubinfeld. 38-47 [doi]
- Palindromic Decompositions with Gaps and ErrorsMichal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski. 48-61 [doi]
- Cascade Heap: Towards Time-Optimal ExtractionsMaxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov. 62-70 [doi]
- Entropic Uniform Sampling of Linear Extensions in Series-Parallel PosetsOlivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. 71-84 [doi]
- Parameterized Counting of Trees, Forests and Matroid BasesCornelius Brand, Marc Roth. 85-98 [doi]
- Generalized Dyck ShiftsMarie-Pierre Béal, Pavel Heller. 99-111 [doi]
- Green's Relations in Finite Transformation SemigroupsLukas Fleischer, Manfred Kufleitner. 112-125 [doi]
- Nondeterministic Unitary OBDDsAida Gainutdinova, Abuzer Yakaryilmaz. 126-140 [doi]
- Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)Viliam Geffert. 141-153 [doi]
- Turing Degree Spectra of Minimal SubshiftsMichael Hochman, Pascal Vanier. 154-161 [doi]
- Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision DiagramsKamil Khadiev, Aliya Khadieva. 162-175 [doi]
- Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping IntervalsElena Khramtcova, Maarten Löffler. 176-190 [doi]
- The Transformation Monoid of a Partially Lossy QueueChris Köcher, Dietrich Kuske. 191-205 [doi]
- Approximation Algorithms for the Maximum Carpool Matching ProblemGilad Kutiel. 206-216 [doi]
- The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$Alexei Miasnikov, Svetla Vassileva, Armin Weiß. 217-231 [doi]
- On Algorithmic Statistics for Space-Bounded AlgorithmsAlexey Milovanov. 232-244 [doi]
- Popularity in the Generalized Hospital Residents SettingMeghana Nasre, Amit Rawat. 245-259 [doi]
- Edit Distance Neighbourhoods of Input-Driven Pushdown AutomataAlexander Okhotin, Kai Salomaa. 260-272 [doi]
- The (Minimum) Rank of Typical Fooling-Set MatricesMozhgan Pourmoradnasseri, Dirk Oliver Theis. 273-284 [doi]
- On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition ProblemAlexander V. Seliverstov. 285-293 [doi]
- Dag-Like Communication and Its ApplicationsDmitry Sokolov. 294-307 [doi]
- The Descriptive Complexity of Subgraph Isomorphism Without NumericsOleg Verbitsky, Maksim Zhukovskii. 308-322 [doi]
- On a Generalization of Horn Constraint SystemsPiotr J. Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani. 323-336 [doi]