Abstract is missing.
- Energy Complexity of ComputationAhmet Celal Cem Say. 3-11 [doi]
- Replications in Reversible Concurrent CalculiClément Aubert. 15-23 [doi]
- Towards a Taxonomy for Reversible Computation ApproachesRobert Glück, Ivan Lanese, Claudio Antares Mezzina, Jaroslaw Adam Miszczak, Iain C. C. Phillips, Irek Ulidowski, Germán Vidal. 24-39 [doi]
- Computational Complexity of Reversible Reaction SystemsMarkus Holzer 0001, Christian Rauch. 40-54 [doi]
- Optimization of Reversible Control Flow GraphsNiklas Deworetzki, Lukas Gail. 57-72 [doi]
- Tail Recursion Transformation for Invertible FunctionsJoachim Tilsted Kristensen, Robin Kaarsgaard, Michael Kirkedal Thomsen. 73-88 [doi]
- Saving Memory Space in Deep Neural Networks by Recomputing: A SurveyIrek Ulidowski. 89-105 [doi]
- Towards a Dereversibilizer: Fewer Asserts, StaticallyJonas Wolpers Reholt, Robert Glück, Matthis Kruse. 106-114 [doi]
- Quantum String Matching Unfolded and ExtendedDomenico Cantone, Simone Faro, Arianna Pavone. 117-133 [doi]
- Optimizing Quantum Space Using Spooky Pebble GamesArend-Jan Quist, Alfons Laarman. 134-149 [doi]
- Uncomputation in the Qrisp High-Level Quantum Programming FrameworkRaphael Seidel, Nikolay Tcholtchev, Sebastian Bock, Manfred Hauswirth. 150-165 [doi]
- Improved Synthesis of Toffoli-Hadamard CircuitsMatthew Amy, Andrew N. Glaudell, Sarah Meng Li, Neil J. Ross. 169-209 [doi]
- Implementation of a Reversible Distributed CalculusClément Aubert, Peter Browning. 210-217 [doi]
- Improved Cost-Metric for Nearest Neighbor Mapping of Quantum Circuits to 2-Dimensional Hexagonal ArchitectureKamalika Datta, Abhoy Kole, Indranil Sengupta 0001, Rolf Drechsler. 218-231 [doi]
- Exploiting the Benefits of Clean Ancilla Based Toffoli Gate Decomposition Across ArchitecturesAbhoy Kole, Kamalika Datta, Philipp Niemann 0001, Indranil Sengupta 0001, Rolf Drechsler. 232-244 [doi]