Travelled to:1 × Belgium
1 × Greece
1 × Israel
3 × USA
Collaborated with:G.Bilardi K.Mehlhorn J.Vuillemin D.T.Lee
Talks about:time (6) area (4) network (3) comput (3) vlsi (3) minimum (2) complex (2) optim (2) integ (2) sort (2)
Person: Franco P. Preparata
DBLP: Preparata:Franco_P=
Contributed to:
1987
19851984198419811976Wrote 6 papers:
- STOC-1987-BilardiP #complexity #network
- Size-Time Complexity of Boolean Networks for Prefix Computations (GB, FPP), pp. 436–442.
- ICALP-1985-BilardiP #complexity #sorting
- The Influence of Key Length on the Area-Time Complexity of Sorting (GB, FPP), pp. 53–62.
- ICALP-1984-MehlhornP #integer #multi
- Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (KM, FPP), pp. 347–357.
- STOC-1984-BilardiP #network #sorting
- A Minimum Area VLSI Network for O(log n) Time Sorting (GB, FPP), pp. 64–70.
- ICALP-1981-PreparataV #fourier #integer #multi #network
- Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform (FPP, JV), pp. 29–40.
- STOC-1976-LeeP
- Location of a Point in a Planar Subdivision and its Applications (DTL, FPP), pp. 231–235.