Philip M. Spira

According to our database, Philip M. Spira authored at least 15 papers between 1967 and 1985.

Collaborative distances:

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

1985

Hardware acceleration of gate array layout.

Philip M. Spira, Carl Hage

Proceedings of the 22nd ACM/IEEE conference on Design automation, 1985

1983

A Distributed Algorithm for Minimum-Weight Spanning Trees.

Robert G. Gallager, Pierre A. Humblet, Philip M. Spira

ACM Trans. Program. Lang. Syst., 1983

1977

Communication Complexity of Distributed Minimum Spanning Tree Algorithms.

Philip M. Spira

Proceedings of the Second Berkeley Workshop on Distributed Data Management and Computer Networks, 1977

1976

Sorting and Searching in Multisets.

J. Ian Munro, Philip M. Spira

SIAM J. Comput., 1976

1975

On Finding and Updating Spanning Trees and Shortest Paths.

Philip M. Spira, A. Pan

SIAM J. Comput., 1975

1973

Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits.

Philip M. Spira

IEEE Trans. Computers, 1973

A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n² log²n).

Philip M. Spira

SIAM J. Comput., 1973

On Finding and Updating Shortest Paths and Spanning Trees

Philip M. Spira, A. Pan

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972

Complete Linear Proofs of Systems of Linear Inequalities.

Philip M. Spira

J. Comput. Syst. Sci., 1972

1971

On the Time Necessary to Compute Switching Functions.

Philip M. Spira

IEEE Trans. Computers, 1971

1970

On the computational complexity of finite functions and semigroup multiplication.

Philip M. Spira

Inf. Sci., 1970

1969

The Time Required for Group Multiplication.

Philip M. Spira

J. ACM, 1969

On the Computation Time of Certain Classes of Boolean Functions

Philip M. Spira

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1968

On the Computation Time of Finite Functions

Philip M. Spira

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

Computation Times for Finite Groups, Semigroups and Automata

Philip M. Spira, Michael A. Arbib

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967