Israel Cederbaum

According to our database, Israel Cederbaum authored at least 8 papers between 1959 and 1994.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

1994

Spectral Properties of Admittance Matrices of Resistive Tree Networks.

Israel Cederbaum

J. Circuits Syst. Comput., 1994

1993

On Paths with the Shortest Average Arc Length in Weighted Graphs.

Shmuel Wimer, Israel Koren, Israel Cederbaum

Discret. Appl. Math., 1993

1992

Balanced Block Spacing for VLSI Layout.

Israel Cederbaum, Israel Koren, Shmuel Wimer

Discret. Appl. Math., 1992

1989

Optimal aspect ratios of building blocks in VLSI.

Shmuel Wimer, Israel Koren, Israel Cederbaum

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

1973

On Optimal Routing Through Communication Nets.

Israel Cederbaum, Israel M. Paz

IEEE Trans. Commun., 1973

1972

Evaluation of Optimal Routing Policies in Communication Nets by Simulation.

Israel M. Paz, Israel Cederbaum

IEEE Trans. Commun., 1972

1968

A suggestion for an analog function generator of two variables.

T. Lamdan, Israel Cederbaum

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 2, 1968

1959

Applications of matrix algebra to network theory.

Israel Cederbaum

IRE Trans. Inf. Theory, 1959