Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
暂无分享,去创建一个
[1] André Thayse,et al. Synthesis and Optimization of Programs by Means of P-Functions , 1982, IEEE Transactions on Computers.
[2] A. T. Mishchenko,et al. Transformation of microprograms , 1967 .
[3] Eduardo Sanchez,et al. Synthesis of Minimal Binary Decision Trees , 1979, IEEE Transactions on Computers.
[4] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[5] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[6] André Thayse. P-functions: A new tool for the analysis and synthesis of binary programs , 1981, IEEE Transactions on Computers.
[7] Christopher R. Clare. Designing logic systems using state machines , 1973 .
[8] Jean-Pierre Deschamps,et al. Digital systems, with algorithm implementation , 1983 .
[9] V. M. Glushkov,et al. Theory of Algorithms and Discrete Processors , 1969 .
[10] Robert M. Keller,et al. Parallel Program Schemata and Maximal Parallelism I. Fundamental Results , 1973, JACM.
[11] V. M. Glushkov. Minimization of microprograms and algorithm schemes , 1966 .
[12] André Thayse,et al. A Matrix Formalism for Asynchronous Implementation of Algorithms , 1984, IEEE Transactions on Computers.