Gianfranco Bilardi

2.5k total citations · 1 hit paper
74 papers, 1.2k citations indexed

About

Gianfranco Bilardi is a scholar working on Computer Networks and Communications, Hardware and Architecture and Artificial Intelligence. According to data from OpenAlex, Gianfranco Bilardi has authored 74 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computer Networks and Communications, 31 papers in Hardware and Architecture and 29 papers in Artificial Intelligence. Recurrent topics in Gianfranco Bilardi's work include Interconnection Networks and Systems (24 papers), Parallel Computing and Optimization Techniques (24 papers) and Algorithms and Data Compression (16 papers). Gianfranco Bilardi is often cited by papers focused on Interconnection Networks and Systems (24 papers), Parallel Computing and Optimization Techniques (24 papers) and Algorithms and Data Compression (16 papers). Gianfranco Bilardi collaborates with scholars based in United States, Italy and Germany. Gianfranco Bilardi's co-authors include Geppino Pucci, F. P. Preparata, Keshav Pingali, Alexandru Nicolau, Franco P. Preparata, Kieran T. Herley, Andrea Pietracaprina, G. Pierobon, R. Padovani and Pratap Pattnaik and has published in prestigious journals such as IEEE Journal of Solid-State Circuits, International Journal for Numerical Methods in Engineering and Journal of the ACM.

In The Last Decade

Gianfranco Bilardi

70 papers receiving 1.1k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Encyclopedia of Parallel Computing

2011 398 citations Gianfranco Bilardi, Geppino Pucci profile →

Peers

Countries citing papers authored by Gianfranco Bilardi

Since Specialization

Citations

This map shows the geographic impact of Gianfranco Bilardi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gianfranco Bilardi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gianfranco Bilardi more than expected).

Fields of papers citing papers by Gianfranco Bilardi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gianfranco Bilardi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gianfranco Bilardi. The network helps show where Gianfranco Bilardi may publish in the future.

Co-authorship network of co-authors of Gianfranco Bilardi

This figure shows the co-authorship network connecting the top 25 collaborators of Gianfranco Bilardi. A scholar is included among the top collaborators of Gianfranco Bilardi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gianfranco Bilardi. Gianfranco Bilardi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	FlexSEE 2023 ·Research Padua Archive (University of Padua) ·José E. Moreira, (unknown), (unknown), (unknown), Joefon Jann, Pratap Pattnaik, Gianfranco Bilardi, (unknown), Henry M. Tufo	1
2	Derivative grammars: a symbolic approach to parsing with derivatives 2019 ·Proceedings of the ACM on Programming Languages ·Ian Henriksen, Gianfranco Bilardi, Keshav Pingali	4
3	Optimal eviction policies for stochastic address traces 2013 ·Theoretical Computer Science ·Gianfranco Bilardi, (unknown)	1
4	An Optimal Stack Policy for Paging with Stochastic Inputs 2011 ·arXiv (Cornell University) ·Gianfranco Bilardi, (unknown)	1
5	GENERALIZED DOMINANCE and CONTROL DEPENDENCE 2007 ·Gianfranco Bilardi, Keshav Pingali	0
6	The role of terminal cost/reward in finite-horizon discrete-time LQ optimal control 2007 ·Linear Algebra and its Applications ·Gianfranco Bilardi, Augusto Ferrante	7
7	Network-Oblivious Algorithms 2007 ·Research Padua Archive (University of Padua) ·Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri	11
8	Models for parallel and hierarchical computation 2007 ·Gianfranco Bilardi	1
9	A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing 1999 ·Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci	10
10	Algorithms — ESA’ 98 1998 ·Lecture notes in computer science ·Gianfranco Bilardi, Geppino Pucci	6
11	Optimal control dependence computation and the Roman chariots problem 1997 ·ACM Transactions on Programming Languages and Systems ·Keshav Pingali, Gianfranco Bilardi	35
12	Area-time lower-bound techniques with applications to sorting 1986 ·Algorithmica ·Gianfranco Bilardi, F. P. Preparata	21
13	Area-time lower-bound techniques with application to sorting 1985 ·IDEALS (University of Illinois Urbana-Champaign) ·Gianfranco Bilardi, F. P. Preparata	1
14	The VLSI optimality of the aks sorting network 1985 ·Information Processing Letters ·Gianfranco Bilardi, F. P. Preparata	11
15	Spectral analysis of the powers of a PAM digital signal 1984 ·Research Padua Archive (University of Padua) ·Gianfranco Bilardi, Silvano Pupolin	9
16	The Area-Time Complexity of Sorting 1984 ·Defense Technical Information Center (DTIC) ·Gianfranco Bilardi	10
17	Permutation-exchange graphs that emulate the binary cube 1984 ·Theory of Computing Systems ·Gianfranco Bilardi, Xiaolong Jin	1
18	A minimum area VLSI network for O(logn) time sorting 1984 ·Gianfranco Bilardi, F. P. Preparata	10
19	A Minimum Area VLSI Architecture for O(logn) Time Sorting 1983 ·IDEALS (University of Illinois Urbana-Champaign) ·Gianfranco Bilardi, F. P. Preparata	3
20	Average Case Analysis of an Adjacency Map Searching Technique. 1981 ·Defense Technical Information Center (DTIC) ·Gianfranco Bilardi	2

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact