| 1990 |
|---|
| 9 | | Philippe Flajolet,
Paolo Sipala,
Jean-Marc Steyaert:
Analytic Variations on the Common Subexpression Problem.
ICALP 1990: 220-234 |
| 1988 |
|---|
| 8 | | Paolo Sipala:
Efficient Implementation of Binary Trees in LISP Systems.
Comput. J. 31(4): 330-335 (1988) |
| 1987 |
|---|
| 7 | | W. K. Luk,
Paolo Sipala,
C. K. Wong:
Minimum-Area Wiring for Slicing Structures.
IEEE Trans. Computers 36(6): 745-760 (1987) |
| 6 | EE | W. K. Luk,
Paolo Sipala,
Markku Tamminen,
Donald T. Tang,
Lin S. Woo,
Chak-Kuen Wong:
A Hierarchical Global Wiring Algorithm for Custom Chip Design.
IEEE Trans. on CAD of Integrated Circuits and Systems 6(4): 518-533 (1987) |
| 1986 |
|---|
| 5 | | Markku Tamminen,
W. K. Luk,
Paolo Sipala,
Lin S. Woo,
C. K. Wong:
Constructing Maximal Slicings from Geometry.
Acta Inf. 23(3): 267-288 (1986) |
| 4 | | Harold S. Stone,
Paolo Sipala:
The Average Complexity of Depth-First Search with Backtracking and Cutoff.
IBM Journal of Research and Development 30(3): 242-258 (1986) |
| 1982 |
|---|
| 3 | EE | Paolo Sipala:
Compact Storage of Binary Trees.
ACM Trans. Program. Lang. Syst. 4(3): 345-361 (1982) |
| 1981 |
|---|
| 2 | | Paolo Sipala:
Optimum Cell Size for the Storage of Messages.
IEEE Trans. Software Eng. 7(1): 132-134 (1981) |
| 1977 |
|---|
| 1 | EE | Paolo Sipala:
Remark on "Algorithm 408: A Sparse Matrix Package (Part I) [F4]".
ACM Trans. Math. Softw. 3(3): 303 (1977) |
