- David E. Muller and Franco P. Preparata. Bounds to complexities of networks
for sorting and for switching. Journal of the ACM,
22(2):195-201, April 1975.
Citations.
- H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of
vectors. Journal of the ACM, 22(4):469-476, October
1975.
Citations.
- David E. Muller and Franco P. Preparata. Restructuring of arithmetic
expressions for parallel evaluation. Journal of the
ACM, 23(3):534-543, July 1976.
Citations.
- D. T. Lee and F. P. Preparata. An optimal algorithm for finding the
kernel of a polygon. Journal of the ACM, 26(3):415-421,
July 1979.
Citations.
- K. Mehlhorn and F. P. Preparata. Routing through a rectangle.
Journal of the ACM, 33(1):60-85, January 1986.
Citations.
- G. Bilardi and F. P. Preparata. Size-time complexity of Boolean
networks for prefix computations. Journal of the ACM,
36(2):362-382, April 1989.
Citations.
Shortcuts: