K. N. Venkataraman

According to our database, K. N. Venkataraman authored at least 6 papers between 1981 and 1992.

Collaborative distances:

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

1992

Gossiping in Minimal Time.

David W. Krumme, George Cybenko, K. N. Venkataraman

SIAM J. Comput., 1992

1987

Decidability of the purely existential fragment of the theory of term algebras.

K. N. Venkataraman

J. ACM, 1987

Fixed Hypercube Embedding.

George Cybenko, David W. Krumme, K. N. Venkataraman

Inf. Process. Lett., 1987

1986

Simultaneous Broadcasting in Multiprocessor Networks.

George Cybenko, David W. Krumme, K. N. Venkataraman

Proceedings of the International Conference on Parallel Processing, 1986

1983

A View of Computability on Term Algebras.

K. N. Venkataraman, Ann Yasuhara, Frank M. Hawrusik

J. Comput. Syst. Sci., 1983

1981

Classes of Functions for Computing on Binary Trees (Extended Abstract)

Frank M. Hawrusik, K. N. Venkataraman, Ann Yasuhara

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981