Memories for parallel subtree-access

1. Budnik, P. and D. K. Kuck. The organization and use of parallel memories. IEEE Trans. Comp. C-20, 1566–1569 (1971).

   Google Scholar 

2. Shapiro, D. H., Theoretical limitations on the use of parallel memories. Ph. D. Thesis, Dep. Comp. Sc. Univ. Illinois, UIUCDS-R-75-776 (1975).

   Google Scholar 

3. Lawrie, D. H. and R. Vora. The prime memory system for array access. IEEE Trans. Comp. C-31, 435–442 (1982).

   Google Scholar 

4. Voorhis, D. C. and T. H. Morrin, Memory system for image processing. IEEE Trans. Comp. C-27, 113–125 (1978).

   Google Scholar 

5. Rebel, B. und M. Gössel, Ein paralleler Speicher. ZKI der AdW, Berlin, 1982.

   Google Scholar 

6. Gössel, M. and B. Rebel. Parallel memories with recursive address computation, Parallel Computing 83, ed. Feilmeier, M. Elsevier Sc. Publ. 1984. 515–520.

   Google Scholar 

7. Gössel, M. and B. Rebel. Parallel memories for picture processing (in russ.) Isv. AN SSSR, Techniceskaja kibernetika, in press.

   Google Scholar 

8. Maurer, H. A., Datenstrukturen und Programmierverfahren, Teubner-Verlag, Stuttgart, 1974.

   Google Scholar 

9. Gössel, M. and B. Rebel, Data structures and parallel memories, Proc. Parcella 86, Berlin, Akademie-Verlag 1986, 49–60.

   Google Scholar 

10. Shirakawa, H., On a parallel memory to access trees. unpublished manuscript 1984.

    Google Scholar 

11. Creutzburg, R., Parallel optimal subtree access with recursively linear module assignment functions, Proc. Parcella 86, Berlin, Akademie-Verlag 1986, 203–209.

    Google Scholar 

12. Wijshoff, H., Storing trees into parallel memories. Parallel computing 85, ed. Feilmeier, M. Elsevier Sc. Publ. 1986, 253–261.

    Google Scholar 

13. Wijshoff, H. and J. v. Leeuwen. Arbitrary versus periodic storage schemes and tesselation of the plane using one type of polyomino. Inf. Control 62, 1–25 (1984).

    Article  Google Scholar 

Download references