Philip M. Spira - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

1985

Hardware acceleration of gate array layoutPhilip M. Spira, Carl Hage. dac 1985: 359-366 [doi]

1983

A Distributed Algorithm for Minimum-Weight Spanning TreesRobert G. Gallager, Pierre A. Humblet, Philip M. Spira. TOPLAS, 5(1):66-77, 1983. [doi]

1977

Communication Complexity of Distributed Minimum Spanning Tree AlgorithmsPhilip M. Spira. berkeley 1977: 236

1976

Sorting and Searching in MultisetsJ. Ian Munro, Philip M. Spira. SICOMP, 5(1):1-8, 1976.

1975

On Finding and Updating Spanning Trees and Shortest PathsPhilip M. Spira, A. Pan. SICOMP, 4(3):375-380, 1975.

1973

A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n² log²n)Philip M. Spira. SICOMP, 2(1):28-32, 1973.

On Finding and Updating Shortest Paths and Spanning TreesPhilip M. Spira, A. Pan. focs 1973: 82-84

Computation Times of Arithmetic and Boolean Functions in (d, r) CircuitsPhilip M. Spira. TC, 22(6):552-555, 1973. [doi]

1972

Complete Linear Proofs of Systems of Linear InequalitiesPhilip M. Spira. jcss, 6(3):205-216, 1972.

1971

Complete Linear Proofs of Systems of Linear InequalitiesPhilip M. Spira. focs 1971: 202-206

On the Time Necessary to Compute Switching FunctionsPhilip M. Spira. TC, 20(1):104-105, 1971. [doi]

1970

On the computational complexity of finite functions and semigroup multiplicationPhilip M. Spira. isci, 2(1):35-49, 1970. [doi]

1969

On the Computation Time of Certain Classes of Boolean FunctionsPhilip M. Spira. stoc 1969: 271-272

The Time Required for Group MultiplicationPhilip M. Spira. JACM, 16(2):235-243, 1969. [doi]

1968

On the Computation Time of Finite FunctionsPhilip M. Spira. focs 1968: 69-75

1967

Computation Times for Finite Groups, Semigroups and AutomataPhilip M. Spira, Michael A. Arbib. focs 1967: 291-295

Sign in or sign up to see more results.

runs on WebDSL