Gianfranco Bilardi
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.
Paul Bay and Gianfranco Bilardi.
Deterministic on-line routing on area-universal networks.
Journal of the ACM
, 42(3):614-640, May 1995.
Abstract, References, Citations, etc.
Shortcuts:
Journal of the ACM homepage
Bibliography top level
Journal of the ACM Author Index
Search the HBP database