Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines G Bilardi, A Nicolau SIAM Journal on Computing 18 (2), 216-228, 1989 | 162 | 1989 |

BSP vs LogP G Bilardi, KT Herley, A Pietracaprina, G Pucci, P Spirakis Proceedings of the eighth annual ACM symposium on Parallel algorithms and …, 1996 | 134* | 1996 |

BSP vs LogP G Bilardi, KT Herley, A Pietracaprina, G Pucci, P Spirakis Proceedings of the eighth annual ACM symposium on Parallel algorithms and …, 1996 | 115 | 1996 |

Horizons of parallel computation G Bilardi, FP Preparata Journal of Parallel and Distributed Computing 27 (2), 172-182, 1995 | 101 | 1995 |

Spectral analysis of functions of Markov chains with applications G Bilardi, R Padovani, G Pierobon IEEE Transactions on Communications 31 (7), 853-861, 1983 | 77 | 1983 |

Algorithms for computing the static single assignment form G Bilardi, K Pingali Journal of the ACM (JACM) 50 (3), 375-425, 2003 | 74 | 2003 |

A critique and an appraisal of VLSI models of computation G Bilardi, M Pracchi, FP Preparata VLSI Systems and Computations, 81-88, 1981 | 72 | 1981 |

Optimal control dependence computation and the Roman chariots problem K Pingali, G Bilardi ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 462-491, 1997 | 69 | 1997 |

A minimum area VLSI network for O (log n) time sorting G Bilardi, FP Preparata IEEE Transactions on Computers 100 (4), 336-343, 1985 | 67 | 1985 |

A minimum area VLSI network for O (log n) time sorting G Bilardi, FP Preparata IEEE Transactions on Computers 100 (4), 336-343, 1985 | 67 | 1985 |

A critique of network speed in VLSI models of computation G Bilardi, M Pracchi, FP Preparata IEEE Journal of Solid-State Circuits 17 (4), 696-702, 1982 | 62 | 1982 |

A frontal solver tuned for fully coupled non‐linear hygro‐thermo‐mechanical problems M Bianco, G Bilardi, F Pesavento, G Pucci, BA Schrefler International Journal for Numerical Methods in Engineering 57 (13), 1801-1818, 2003 | 52 | 2003 |

Deterministic simulations of PRAMs on bounded degree networks KT Herley, G Bilardi SIAM Journal on Computing 23 (2), 276-292, 1994 | 51 | 1994 |

Area-time lower-bound techniques with applications to sorting G Bilardi, FP Preparata Algorithmica 1 (1-4), 65, 1986 | 47 | 1986 |

Area-time lower-bound techniques with applications to sorting G Bilardi, FP Preparata Algorithmica 1 (1-4), 65, 1986 | 47 | 1986 |

Area-time lower-bound techniques with applications to sorting G Bilardi, FP Preparata Algorithmica 1 (1-4), 65, 1986 | 47 | 1986 |

A framework for generalized control dependence G Bilardi, K Pingali Proceedings of the ACM SIGPLAN 1996 conference on Programming language …, 1996 | 44 | 1996 |

A characterization of temporal locality and its portability across memory hierarchies G Bilardi, E Peserico International Colloquium on Automata, Languages, and Programming, 128-139, 2001 | 43 | 2001 |

Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds G Bilardi, FP Preparata Theory of Computing Systems 32 (5), 531-559, 1999 | 43 | 1999 |

Merging and sorting networks with the topology of the Omega network G Bilardi Cornell University, 1987 | 40 | 1987 |