| 1985 |
|---|
| 13 | EE | Philip M. Spira,
Carl Hage:
Hardware acceleration of gate array layout.
DAC 1985: 359-366 |
| 1983 |
|---|
| 12 | EE | Robert G. Gallager,
Pierre A. Humblet,
Philip M. Spira:
A Distributed Algorithm for Minimum-Weight Spanning Trees.
ACM Trans. Program. Lang. Syst. 5(1): 66-77 (1983) |
| 1977 |
|---|
| 11 | | Philip M. Spira:
Communication Complexity of Distributed Minimum Spanning Tree Algorithms.
Berkeley Workshop 1977: 236- |
| 1976 |
|---|
| 10 | | J. Ian Munro,
Philip M. Spira:
Sorting and Searching in Multisets.
SIAM J. Comput. 5(1): 1-8 (1976) |
| 1975 |
|---|
| 9 | | Philip M. Spira,
A. Pan:
On Finding and Updating Spanning Trees and Shortest Paths.
SIAM J. Comput. 4(3): 375-380 (1975) |
| 1973 |
|---|
| 8 | | Philip M. Spira,
A. Pan:
On Finding and Updating Shortest Paths and Spanning Trees
FOCS 1973: 82-84 |
| 7 | | Philip M. Spira:
A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n² log²n).
SIAM J. Comput. 2(1): 28-32 (1973) |
| 1972 |
|---|
| 6 | | Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities.
J. Comput. Syst. Sci. 6(3): 205-216 (1972) |
| 1971 |
|---|
| 5 | | Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities
FOCS 1971: 202-206 |
| 1969 |
|---|
| 4 | | Philip M. Spira:
On the Computation Time of Certain Classes of Boolean Functions
STOC 1969: 271-272 |
| 3 | EE | Philip M. Spira:
The Time Required for Group Multiplication.
J. ACM 16(2): 235-243 (1969) |
| 1968 |
|---|
| 2 | | Philip M. Spira:
On the Computation Time of Finite Functions
FOCS 1968: 69-75 |
| 1967 |
|---|
| 1 | | Philip M. Spira,
Michael A. Arbib:
Computation Times for Finite Groups, Semigroups and Automata
FOCS 1967: 291-295 |
