Bruno Codenotti

4.3k total citations · 1 hit paper
71 papers, 2.4k citations indexed

About

Bruno Codenotti is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Numerical Analysis. According to data from OpenAlex, Bruno Codenotti has authored 71 papers receiving a total of 2.4k indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 18 papers in Electrical and Electronic Engineering and 16 papers in Numerical Analysis. Recurrent topics in Bruno Codenotti's work include Matrix Theory and Algorithms (26 papers), Advanced Optimization Algorithms Research (14 papers) and Game Theory and Applications (11 papers). Bruno Codenotti is often cited by papers focused on Matrix Theory and Algorithms (26 papers), Advanced Optimization Algorithms Research (14 papers) and Game Theory and Applications (11 papers). Bruno Codenotti collaborates with scholars based in Italy, United States and Israel. Bruno Codenotti's co-authors include Noam Nisan, Éva Tardos, Tim Roughgarden, Christos H. Papadimitriou, Sebastiano Vigna, Paolo Boldi, Massimo Santini, James Schummer, Kamal Jain and Yevgeniy Dodis and has published in prestigious journals such as IEEE Transactions on Automatic Control, IEEE Transactions on Computers and Computers & Operations Research.

In The Last Decade

Bruno Codenotti

67 papers receiving 2.3k citations

Hit Papers

Algorithmic Game Theory 2007 2026 2013 2019 2007 400 800 1.2k
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.

  1. Algorithmic Game Theory
    2007 1.4k citations Noam Nisan, Noam Nisan et al. Cambridge University Press eBooks profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Bruno Codenotti 906 780 526 464 420 71 2.4k
Berthold Vöcking 1.4k 1.6× 1.4k 1.8× 532 1.0× 307 0.7× 627 1.5× 91 3.1k
Bernhard von Stengel 1.4k 1.5× 627 0.8× 592 1.1× 247 0.5× 701 1.7× 44 2.4k
Ηλίας Κουτσουπιάς 956 1.1× 972 1.2× 219 0.4× 203 0.4× 414 1.0× 71 1.9k
Kamesh Munagala 499 0.6× 1.7k 2.2× 531 1.0× 372 0.8× 100 0.2× 98 2.6k
Yevgeniy Dodis 953 1.1× 977 1.3× 1.5k 2.9× 952 2.1× 414 1.0× 70 3.8k
Stefano Leonardi 477 0.5× 875 1.1× 759 1.4× 720 1.6× 150 0.4× 116 2.5k
Yossi Azar 972 1.1× 3.0k 3.8× 626 1.2× 394 0.8× 263 0.6× 152 4.2k
Nicole Immorlica 1.1k 1.3× 989 1.3× 866 1.6× 374 0.8× 423 1.0× 99 3.9k
John N. Tsitsiklis 446 0.5× 1.2k 1.5× 476 0.9× 109 0.2× 147 0.3× 39 3.1k
Chaitanya Swamy 539 0.6× 656 0.8× 300 0.6× 113 0.2× 213 0.5× 57 1.6k

Countries citing papers authored by Bruno Codenotti

Since Specialization
Citations

This map shows the geographic impact of Bruno Codenotti'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 Bruno Codenotti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bruno Codenotti more than expected).

Fields of papers citing papers by Bruno Codenotti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bruno Codenotti. 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 Bruno Codenotti. The network helps show where Bruno Codenotti may publish in the future.

Co-authorship network of co-authors of Bruno Codenotti

