Free Access
Issue
RAIRO. Inform. théor.
Volume 13, Number 2, 1979
Page(s) 155 - 184
DOI https://doi.org/10.1051/ita/1979130201551
Published online 01 February 2017
  1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Exercise 6.5, p. 247, Addison-Wesley, Reading, Mass., 1974. [MR: 413592] [Zbl: 0326.68005]
  2. 2. R. ALBRECHT, Zur Struktur von Informationssysternen, in Automatentheorie und formale Sprachen, Oberwolfach, 1969, J. DÖRR and G. HOTZ Eds., Berichte aus dem mathematischen Forschungsinstitut Oberwolfach, Vol. 3, 1970, pp. 493-505, Bibliographisches Institut, Mannheim. [MR: 329301] [Zbl: 0209.30901]
  3. 3. B. BUCHBERGER, Computer-Trees and Their Programming, Troisième Colloque de Lille sur les Arbres en Algèbre et en Programmation, 1978. [MR: 483609] [Zbl: 0383.68027]
  4. 4. B. BUCHBERGER and J. FEGERL, Ein universeller Modul zur Hardware-Implementierung von Rekursionen, Laboratory Note, Universität Linz, 1977.
  5. 5. E. G. COFFMAN (éd.), Computer and Job Shop Scheduling Theory, Wiley-Interscience, New York, 1976. [MR: 629691] [Zbl: 0359.90031]
  6. 6. R. W. CONWAY, W. L. MAXWELL and L. W. MILLER, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967. [MR: 389180] [Zbl: 1058.90500]
  7. 7. G. GATI, Aspects of Unbounded Parallelism, in Theoretical Computer Science, 3rd G.I. Conference, Darmstadt, 1977, H. TZSCHACH, H. WALDSCHMIDT and H. K.-G. WALTER, Eds., Lecture Notes in Computer Science, Vol. 48, pp. 292-305, Springer, Berlin, 1977. [MR: 478710] [Zbl: 0358.68069]
  8. 8. G. T. HERMAN and G. ROZENBERG, Developmental Systems and Languages, North-Holland-American Elsevier, Amsterdam, 1975. [MR: 495247] [Zbl: 0306.68045]
  9. 9. R. M. KARP and R. E. MILLER, Parallel Program Schemata, J. Comput. System Sc., Vol. 3, 1969, pp. 147-195. [MR: 246720] [Zbl: 0198.32603]
  10. 10. R. M. KELLER, Closures of Parallel Program Schemata, Unpublished thesis, University of California, 1970.
  11. 11. R. M. KELLER, On Maximal Parallel Schemata, in Conference Record of 11th Annual Symposium on Switching and Automata Theory, LE.E.E., New York, 1970, pp. 32-50.
  12. 12. R. M. KELLER, Parallel Program Schemata and Maximal Parallelism, J. Assoc. Comput. Mach., Vol. 20, 1973, pp. 514-537 (part I) and Vol. 20, 1973, pp. 696-710 (part II). [Zbl: 0273.68011]
  13. 13. H. KOPP, Bemerkungen zum Deadlockproblem in parallelen Prozessen, Unpublished report, Tagung über Automatentheorie und formale Sprachen, Mathematisches Forschungsinstitut Oberwolfach, 1975.
  14. 14. F. SCHWENKEL, Zur Theorie unendlicher Parallelprozessoren, in G.I.-4. Jahrestagung, Berlin, 1974, D. SIEFKES, éd., (im Auftrag der G.I.), Lecture Notes in Computer Science, Vol. 26, pp. 355-364, Springer, Berlin, 1975. [Zbl: 0323.68012]
  15. 15. H. SULLIVAN and T. R. BASHKOW, A Large Scale, Homogeneous, Fully Distributed Parallel Machine, I. Comp. Arch. News, Vol. 5, 1977, pp. 105-117.
  16. 16. H. SULLIVAN, T. R. BASHKOW and D. KLAPPHOLZ, A Large Scale, Homogenous, Fully Distributed Parallel Machine, II Comp. Arch. News, Vol. 5, 1977. pp. 118-124.
  17. 17. J. T. Tou (éd.), Advances in Information Systems Science, Vol. 6, 1976, Plenum Press, New York. [MR: 448973] [Zbl: 0344.00013]
  18. 18. J. D. ULLMAN, NP-Complete Scheduling Problems, J. Comput. System Sc.,Vol. 10, 1975, pp. 384-393. [MR: 391585] [Zbl: 0313.68054]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.