Computation Times for Finite Groups, Semigroups and Automata - Philip M. Spira; Michael A. Arbib (SWAT, 1967)

On the Computation Time of Finite Functions - Philip M. Spira (SWAT, 1968)

On the Computation Time of Certain Classes of Boolean Functions - Philip M. Spira (STOC, 1969)

The Time Required for Group Multiplication. - Philip M. Spira (J. ACM, 1969)

On the computational complexity of finite functions and semigroup multiplication. - Philip M. Spira (Inf. Sci., 1970)

On the Time Necessary to Compute Switching Functions. - Philip M. Spira (IEEE Trans. Computers, 1971)

Complete Linear Proofs of Systems of Linear Inequalities. - Philip M. Spira (J. Comput. Syst. Sci., 1972)

On Finding and Updating Shortest Paths and Spanning Trees - Philip M. Spira; A. Pan (SWAT, 1973)

A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n). - Philip M. Spira (SIAM J. Comput., 1973)

Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits. - Philip M. Spira (IEEE Trans. Computers, 1973)

On Finding and Updating Spanning Trees and Shortest Paths. - Philip M. Spira; A. Pan (SIAM J. Comput., 1975)

Sorting and Searching in Multisets. - J. Ian Munro; Philip M. Spira (SIAM J. Comput., 1976)

Communication Complexity of Distributed Minimum Spanning Tree Algorithms. - Philip M. Spira (Berkeley Workshop, 1977)

A Distributed Algorithm for Minimum-Weight Spanning Trees. - Robert G. Gallager; Pierre A. Humblet; Philip M. Spira (ACM Trans. Program. Lang. Syst., 1983)

Hardware acceleration of gate array layout. - Philip M. Spira; Carl Hage (DAC, 1985)