Bruno Codenotti

Publication Activity (10 Years)

Years Active: 1985-2011
Publications (10 Years): 0

Publications

Bruno Codenotti
Computational Game Theory. SAGT (2011)
Michele Budinich, Bruno Codenotti, Filippo Geraci, Marco Pellegrini
On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis. EC-Web (2010)
Shouxi Yang, Alberto Maria Segre, Bruno Codenotti
An optimal multiprocessor combinatorial auction solver. Comput. Oper. Res. 36 (1) (2009)
Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
The complexity of equilibria: Hardness results for economies via a correspondence with games. Theor. Comput. Sci. 408 (2-3) (2008)
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An experimental study of different approaches to solve the market equilibrium problem. ACM J. Exp. Algorithmics 12 (2008)
Bruno Codenotti, Stefano De Rossi, Marino Pagan
An experimental analysis of Lemke-Howson algorithm CoRR (2008)
Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
Leontief economies encode nonzero sum two-player games. SODA (2006)
Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan
Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) (2006)
Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. ESA (2006)
Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games. Electron. Colloquium Comput. Complex. (012) (2006)
Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. FSTTCS (2005)
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO (2005)
Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
On the polynomial time computation of equilibria for certain exchange economies. SODA (2005)
Bruno Codenotti, Daniel Stefankovic
On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Inf. Process. Lett. 94 (3) (2005)
Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan
Market equilibrium via the excess demand function. STOC (2005)
Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
Leontief Economies Encode Nonzero Sum Two-Player Games Electron. Colloquium Comput. Complex. (055) (2005)
Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan
Computing Equilibrium Prices: Does Theory Meet Practice?. ESA (2005)
Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna
UbiCrawler: a scalable fully distributed Web crawler. Softw. Pract. Exp. 34 (8) (2004)
Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini
Approximation algorithms for a hierarchically structured bin packing problem. Inf. Process. Lett. 89 (5) (2004)
Bruno Codenotti, Kasturi R. Varadarajan
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. ICALP (2004)
Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
The computation of market equilibria. SIGACT News 35 (4) (2004)
Anna Bernasconi, Bruno Codenotti
Spectral Analysis of Symmetric Threshold Functions. J. Multiple Valued Log. Soft Comput. 10 (2) (2004)
Bruno Codenotti, Ivan Gerace, Giovanni Resta
Some remarks on the Shannon capacity of odd cycles. Ars Comb. 66 (2003)
Andrea Bonaccorsi, Bruno Codenotti, Nicola Dimitri, Mauro Leoncini, Giovanni Resta, Paolo Santi
Generating Realistic Data Sets for Combinatorial Auctions. CEC (2003)
Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini
Computation of the Lovász Theta Function for Circulant Graphs Electron. Colloquium Comput. Complex. (081) (2003)
Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof
On the hardness of approximating the permanent of structured matrices. Comput. Complex. 11 (3-4) (2002)
Bruno Codenotti, Igor E. Shparlinski
Non-approximability of the Permanent of Structured Matrices over Finite Fields Electron. Colloquium Comput. Complex. (071) (2002)
Bruno Codenotti, Mauro Leoncini, Franco P. Preparata
The Role of Arithmetic in Fast Parallel Matrix Inversion. Algorithmica 30 (4) (2001)
Anna Bernasconi, Bruno Codenotti, Jeffrey M. Vanderkam
A Characterization of Bent Functions in Terms of Strongly Regular Graphs. IEEE Trans. Computers 50 (9) (2001)
Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero
Distributed Algorithm for Certain Assignment Problems. OPODIS (2001)
Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna
Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters (2001)
Bruno Codenotti, Pavel Pudlák, Giovanni Resta
Some structural properties of low-rank matrices related to computational complexity. Theor. Comput. Sci. 235 (1) (2000)
Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
On the Lovász Number of Certain Circulant Graphs. CIAC (2000)
Anna Bernasconi, Bruno Codenotti
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. IEEE Trans. Computers 48 (3) (1999)
Bruno Codenotti, G. Mariotti, S. Pedinotti, Giovanni Resta
Parallel Implementation of a Discontinuous Finite Element Method for the Solution of the Navier-Stokes Equations. Parallel CFD (1997)
Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar
Checking Properties of Polynomials (Extended Abstract). ICALP (1997)
Gianfranco Bilardi, Bruno Codenotti, G. Del Corso, Maria Cristina Pinotti, Giovanni Resta
Broadcast and Associative Operations on Fat-Trees. Euro-Par (1997)
Bruno Codenotti, Pavel Pudlák, Giovanni Resta
Some structural properties of low rank matrices related to computational complexity Electron. Colloquium Comput. Complex. 4 (43) (1997)
Ilan Bar-On, Bruno Codenotti, Mauro Leoncini
A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices. SIAM J. Matrix Anal. Appl. 18 (2) (1997)
Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta
Computing Groebner Bases in the Boolean Setting with Applications to Counting. WAE (1997)
Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon
On the Amount of Randomness Needed in Distributed Computations. OPODIS (1997)
Bruno Codenotti, Biswa N. Datta, Karabi Datta, Mauro Leoncini
Parallel Algorithms for Certain Matrix Computations. Theor. Comput. Sci. 180 (1-2) (1997)
Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165 (2) (1996)
Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP. INFORMS J. Comput. 8 (2) (1996)
Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS (1996)
Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
Self-Correcting for Function Fields Transcendental Degree. ICALP (1995)
Bruno Codenotti, Giovanni Manzini, Luciano Margara
Algebraic Techniques in Communication Complexity. Inf. Process. Lett. 56 (4) (1995)
Bruno Codenotti, Peter Gemmell, Janos Simon
Average Circuit Depth and Average Communication Complexity. ESA (1995)
Anna Bernasconi, Bruno Codenotti
Measures of Boolean Function Complexity Based on Harmonic Analysis. CIAC (1994)
Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Oracle Computations in Parallel Numerical Linear Algebra. Theor. Comput. Sci. 127 (1) (1994)
Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta
Global Strategies for Augmenting the Efficiency of TSP Heuristics. WADS (1993)
Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell
Checking approximate computations over the reals. STOC (1993)
Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Repeated Matrix Squaring for the Parallel Solution of Linear Systems. PARLE (1992)
Bruno Codenotti, Roberto Tamassia
A Network Flow Approach to the Reconfiguration of VLSI Arrays. IEEE Trans. Computers 40 (1) (1991)
Bruno Codenotti, Mauro Leoncini
. J. Complex. 7 (3) (1991)
Jill David, Fillia Makedon, Bruno Codenotti, Mauro Leoncini
An experimental environment for design and analysis of global routing heuristics. Great Lakes Symposium on VLSI (1991)
Bruno Codenotti, Grazia Lotti, Francesco Romani
Area-Time Trade-Offs for Matrix-Vector Multiplication. J. Parallel Distributed Comput. 8 (1) (1990)
Bruno Codenotti, Franco Flandoli
A Monte Carlo method for the parallel solution of linear systems. J. Complex. 5 (1) (1989)
Bruno Codenotti, Claudio Montani
Visualizing A Channel Router: An Experimental Study. ICCAL (1989)
Bruno Codenotti, Roberto Tamassia
Efficient Reconfiguration of VLSI Arrays. AWOC (1988)
Bruno Codenotti, Francesco Romani
A compact and modular VLSI design for the solution of general sparse linear systems. Integr. 5 (1) (1987)
Bruno Codenotti, Grazia Lotti
A Note on the VLSI Counter. Inf. Process. Lett. 22 (4) (1986)
Bruno Codenotti, Grazia Lotti
A VLSI Fast Solver for Tridiagonal Linear Systems. Inf. Process. Lett. 23 (3) (1986)
Bruno Codenotti, Grazia Lotti
Area-Time Tradeoffs for Bilinear Forms Computations in VLSI. Inf. Process. Lett. 23 (2) (1986)
Bruno Codenotti, Francesco Romani, Grazia Lotti
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. Inf. Process. Lett. 21 (3) (1985)
Bruno Codenotti, Francesco Romani, Grazia Lotti
VLSI implementation of iterative methods for the solution of linear systems. Integr. 3 (3) (1985)