Ubicrawler: A scalable fully distributed web crawler P Boldi, B Codenotti, M Santini, S Vigna Software: Practice and Experience 34 (8), 711-726, 2004 | 664 | 2004 |

Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP B Codenotti, G Manzini, L Margara, G Resta INFORMS Journal on Computing 8 (2), 125-133, 1996 | 106 | 1996 |

Symmetry Breaking in Anonymous Networks: Characterizations. P Boldi, S Shammah, S Vigna, B Codenotti, P Gemmell, J Simon ISTCS, 16-26, 1996 | 102 | 1996 |

Spectral analysis of Boolean functions as a graph eigenvalue problem A Bernasconi, B Codenotti IEEE transactions on computers 48 (3), 345-351, 1999 | 92 | 1999 |

Market equilibrium via the excess demand function B Codenotti, B McCune, K Varadarajan Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 86 | 2005 |

Leontief economies encode nonzero sum two-player games B Codenotti, A Saberi, K Varadarajan, Y Ye Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 76 | 2006 |

Efficient computation of equilibrium prices for markets with Leontief utilities B Codenotti, K Varadarajan International Colloquium on Automata, Languages, and Programming, 371-382, 2004 | 74 | 2004 |

On the polynomial time computation of equilibria for certain exchange economies B Codenotti, SV Pemmaraju, KR Varadarajan SODA 5, 72-81, 2005 | 72 | 2005 |

Transitive cellular automata are sensitive B Codenotti, L Margara The American Mathematical Monthly 103 (1), 58-62, 1996 | 66 | 1996 |

Structural properties of the African web P Boldi, B Codenotti, M Santini, S Vigna The Eleventh International WWW Conference 66, 2002 | 56 | 2002 |

Hardness results and spectral techniques for combinatorial problems on circulant graphs B Codenotti, I Gerace, S Vigna Linear Algebra and its Applications 285 (1), 123-142, 1998 | 56 | 1998 |

Introduction to parallel processing B Codenotti, M Leoncini Addison-Wesley Longman Publishing Co., 1992 | 52 | 1992 |

A characterization of bent functions in terms of strongly regular graphs A Bernasconi, B Codenottl, JM Vanderkam IEEE Transactions on Computers 50 (9), 984-985, 2001 | 50 | 2001 |

Checking approximate computations over the reals S Ar, M Blum, B Codenotti, P Gemmell Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 50 | 1993 |

The Padé method for computing the matrix exponential M Arioli, B Codenotti, C Fassino Linear algebra and its applications 240, 111-130, 1996 | 49 | 1996 |

Some structural properties of low-rank matrices related to computational complexity B Codenotti, P Pudlák, G Resta Theoretical Computer Science 235 (1), 89-107, 2000 | 46 | 2000 |

Local properties of some NP-complete problems B Codenotti, L Margara International Computer Science Institute, 1992 | 46 | 1992 |

On the computational complexity of Nash equilibria for (0, 1) bimatrix games B Codenotti, D Štefankovič Information Processing Letters 94 (3), 145-150, 2005 | 39 | 2005 |

The computation of market equilibria B Codenotti, S Pemmaraju, K Varadarajan Acm Sigact News 35 (4), 23-37, 2004 | 39 | 2004 |

Parallel solution of block tridiagonal linear systems R Bevilacqua, B Codenotti, F Romani Linear Algebra and its Applications 104, 39-57, 1988 | 39 | 1988 |