Philip M. Spira

	1985
13		Philip M. Spira, Carl Hage: Hardware acceleration of gate array layout. DAC 1985: 359-366
	1983
12		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 SWAT (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(n2 log2n). 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 SWAT (FOCS) 1971: 202-206
	1969
4		Philip M. Spira: On the Computation Time of Certain Classes of Boolean Functions STOC 1969: 271-272
3		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 SWAT (FOCS) 1968: 69-75
	1967
1		Philip M. Spira, Michael A. Arbib: Computation Times for Finite Groups, Semigroups and Automata SWAT (FOCS) 1967: 291-295

Coauthor Index

1	Michael A. Arbib	[1]
2	Robert G. Gallager	[12]
3	Carl Hage	[13]
4	Pierre A. Humblet	[12]
5	J. Ian Munro	[10]
6	A. Pan	[8] [9]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page