Paolo Sipala

According to our database, Paolo Sipala authored at least 10 papers between 1969 and 1990.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1990

Analytic Variations on the Common Subexpression Problem.

Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

Efficient Implementation of Binary Trees in LISP Systems.

Paolo Sipala

Comput. J., 1988

1987

A Hierarchical Global Wiring Algorithm for Custom Chip Design.

Wing K. Luk, Paolo Sipala, Markku Tamminen, Donald T. Tang, Lin S. Woo, Chak-Kuen Wong

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

Minimum-Area Wiring for Slicing Structures.

Wing K. Luk, Paolo Sipala, C. K. Wong

IEEE Trans. Computers, 1987

1986

The Average Complexity of Depth-First Search with Backtracking and Cutoff.

Harold S. Stone, Paolo Sipala

IBM J. Res. Dev., 1986

Constructing Maximal Slicings from Geometry.

Markku Tamminen, Wing K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong

Acta Informatica, 1986

1982

Compact Storage of Binary Trees.

Paolo Sipala

ACM Trans. Program. Lang. Syst., 1982

1981

Optimum Cell Size for the Storage of Messages.

Paolo Sipala

IEEE Trans. Software Eng., 1981

1977

Remark on "Algorithm 408: A Sparse Matrix Package (Part I) [F4]".

Paolo Sipala

ACM Trans. Math. Softw., 1977

1969

Formatting and display of ALGOL expressions.

Paolo Sipala

Comput. J., 1969