VLSI implementation of iterative methods for the solution of linear systems. - Bruno Codenotti; Francesco Romani; Grazia Lotti (Integr., 1985)

VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. - Bruno Codenotti; Francesco Romani; Grazia Lotti (Inf. Process. Lett., 1985)

A Note on the VLSI Counter. - Bruno Codenotti; Grazia Lotti (Inf. Process. Lett., 1986)

Area-Time Tradeoffs for Bilinear Forms Computations in VLSI. - Bruno Codenotti; Grazia Lotti (Inf. Process. Lett., 1986)

A VLSI Fast Solver for Tridiagonal Linear Systems. - Bruno Codenotti; Grazia Lotti (Inf. Process. Lett., 1986)

A compact and modular VLSI design for the solution of general sparse linear systems. - Bruno Codenotti; Francesco Romani (Integr., 1987)

Efficient Reconfiguration of VLSI Arrays. - Bruno Codenotti; Roberto Tamassia (AWOC, 1988)

Visualizing A Channel Router: An Experimental Study. - Bruno Codenotti; Claudio Montani (ICCAL, 1989)

A Monte Carlo method for the parallel solution of linear systems. - Bruno Codenotti; Franco Flandoli (J. Complex., 1989)

Area-Time Trade-Offs for Matrix-Vector Multiplication. - Bruno Codenotti; Grazia Lotti; Francesco Romani (J. Parallel Distributed Comput., 1990)

Parallel complexity of linear system solution. - Bruno Codenotti; Mauro Leoncini (World Scientific, 1991)

An experimental environment for design and analysis of global routing heuristics. - Jill David; Fillia Makedon; Bruno Codenotti; Mauro Leoncini (Great Lakes Symposium on VLSI, 1991)

Matrix inversion in RNC1. - Bruno Codenotti; Mauro Leoncini (J. Complex., 1991)

A Network Flow Approach to the Reconfiguration of VLSI Arrays. - Bruno Codenotti; Roberto Tamassia (IEEE Trans. Computers, 1991)

Repeated Matrix Squaring for the Parallel Solution of Linear Systems. - Bruno Codenotti; Mauro Leoncini; Giovanni Resta (PARLE, 1992)

Introduction to parallel processing. - Bruno Codenotti; Mauro Leoncini (Addison-Wesley, 1993)

Checking approximate computations over the reals. - Sigal Ar; Manuel Blum 001; Bruno Codenotti; Peter Gemmell (STOC, 1993)

Global Strategies for Augmenting the Efficiency of TSP Heuristics. - Bruno Codenotti; Giovanni Manzini; Luciano Margara; Giovanni Resta (WADS, 1993)

Measures of Boolean Function Complexity Based on Harmonic Analysis. - Anna Bernasconi 001; Bruno Codenotti (CIAC, 1994)

Oracle Computations in Parallel Numerical Linear Algebra. - Bruno Codenotti; Mauro Leoncini; Giovanni Resta (Theor. Comput. Sci., 1994)

Average Circuit Depth and Average Communication Complexity. - Bruno Codenotti; Peter Gemmell; Janos Simon (ESA, 1995)

Self-Correcting for Function Fields Transcendental Degree. - Manuel Blum 001; Bruno Codenotti; Peter Gemmell; Troy Shahoumian (ICALP, 1995)

Algebraic Techniques in Communication Complexity. - Bruno Codenotti; Giovanni Manzini; Luciano Margara (Inf. Process. Lett., 1995)

Symmetry Breaking in Anonymous Networks: Characterizations. - Paolo Boldi; Shella Shammah; Sebastiano Vigna; Bruno Codenotti; Peter Gemmell; Janos Simon (ISTCS, 1996)

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP. - Bruno Codenotti; Giovanni Manzini; Luciano Margara; Giovanni Resta (INFORMS J. Comput., 1996)

Strong NP-Completeness of a Matrix Similarity Problem. - Valentin E. Brimkov; Bruno Codenotti; Mauro Leoncini; Giovanni Resta (Theor. Comput. Sci., 1996)

Broadcast and Associative Operations on Fat-Trees. - Gianfranco Bilardi; Bruno Codenotti; Gianna Maria Del Corso; Maria Cristina Pinotti; Giovanni Resta (Euro-Par, 1997)

Checking Properties of Polynomials (Extended Abstract). - Bruno Codenotti; Funda Ergün; Peter Gemmell; Ravi Kumar 001 (ICALP, 1997)

On the Amount of Randomness Needed in Distributed Computations. - Bruno Codenotti; Peter Gemmell; Petr Pudlák; Janos Simon (OPODIS, 1997)

Parallel Implementation of a Discontinuous Finite Element Method for the Solution of the Navier-Stokes Equations. - Bruno Codenotti; G. Mariotti; S. Pedinotti; Giovanni Resta (Parallel CFD, 1997)

Computing Groebner Bases in the Boolean Setting with Applications to Counting. - Anna Bernasconi 001; Bruno Codenotti; Valentino Crespi; Giovanni Resta (WAE, 1997)

Some structural properties of low rank matrices related to computational complexity - Bruno Codenotti; Pavel Pudlák; Giovanni Resta (Electron. Colloquium Comput. Complex., 1997)

Parallel Algorithms for Certain Matrix Computations. - Bruno Codenotti; Biswa N. Datta; Karabi Datta; Mauro Leoncini (Theor. Comput. Sci., 1997)

