Luigi Logrippo
- 1 AHO, A V, HOPCROFr, J E, ANO ULLldAN, J D The Design and Analysls of Computer Algorithms Addison-Wesley, Reading, Mass , 1974 Google Scholar
- 2 BAER, J L A survey of some theoretical aspects of mult~processmg Computing Surveys 5 (1973), 31- 80 Google Scholar
- 3 CHANDRA, A I~ On the properties and apphcatlons of program schemas Memo AIM-188, A I Lab , Stanford U , Stanford, Cahf, 1973Google Scholar
- 4 GRIES, D Compder Constructton for Dtgltal Computers Wiley, New York, 1971 Google Scholar
- 5 Ia'ICIN, V.E Logic-term eqmvalence of program schemata Cybernettcs 8 (1972), 5-28Google Scholar
- 6 K^RP, R.M , AND MILLER, R E Parallel program schemata J Comptr and Syst Sci 3 (1969), 147- 195Google Scholar
- 7 KELLER, R M Parallel program schemata and maximal parallehsm, Pts i and II J ACM 20 (1973), 514-537 and 696-710 Google Scholar
- 8 KOTOV, V.E, AND NARIN'YANI, A S Theory of parallel programming, Pts I and II Cybernettcs 10 (1974), 1-18,377-392,735-748Google Scholar
- 9 LAVROV. S.S Economy of memory m closed operator schemes U.S.S.R Computat Math. and Math Physics I (1961), 810-828.Google Scholar
- 10 Lo6RtPPO, L Renamings m parallel program schemas Res. Rep. CS-74-05, Dept. Appl Analysis and Comptr. Set., U. of Waterloo, Waterloo, Ont., Canada, 1974.Google Scholar
- 11 Looau,po, L Renamings and memory economy in program schemas. Res. Rep. TR 76-01, Dept. Comptr. Set., U. of Ottawa, Ottawa, Ont, Canada, Nov 1976.Google Scholar
- 12 M^RTINYUg, V.V On the economtcal dtstributlon of a store. U.S S.R. Computat. Math and Math. Phystcs 2 (1962), 469-481.Google Scholar
- 13 PATgttSOlq, M.S Eqmvalence problems m a model of computation Tech Memo No I, A { Lab., M I.T, Cambridge, Mass, 1970Google Scholar
- 14 VOLANSKt, S.A Graph model analysts and implementation of computational sequences Ph D. Dlss., Dept E E., U of Cahf, Los Angeles, Cahf, 1970. Google Scholar
- 15 WEmRAUCH, K The computational complexity of program schemata. J Comptr and Syst. Sc~. 12 (1976), 80-107Google Scholar
- 16 YERS~OV, A P Reduction of the problem of memory alloeatton m programming to the problem of coloring the verttces of a graph Sovtet Math 3 (1962), 163-165Google Scholar
- 17 YERSUOV, A P , ED The Alpha Automauc Programming System Academic Press, London, 1971Google Scholar
Index Terms
- Renamings and Economy of Memory in Program Schemata
Recommendations
On Ianov's Program Schemata
Ianov has defined a formal abstraction of the notion of program which represents the sequential and control properties of a program but suppresses the details of the operations. For these schemata he defines a notion corresponding to computation and ...
Scientific output and its relationship to knowledge economy: an analysis of ASEAN countries
This article seeks to examine the relationship between scientific output and knowledge economy index in 10 South East Asian countries (ASEAN). Using bibliometric data of the Institute of Scientific Information, we analyzed the number of scientific ...
Graph transformation to infer schemata from XML documents
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingSemi-structured data are characterized by the lack of a predefined schema. This heterogeneity simplifies the management of such data, but analysis and queries become more difficult and demand for schemata that describe these data. Super-imposed ...
Comments