Reversible Programming Techniques for Shortest-Path Algorithms

Download PDF
Open Webpage

Lanying Guo, Chao Peng, Siyuan Chen, Cheng He

Published: 2018, Last Modified: 07 Oct 2025IPCCC 2018EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Reversible computing is so far the only way to circumvent the Landauer limit of CPU power efficiency, thus has attracted more and more attention recently due to its prospect in energy-efficient computing. To make reversible computing possible, much ground work needs to be studied, especially on reversible algorithms. We focus on designing reversible shortest path algorithms in this paper.