| 1985 | ||
|---|---|---|
| c7 | ||
| 1983 | ||
| j6 | 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 | ||
| c6 | Philip M. Spira: Communication Complexity of Distributed Minimum Spanning Tree Algorithms. Berkeley Workshop 1977: 236- | |
| 1976 | ||
| j5 | ||
| 1975 | ||
| j4 | Philip M. Spira, A. Pan: On Finding and Updating Spanning Trees and Shortest Paths. SIAM J. Comput. 4(3): 375-380 (1975) | |
| 1973 | ||
| j3 | Philip M. Spira: A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n). SIAM J. Comput. 2(1): 28-32 (1973) | |
| c5 | Philip M. Spira, A. Pan: On Finding and Updating Shortest Paths and Spanning Trees. SWAT (FOCS) 1973: 82-84 | |
| 1972 | ||
| j2 | Philip M. Spira: Complete Linear Proofs of Systems of Linear Inequalities. J. Comput. Syst. Sci. 6(3): 205-216 (1972) | |
| 1971 | ||
| c4 | Philip M. Spira: Complete Linear Proofs of Systems of Linear Inequalities. SWAT (FOCS) 1971: 202-206 | |
| 1969 | ||
| j1 | ||
| c3 | Philip M. Spira: On the Computation Time of Certain Classes of Boolean Functions. STOC 1969: 271-272 | |
| 1968 | ||
| c2 | ||
| 1967 | ||
| c1 | Philip M. Spira, Michael A. Arbib: Computation Times for Finite Groups, Semigroups and Automata. SWAT (FOCS) 1967: 291-295 | |
| 1 | Michael A. Arbib | |
| 2 | Robert G. Gallager | |
| 3 | Carl Hage | |
| 4 | Pierre A. Humblet | |
| 5 | J. Ian Munro | |
| 6 | A. Pan |
Data released under the ODC-BY 1.0 license — See also our legal information page