Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 493

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

A transformation based algorithm for reversible logic synthesis

Miller, D. Michael, Maslov, Dmitri, Dueck, Gerhard W.·2003·Proceedings of the 40th annual Design Automation Conference

Abstract

A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing, nanotechnology and low-power CMOS design. Synthesis approaches are not well developed for reversible circuits even for small numbers of inputs and outputs.In this paper, a transformation based algorithm for the synthesis of such a reversible circuit in terms of n × n Toffoli gates is presented. Initially, a circuit is constructed by a single pass through the specification with minimal look-ahead and no back-tracking. Reduction rules are then applied by simple template matching. The method produces near-optimal results for 3-input circuits and also produces very good results for larger problems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/775832.775915

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 21 references

Cited by

See all 493

Metadata

Authors
Miller, D. M., Maslov, D., & Dueck, G. W.
Venue
Proceedings of the 40th annual Design Automation Conference
Publisher
ACM
Published
2003-06-02
Pages
318-323
ISSN
0738-100X (ISSN-L)
OpenAlex
W2155163387
Cited by
493
References
21
FWCI
10.39
Type
conference paper
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A transformation based algorithm for reversible logic synthesis. https://app.cochat.ai/papers/10.1145/775832.775915
The paper
Miller, D. M., Maslov, D., & Dueck, G. W. (2003). A transformation based algorithm for reversible logic synthesis. Proceedings of the 40th annual Design Automation Conference. https://doi.org/10.1145/775832.775915

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.