Abstract is missing.
- Randomness Quality and Trade-Offs for CA Random String GeneratorsBruno Martin. 3-12 [doi]
- Complexity of Reachability Problems in Neural NetworksAdrian Wurm. 15-27 [doi]
- Weakly Synchronous Systems with Three Machines Are Turing PowerfulCinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse. 28-41 [doi]
- On the Identity and Group Problems for Complex Heisenberg MatricesPaul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin. 42-55 [doi]
- Reachability Analysis of a Class of Hybrid Gene Regulatory NetworksHonglu Sun, Maxime Folschette, Morgan Magnin. 56-69 [doi]
- Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-CompleteThomas Brihaye, Véronique Bruyère, Gaspard Reghem. 70-84 [doi]
- Multi-weighted Reachability GamesThomas Brihaye, Aline Goeminne. 85-97 [doi]
- On the Complexity of Robust Eventual Inequality Testing for C-Finite FunctionsEike Neumann. 98-112 [doi]
- Adaptive Directions for Bernstein-Based Polynomial Set EvolutionAlberto Casagrande, Carla Piazza. 113-126 [doi]
- Introducing Divergence for Infinite Probabilistic ModelsAlain Finkel, Serge Haddad, Lina Ye. 127-140 [doi]
- A Framework for the Competitive Analysis of Model Predictive ControllersStijn Bellis, Joachim Denil, Ramesh Krishnamurthy, Tim Leys, Guillermo A. Pérez 0001, Ritam Raha. 141-154 [doi]
- Matching Patterns with Variables Under Simon's CongruencePamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft. 155-170 [doi]
- HyperMonitor: A Python Prototype for Hyper Predictive Runtime VerificationAngelo Ferrando 0001, Giorgio Delzanno. 171-182 [doi]
- Generalized ARRIVAL Problem for Rotor Walks in Path MultigraphsDavid Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse. 183-198 [doi]