This figure shows the co-authorship network connecting the top 25 collaborators of Bruno Codenotti. A scholar is included among the top collaborators of Bruno Codenotti 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 Bruno Codenotti. Bruno Codenotti is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Nisan, Noam, Noam Nisan, Christos H. Papadimitriou, et al.. (2007). Algorithmic Game Theory. Cambridge University Press eBooks. 1422 indexed citations breakdown →
2.
Codenotti, Bruno, Mauro Leoncini, & Giovanni Resta. (2006). Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games.. Iris Unimore (University of Modena and Reggio Emilia). 1 indexed citations
3.
Codenotti, Bruno, Amin Saberi, Kasturi Varadarajan, & Yinyu Ye. (2006). Leontief economies encode nonzero sum two-player games. Symposium on Discrete Algorithms. 659–667. 39 indexed citations
4.
Codenotti, Bruno, Sriram V. Pemmaraju, & Kasturi Varadarajan. (2005). On the polynomial time computation of equilibria for certain exchange economies. Symposium on Discrete Algorithms. 72–81. 35 indexed citations
5.
Brimkov, Valentin E., Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, & Mauro Leoncini. (2003). Computation of the Lovász Theta Function for Circulant Graphs. IRIS UNIMORE (University of Modena and Reggio Emilia). 1 indexed citations
6.
Codenotti, Bruno, et al.. (2003). Some remarks on the Shannon capacity of odd cycles.. Ars Combinatoria. 66. 9 indexed citations
7.
Codenotti, Bruno & Igor E. Shparlinski. (2002). Non-approximability of the Permanent of Structured Matrices over Finite Fields. Electronic colloquium on computational complexity. 2 indexed citations
8.
Bernasconi, Anna & Bruno Codenotti. (2000). On Boolean Functions associated to Bipartite Cayley Graphs. CINECA IRIS Institutial research information system (University of Pisa). 64(5-6). 167–174. 1 indexed citations
9.
Codenotti, Bruno, Pavel Pudlák, & Giovanni Resta. (2000). Some structural properties of low-rank matrices related to computational complexity. Theoretical Computer Science. 235(1). 89–107. 1 indexed citations
10.
Codenotti, Bruno. (2000). Matrix rigidity. Linear Algebra and its Applications. 304(1-3). 181–192. 5 indexed citations
11.
Codenotti, Bruno, Gianna M. Del Corso, & Giovanni Manzini. (2000). Matrix rank and communication complexity. Linear Algebra and its Applications. 304(1-3). 193–200. 9 indexed citations
12.
Bernasconi, Anna, Bruno Codenotti, Valentino Crespi, & Giovanni Resta. (1999). How fast can one compute the permanent of circulant matrices?. Linear Algebra and its Applications. 292(1-3). 15–37. 8 indexed citations
13.
Codenotti, Bruno, et al.. (1998). Hardness results and spectral techniques for combinatorial problems on circulant graphs. Linear Algebra and its Applications. 285(1-3). 123–142. 34 indexed citations
14.
Codenotti, Bruno, Valentino Crespi, & Giovanni Resta. (1997). On the permanent of certain (0, 1) Toeplitz matrices. Linear Algebra and its Applications. 267. 65–100. 15 indexed citations
15.
Arioli, M., et al.. (1996). The Padé method for computing the matrix exponential. Linear Algebra and its Applications. 240. 111–130. 30 indexed citations
16.
Codenotti, Bruno, et al.. (1995). A fast and stable parallel QR algorithm for symmetric tridiagonal matrices. Linear Algebra and its Applications. 220. 63–95. 5 indexed citations
17.
Codenotti, Bruno, et al.. (1991). Matrix inversion in RNC1. Journal of Complexity. 7(3). 282–295. 1 indexed citations
18.
Codenotti, Bruno. (1988). Fast parallel algorithms for matrix inversion and linear systems solution. Applied Mathematics Letters. 1(1). 33–36. 1 indexed citations
19.
Codenotti, Bruno, et al.. (1988). Parallel solution of block tridiagonal linear systems. Linear Algebra and its Applications. 104. 39–57. 18 indexed citations
20.
Codenotti, Bruno. (1986). Error analysis of some approximating algorithms. Portugaliae Mathematica. 43(1). 113–119. 1 indexed citations

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

Breakdown of academic impact, for papers by Berthold Vöcking Breakdown of academic impact, for papers by Bernhard von Stengel Breakdown of academic impact, for papers by Ηλίας Κουτσουπιάς Breakdown of academic impact, for papers by Kamesh Munagala Breakdown of academic impact, for papers by Yevgeniy Dodis Breakdown of academic impact, for papers by Stefano Leonardi Breakdown of academic impact, for papers by Yossi Azar Breakdown of academic impact, for papers by Nicole Immorlica Breakdown of academic impact, for papers by John N. Tsitsiklis Breakdown of academic impact, for papers by Chaitanya Swamy
Rankless by CCL
2026