| Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines G Bilardi, A Nicolau SIAM Journal on Computing 18 (2), 216-228, 1989 | 181 | 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 | 142* | 1996 |
| Horizons of parallel computation G Bilardi, FP Preparata Journal of Parallel and Distributed Computing 27 (2), 172-182, 1995 | 110 | 1995 |
| Algorithms for computing the static single assignment form G Bilardi, K Pingali Journal of the ACM (JACM) 50 (3), 375-425, 2003 | 84 | 2003 |
| Spectral analysis of functions of Markov chains with applications G Bilardi, R Padovani, G Pierobon IEEE Transactions on Communications 31 (7), 853-861, 1983 | 84 | 1983 |
| 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 | 82 | 1997 |
| 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 | 81 | 1982 |
| A critique and an appraisal of VLSI models of computation G Bilardi, M Pracchi, FP Preparata VLSI Systems and Computations, 81-88, 1981 | 76 | 1981 |
| A minimum area VLSI network for O (logn) time sorting G Bilardi, FP Preparata Proceedings of the sixteenth annual ACM symposium on Theory of computing, 64-70, 1984 | 71 | 1984 |
| 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 | 62 | 2003 |
| A framework for generalized control dependence G Bilardi, K Pingali Proceedings of the ACM SIGPLAN 1996 conference on Programming language …, 1996 | 60 | 1996 |
| Deterministic simulations of PRAMs on bounded degree networks KT Herley, G Bilardi SIAM Journal on Computing 23 (2), 276-292, 1994 | 58 | 1994 |
| Area-time lower-bound techniques with applications to sorting G Bilardi, FP Preparata Algorithmica 1, 65-91, 1986 | 48 | 1986 |
| 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 | 47 | 1999 |
| 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 | 45 | 2001 |
| Merging and sorting networks with the topology of the Omega network G Bilardi Cornell University, 1987 | 45 | 1987 |
| APT: A data structure for optimal control dependence computation K Pingali, G Bilardi Proceedings of the ACM SIGPLAN 1995 conference on Programming language …, 1995 | 40 | 1995 |
| An architecture for bitonic sorting with optimal VLSI performnance G Bilardi, FP Preparata IEEE transactions on computers 100 (7), 646-651, 1984 | 40 | 1984 |
| On the space and access complexity of computation DAGs G Bilardi, A Pietracaprina, P D’Alberto Graph-Theoretic Concepts in Computer Science: 26th International Workshop …, 2000 | 39 | 2000 |
| On the effectiveness of D-BSP as a bridging model of parallel computation G Bilardi, C Fantozzi, A Pietracaprina, G Pucci Computational Science-ICCS 2001: International Conference San Francisco, CA …, 2001 | 38 | 2001 |
