Gyula A. Magó

According to our database, Gyula A. Magó authored at least 11 papers between 1970 and 1985.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1985

Making Parallel Computations Simple: The FFP Machine.

Gyula A. Magó

Proceedings of the Spring COMPCON'85, 1985

1982

Data Sharing in an FFP Machine.

Gyula Magó

Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, 1982

Solving Partial Differential Equations on a Cellular Tree Machine.

Gyula A. Magó, Roy P. Pargas

Proceedings of the Parallel and Large-Scale Computers: Performance, 1982

1981

Copying operands versus copying results: A solution to the problem of large operands in FFP'S.

Gyula Magó

Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1979

Minimizing maximum flows in linear graphs.

Donald F. Stanat, Gyula A. Magó

Networks, 1979

A network of microprocessors to execute reduction languages, part II.

Gyula A. Magó

Int. J. Parallel Program., 1979

A network of microprocessors to execute reduction languages, part I.

Gyula A. Magó

Int. J. Parallel Program., 1979

1973

Monotone Functions in Sequential Circuits.

Gyula Magó

IEEE Trans. Computers, 1973

1972

Algebraic Parsing Techniques for Context-Free Languages.

Stephen F. Weiss, Gyula Magó, Donald F. Stanat

Proceedings of the Automata, 1972

1971

Realization Methods for Asynchronous Sequential Circuits.

Gyula Magó

IEEE Trans. Computers, 1971

1970

Asynchronous Sequential Circuits with (2,1) Type State Assignments

Gyula Magó

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970