A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices. - Ilan Bar-On; Bruno Codenotti; Mauro Leoncini (SIAM J. Matrix Anal. Appl., 1997)

Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. - Anna Bernasconi 001; Bruno Codenotti (IEEE Trans. Computers, 1999)

On the Lovász Number of Certain Circulant Graphs. - Valentin E. Brimkov; Bruno Codenotti; Valentino Crespi; Mauro Leoncini (CIAC, 2000)

Distributed Algorithm for Certain Assignment Problems. - Bruno Codenotti; Gianluca De Marco; Mauro Leoncini; Manuela Montangero (OPODIS, 2001)

Trovatore: Towards a Highly Scalable Distributed Web Crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (WWW Posters, 2001)

The Role of Arithmetic in Fast Parallel Matrix Inversion. - Bruno Codenotti; Mauro Leoncini; Franco P. Preparata (Algorithmica, 2001)

A Characterization of Bent Functions in Terms of Strongly Regular Graphs. - Anna Bernasconi 001; Bruno Codenotti; Jeffrey M. Vanderkam (IEEE Trans. Computers, 2001)

On the hardness of approximating the permanent of structured matrices. - Bruno Codenotti; Igor E. Shparlinski; Arne Winterhof (Comput. Complex., 2002)

Non-approximability of the Permanent of Structured Matrices over Finite Fields - Bruno Codenotti; Igor E. Shparlinski (Electron. Colloquium Comput. Complex., 2002)

Generating Realistic Data Sets for Combinatorial Auctions. - Andrea Bonaccorsi; Bruno Codenotti; Nicola Dimitri; Mauro Leoncini; Giovanni Resta; Paolo Santi (CEC, 2003)

Some remarks on the Shannon capacity of odd cycles. - Bruno Codenotti; Ivan Gerace; Giovanni Resta (Ars Comb., 2003)

Computation of the Lovász Theta Function for Circulant Graphs - Valentin E. Brimkov; Bruno Codenotti; Valentino Crespi; Reneta P. Barneva; Mauro Leoncini (Electron. Colloquium Comput. Complex., 2003)

Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. - Bruno Codenotti; Kasturi R. Varadarajan (ICALP, 2004)

Approximation algorithms for a hierarchically structured bin packing problem. - Bruno Codenotti; Gianluca De Marco; Mauro Leoncini; Manuela Montangero; Massimo Santini 001 (Inf. Process. Lett., 2004)

Spectral Analysis of Symmetric Threshold Functions. - Anna Bernasconi 001; Bruno Codenotti (J. Multiple Valued Log. Soft Comput., 2004)

The computation of market equilibria. - Bruno Codenotti; Sriram V. Pemmaraju; Kasturi R. Varadarajan (SIGACT News, 2004)

UbiCrawler: a scalable fully distributed Web crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (Softw. Pract. Exp., 2004)

An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. - Bruno Codenotti; Benton McCune; Sriram V. Pemmaraju; Rajiv Raman 001; Kasturi R. Varadarajan (ALENEX/ANALCO, 2005)

Computing Equilibrium Prices: Does Theory Meet Practice?. - Bruno Codenotti; Benton McCune; Rajiv Raman 001; Kasturi R. Varadarajan (ESA, 2005)

Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. - Bruno Codenotti; Benton McCune; Sriram Penumatcha; Kasturi R. Varadarajan (FSTTCS, 2005)

On the polynomial time computation of equilibria for certain exchange economies. - Bruno Codenotti; Sriram V. Pemmaraju; Kasturi R. Varadarajan (SODA, 2005)

Market equilibrium via the excess demand function. - Bruno Codenotti; Benton McCune; Kasturi R. Varadarajan (STOC, 2005)

On the computational complexity of Nash equilibria for (0, 1) bimatrix games. - Bruno Codenotti; Daniel Stefankovic (Inf. Process. Lett., 2005)

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. - Bruno Codenotti; Mauro Leoncini; Giovanni Resta (ESA, 2006)

Computing Equilibrium Prices in Exchange Economies with Tax Distortions. - Bruno Codenotti; Luis Rademacher; Kasturi R. Varadarajan (ICALP (1), 2006)

Leontief economies encode nonzero sum two-player games. - Bruno Codenotti; Amin Saberi; Kasturi R. Varadarajan; Yinyu Ye 001 (SODA, 2006)

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games. - Bruno Codenotti; Mauro Leoncini; Giovanni Resta (Electron. Colloquium Comput. Complex., 2006)

An experimental analysis of Lemke-Howson algorithm - Bruno Codenotti; Stefano De Rossi; Marino Pagan (CoRR, 2008)

The complexity of equilibria: Hardness results for economies via a correspondence with games. - Bruno Codenotti; Amin Saberi; Kasturi R. Varadarajan; Yinyu Ye 001 (Theor. Comput. Sci., 2008)

An optimal multiprocessor combinatorial auction solver. - Shouxi Yang; Alberto Maria Segre; Bruno Codenotti (Comput. Oper. Res., 2009)

On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis. - Michele Budinich; Bruno Codenotti; Filippo Geraci; Marco Pellegrini 001 (EC-Web, 2010)

Computational Game Theory. - Bruno Codenotti (SAGT, 2011)