Bruno Codenotti
About
In The Last Decade
Bruno Codenotti
67 papers receiving 2.3k citations
Hit Papers
Peers
Comparison fields: 5 of 106
- Management Science and Operations Research 906
- Computer Networks and Communications 780
- Artificial Intelligence 526
- Information Systems 464
- Economics and Econometrics 420
Countries citing papers authored by Bruno Codenotti
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | Algorithmic Game Theory breakdown → | 1422 |
| 2 | 39 | |
| 3 | Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games. | 1 |
| 4 | 35 | |
| 5 | Computation of the Lovász Theta Function for Circulant Graphs | 1 |
| 6 | Some remarks on the Shannon capacity of odd cycles. | 9 |
| 7 | Non-approximability of the Permanent of Structured Matrices over Finite Fields | 2 |
| 8 | On Boolean Functions associated to Bipartite Cayley Graphs | 1 |
| 9 | 5 | |
| 10 | 9 | |
| 11 | 1 | |
| 12 | 8 | |
| 13 | 34 | |
| 14 | 15 | |
| 15 | On the Amount of Randomness Needed in Distributed Computations. | 3 |
| 16 | 5 | |
| 17 | 1 | |
| 18 | 1 | |
| 19 | 18 | |
| 20 | Error analysis of some approximating algorithms | 1 |
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.