Cited by 98Quantum-Dot Cellular AutomataLogic, programming, and type systemsDNA and Biological Computing

Introduction to Reversible Computing

Perumalla, Kalyan S.·2013·Chapman & Hall/CRC eBooks

Abstract

Few books comprehensively cover the software and programming aspects of reversible computing. Filling this gap, Introduction to Reversible Computing offers an expanded view of the field that includes the traditional energy-motivated hardware viewpoint as well as the emerging application-motivated software approach. Collecting scattered knowledge in

Integrity signals

Registry

Crossref · 10.1201/b15719

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The reversible property of logical gates such as XOR, XNOR, Fredkin, and CNOT ensures that original high-quality images can be perfectly reconstructed after decryption.

    “The reversible property of these gates, where the input can be derived from the output without any loss of information, is particularly appealing in multimedia encryption. This reversibility ensures that the original high-quality images can be perfectly reconstructed after decryption, an essential factor for applications where detail and accuracy are paramount21,24.”

Cited by

Sorted by citations

Authors
Perumalla, K. S.
Corresponding author
Perumalla, Kalyan S.
Venue
Chapman & Hall/CRC eBooks
Published
2013-09-10
OpenAlex
W569565536
Cited by
98
References
0
Citations by year
2026: 1 · 2025: 3 · 2024: 6 · 2023: 3 · 2022: 9 · 2021: 6 · 2020: 11 · 2019: 9 · 2018: 14 · 2017: 14 · 2016: 8 · 2015: 6 · 2014: 8
FWCI
3.00
Type
book
Language
en
Open access
closed
Locations
  • Chapman & Hall/CRC eBooks (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
Keywords
reversible computation, reversible logic, low-power hardware design, energy-efficient computing, quantum computing, quantum gates

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review