New reversible computing algorithms for shortest paths problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Reversible computing studies computation models exhibit both forward and backward determinism. And reversible algorithms research is one of the most important aspects about reversible computing. Since shortest path algorithms are used in widely different areas, we focus on designing reversible shortest path algorithms in this paper. More specifically, we propose several reversible programming techniques used to develop optimal reversible simulations of shortest path algorithms. Most reversible programs here have asymptotically minimal additional space, and have same time complexity as their irreversible counterparts.

Original languageEnglish
Title of host publicationICIT 2018 - Proceedings of the 6th International Conference on Information Technology
Subtitle of host publicationIoT and Smart City
PublisherAssociation for Computing Machinery
Pages82-87
Number of pages6
ISBN (Electronic)9781450366298
DOIs
StatePublished - 29 Dec 2018
Event6th International Conference on Information Technology: IoT and Smart City, ICIT 2018 - Hong Kong, Hong Kong
Duration: 29 Dec 201831 Dec 2018

Publication series

NameACM International Conference Proceeding Series

Conference

Conference6th International Conference on Information Technology: IoT and Smart City, ICIT 2018
Country/TerritoryHong Kong
CityHong Kong
Period29/12/1831/12/18

Keywords

  • Optimal
  • Reversible algorithms
  • Reversible computing
  • Simulation
  • Technique

Fingerprint

Dive into the research topics of 'New reversible computing algorithms for shortest paths problem'. Together they form a unique fingerprint.

Cite this