Philip M. Spira

16 papers A* 2Journal 9Unranked 5
YearRankTypeTitle / Venue / Authors
1985 A* conf
Hardware acceleration of gate array layout.
DAC
Philip M. Spira, Carl Hage
1983 J jnl
A Distributed Algorithm for Minimum-Weight Spanning Trees.
ACM Trans. Program. Lang. Syst.
Robert G. Gallager, Pierre A. Humblet, Philip M. Spira
1977 — conf
Communication Complexity of Distributed Minimum Spanning Tree Algorithms.
Berkeley Workshop
Philip M. Spira
1976 J jnl
Sorting and Searching in Multisets.
SIAM J. Comput.
J. Ian Munro, Philip M. Spira
1975 J jnl
On Finding and Updating Spanning Trees and Shortest Paths.
SIAM J. Comput.
Philip M. Spira, A. Pan
1973 J jnl
A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n
SIAM J. Comput.
Philip M. Spira
1973 J jnl
Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits.
IEEE Trans. Computers
Philip M. Spira
1973 — conf
On Finding and Updating Shortest Paths and Spanning Trees
SWAT
Philip M. Spira, A. Pan
1972 J jnl
Complete Linear Proofs of Systems of Linear Inequalities.
J. Comput. Syst. Sci.
Philip M. Spira
1971 — conf
Complete Linear Proofs of Systems of Linear Inequalities
SWAT
Philip M. Spira
1971 J jnl
On the Time Necessary to Compute Switching Functions.
IEEE Trans. Computers
Philip M. Spira
1970 J jnl
On the computational complexity of finite functions and semigroup multiplication.
Inf. Sci.
Philip M. Spira
1969 A* conf
On the Computation Time of Certain Classes of Boolean Functions
STOC
Philip M. Spira
1969 J jnl
The Time Required for Group Multiplication.
J. ACM
Philip M. Spira
1968 — conf
On the Computation Time of Finite Functions
SWAT
Philip M. Spira
1967 — conf
Computation Times for Finite Groups, Semigroups and Automata
SWAT
Philip M. Spira, Michael A. Arbib