skip to main content
10.1145/800157.805046acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free Access

Addressable data graphs (Extended Abstract)

Published:03 May 1971Publication History

ABSTRACT

This paper continues the study of the classes of data graphs which are implementable in a random access memory using “relative addressing” and “relocatable realization”, which was initiated in [1]. A new characterization of the class of rooted (=relative addressable) data graphs yields simple and natural proofs of the preservation of rootedness under broad families of operations for composing data graphs. These positive results somewhat diminish the impact of the general unsolvability of detecting rootedness and free-rootedness (=relocatability) in data graphs.

References

  1. 1.Rosenberg, A. L. Data graphs and addressing schemes. Journ. Computer and System Sciences, in press. See also a preliminary version in Proc. 2nd Annual ACM Symposium on Theory of Computing, Northampton, Mass. (1970) 48-61. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Addressable data graphs (Extended Abstract)

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      STOC '71: Proceedings of the third annual ACM symposium on Theory of computing
      May 1971
      270 pages
      ISBN:9781450374644
      DOI:10.1145/800157

      Copyright © 1971 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 May 1971

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      STOC '71 Paper Acceptance Rate23of50submissions,46%Overall Acceptance Rate1,469of4,586submissions,32%

      Upcoming Conference

      STOC '24
      56th Annual ACM Symposium on Theory of Computing (STOC 2024)
      June 24 - 28, 2024
      Vancouver , BC , Canada
    • Article Metrics

      • Downloads (Last 12 months)38
      • Downloads (Last 6 weeks)10

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader