Addressable Data Graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Addressable Data Graphs

Full text

Pdf (1.37 MB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 2 (April 1972) table of contents

Pages: 309 - 340

Year of Publication: 1972

ISSN:0004-5411

Author

Arnold L. Rosenberg

Mathematical Sciences Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321694.321703 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

ROSENBERG, A. L. Data graphs and addressing schemes. J. Comput. Syst. Sci. 5 (1971), 193-238.

CITED BY

Arnold L. Rosenberg, On Scheduling Mesh-Structured Computations for Internet-Based Computing, IEEE Transactions on Computers, v.53 n.9, p.1176-1186, September 2004

INDEX TERMS

Primary Classification:
E. Data