The DOI matches its Crossref record.
On a Pin Versus Block Relationship For Partitions of Logic Graphs
Abstract
Partitions of the set of blocks of a computer logic graph, also called a block graph, into subsets called modules demonstrate that a two-region relationship exists between P, the average number of pins per module, and B, the average number of blocks per module. In the first region, P = KBr, where K is the average number of pins per block and 0.57 ≤ r ≤ 0.75. In the second region, that is, where the number of modules is small (i.e., 1-5), P is less than predicted by the above formula and is given by a more complex relationship. These conclusions resulted from controlled partitioning experiments performed using a computer program to partition four logic graphs varying in size from 500 to 13 000 circuits representing three different computers. The size of a block varied from one NOR circuit in one of the block graphs to a 30-circuit chip in one of the other block graphs.
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
Cited by
A stochastic wire-length distribution for gigascale integration (GSI). I. Derivation and validation
Davis, J. A., De, V. K., & Meindl, J. D. (1998) · IEEE Transactions on Electron Devices · doi:10.1109/16.661219 · Cited by 329
Low power microelectronics: retrospect and prospect
Meindl, J. D. (1995) · Proceedings of the IEEE · doi:10.1109/5.371970 · Cited by 316
Shared control of a 16 semiconductor quantum dot crossbar array
Borsoi, F., Hendrickx, N. W., John, V., Meyer, M., Motz, S., van Riggelen, F., Sammak, A., de Snoo, S. L., Scappucci, G., & Veldhorst, M. (2024) · Nature Nanotechnology · doi:10.1038/s41565-023-01491-3 · Cited by 165
Lanzerotti, M. Y., Fiorenza, G., & Rand, R. A. (2005) · IBM Journal of Research and Development · doi:10.1147/rd.494.0777 · Cited by 47
Multiplexed quantum transport using commercial off-the-shelf CMOS at sub-kelvin temperatures
Paquelet Wuetz, B., Bavdaz, P. L., Yeoh, L. A., Schouten, R., van der Does, H., Tiggelman, M., Sabbagh, D., Sammak, A., Almudever, C. G., Sebastiano, F., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0274-4 · Cited by 49
Metadata
- Authors
- Landman, B. S., & Russo, R. L.
- Venue
- IEEE Transactions on Computers
- Published
- 1971-12
- Volume
- C-20
- Issue
- 12
- Pages
- 1469-1479
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W1970296212
- Cited by
- 714
- References
- 0
- FWCI
- 7.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On a Pin Versus Block Relationship For Partitions of Logic Graphs. https://app.cochat.ai/papers/10.1109/t-c.1971.223159
- The paper
- Landman, B. S., & Russo, R. L. (1971). On a Pin Versus Block Relationship For Partitions of Logic Graphs. IEEE Transactions on Computers. https://doi.org/10.1109/t-c.1971.223159
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.
