( en | de | ru )

 

Disambiguation of "Bilardi, Gianfranco"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Control Dependence Computation and the Roman Chariots Problem.

, and . ACM Trans. Program. Lang. Syst., 19 (3): 462-491 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gianfranco Walsh

Gianfranco Gentile

Gianfranco Hagen

Gianfranco Pacchioni

Gianfranco Casuso

 

Other publications of authors with the same name

A Minimum Area VLSI Network for O(log n) Time Sorting., and . IEEE Trans. Computers, 34 (4): 336-343 (1985)Network-Oblivious Algorithms., , , , and . J. ACM, 63 (1): 3:1-3:36 (2016)On Bufferless Routing of Variable Length Messages in Leveled Networks., , , , , and . IEEE Trans. Computers, 45 (6): 714-729 (1996)Optimal organizations for pipelined hierarchical memories., , and . SPAA, page 109-116. ACM, (2002)Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation., and . SPAA, page 185-194. ACM, (1995)A Minimum Area VLSI Network for O(log n) Time Sorting, and . STOC, page 64-70. ACM, (1984)Optimal On-Line Computation of Stack Distances for MIN and OPT., , and . Conf. Computing Frontiers, page 237-246. ACM, (2017)Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation., and . WADS, volume 955 of Lecture Notes in Computer Science, page 1-12. Springer, (1995)Optimal VLSI architectures for multidimensional DFT (preliminary version)., , and . SIGARCH Comput. Archit. News, 19 (1): 45-52 (1991)The I/O Complexity of Strassen's Matrix Multiplication with Recomputation., and . WADS, volume 10389 of Lecture Notes in Computer Science, page 181-192. Springer, (2017)