The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Retiming synchronous circuitry
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.
Integrity signals
Registry
Cites
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.
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
Introduction to V.L.S.I. Systems
Mead, C. (1981) · IEE Proceedings I Solid State and Electron Devices · doi:10.1049/ip-i-1.1981.0010 · Cited by 3,720
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Kung, H. T., & Leiserson, C. E. (1978) · Defense Technical Information Center (DTIC) · Cited by 833
Self-citationFinding Minimum-Cost Circulations by Successive Approximation
Goldberg, A. V., & Tarjan, R. E. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.3.430 · Cited by 335
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
Fredman, M. L., & Tarjan, R. E. (2005) · 25th Annual Symposium onFoundations of Computer Science, 1984. · doi:10.1109/sfcs.1984.715934 · Cited by 247
The California Institute of Technology
(1920) · Science · doi:10.1126/science.51.1312.181 · Cited by 188
Cited by
ABC: An Academic Industrial-Strength Verification Tool
Brayton, R., & Mishchenko, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14295-6_5 · Cited by 944
Designing Custom Arithmetic Data Paths with FloPoCo
de Dinechin, F., & Pasca, B. (2011) · IEEE Design & Test of Computers · doi:10.1109/mdt.2011.44 · Cited by 336
FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption
Van Beirendonck, M., D'Anvers, J.-P., Turan, F., & Verbauwhede, I. (2023) · Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3576915.3623159 · Cited by 38
Metadata
- Authors
- Leiserson, C. E., & Saxe, J. B.
- Venue
- Algorithmica
- Published
- 1991-06
- Volume
- 6
- Issue
- 1-6
- Pages
- 5-35
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2087656024
- Cited by
- 993
- References
- 8
- FWCI
- 24.43
- Type
- journal article
- 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
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.