Skip to main content
SpringerLink
Log in

A "fast implementation" of a multidimensional storage into a tree storage

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 85))

Included in the following conference series:

Abstract

Every multidimensional Turing-machine can be simulated on-line by a tree-tape Turing-machine in nearly the same amount of time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook and Anderaa, On the minimum computation time of functions, Trans. AMS 142, August 1969, 291–314.

    Google Scholar 

  2. Fischer, Meyer and Rosenberg, Real-time simulation of multihead tape units, J. ACM 19, 4, 1972, 590–607.

    Google Scholar 

  3. Grigorjev, Imbedding theorems for Turing-machines of differnet dimensions and Kolmogorov's algorithms, Soviet Math. Dokl. 18, 1977, 588–592.

    Google Scholar 

  4. Grigorjev, Time bounds of multidimensional Turing-machines, 1979.

    Google Scholar 

  5. Hennie, On-line Turing machine computations, IEEE Trans. EC 15, 1, 1966, 34–44.

    Google Scholar 

  6. Hennie and Stearns, Two-tape simulation of multihead tape units, I. ACM 13, 4, 1966, 533–546.

    Google Scholar 

  7. Leong and Seiferas, New real-time simulations of multihead tape units, Proc. 9th ACM Symp. Theory of Computing, 1977, 239–248.

    Google Scholar 

  8. Paterson, Fischer and Meyer, An improved overlap argument for on-line multiplication, SIAM-AMS Proc. 7, 1974, 97–111.

    Google Scholar 

  9. Paul and Reischuk, On time versus space II, 20th IEEE-FOCS, 1979, 298–306.

    Google Scholar 

  10. Pippenger and Fischer, Relations among complexity measures, J. ACM 26, 2, 1979, 361–381.

    Google Scholar 

  11. Reischuk, Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur, Preprint, Universität Bielefeld, 1979.

    Google Scholar 

  12. Stoss, Zwei-Band Simulation von Turingmaschinen, Computing 7, 1971, 222–235.

    Google Scholar 

  13. Turing, On computable numbers with an application to the Entscheidungsporblem, Proc. London Math. Soc. (2), 42, 1936, 230–265.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 4800, Bielefeld 1, Germany

    Rüdiger Reischuk

Authors
  1. Rüdiger Reischuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reischuk, R. (1980). A "fast implementation" of a multidimensional storage into a tree storage. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation