| 2009 |
|---|
| 56 | EE | Shouxi Yang,
Alberto Maria Segre,
Bruno Codenotti:
An optimal multiprocessor combinatorial auction solver.
Computers & OR 36(1): 149-166 (2009) |
| 2008 |
|---|
| 55 | EE | 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 Journal of Experimental Algorithmics 12: (2008) |
| 54 | EE | Bruno Codenotti,
Stefano De Rossi,
Marino Pagan:
An experimental analysis of Lemke-Howson algorithm
CoRR abs/0811.3247: (2008) |
| 53 | EE | 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): 188-198 (2008) |
| 2006 |
|---|
| 52 | EE | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.
ESA 2006: 232-243 |
| 51 | EE | Bruno Codenotti,
Luis Rademacher,
Kasturi R. Varadarajan:
Computing Equilibrium Prices in Exchange Economies with Tax Distortions.
ICALP (1) 2006: 584-595 |
| 50 | EE | Bruno Codenotti,
Amin Saberi,
Kasturi R. Varadarajan,
Yinyu Ye:
Leontief economies encode nonzero sum two-player games.
SODA 2006: 659-667 |
| 49 | EE | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games
Electronic Colloquium on Computational Complexity (ECCC)(012): (2006) |
| 2005 |
|---|
| 48 | EE | 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: 167-179 |
| 47 | EE | Bruno Codenotti,
Benton McCune,
Rajiv Raman,
Kasturi R. Varadarajan:
Computing Equilibrium Prices: Does Theory Meet Practice?.
ESA 2005: 83-94 |
| 46 | EE | Bruno Codenotti,
Benton McCune,
Sriram Penumatcha,
Kasturi R. Varadarajan:
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation.
FSTTCS 2005: 505-516 |
| 45 | EE | Bruno Codenotti,
Sriram V. Pemmaraju,
Kasturi R. Varadarajan:
On the polynomial time computation of equilibria for certain exchange economies.
SODA 2005: 72-81 |
| 44 | EE | Bruno Codenotti,
Benton McCune,
Kasturi R. Varadarajan:
Market equilibrium via the excess demand function.
STOC 2005: 74-83 |
| 43 | EE | Bruno Codenotti,
Amin Saberi,
Kasturi R. Varadarajan,
Yinyu Ye:
Leontief Economies Encode Nonzero Sum Two-Player Games
Electronic Colloquium on Computational Complexity (ECCC)(055): (2005) |
| 42 | EE | Bruno Codenotti,
Daniel Stefankovic:
On the computational complexity of Nash equilibria for (0, 1) bimatrix games.
Inf. Process. Lett. 94(3): 145-150 (2005) |
| 2004 |
|---|
| 41 | EE | Bruno Codenotti,
Kasturi R. Varadarajan:
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities.
ICALP 2004: 371-382 |
| 40 | EE | 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): 215-221 (2004) |
| 39 | EE | Bruno Codenotti,
Sriram V. Pemmaraju,
Kasturi R. Varadarajan:
The computation of market equilibria.
SIGACT News 35(4): 23-37 (2004) |
| 38 | EE | Paolo Boldi,
Bruno Codenotti,
Massimo Santini,
Sebastiano Vigna:
UbiCrawler: a scalable fully distributed Web crawler.
Softw., Pract. Exper. 34(8): 711-726 (2004) |
| 2003 |
|---|
| 37 | EE | Andrea Bonaccorsi,
Bruno Codenotti,
Nicola Dimitri,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Generating Realistic Data Sets for Combinatorial Auctions.
CEC 2003: 331-338 |
| 36 | | Bruno Codenotti,
Ivan Gerace,
Giovanni Resta:
Some remarks on the Shannon capacity of odd cycles.
Ars Comb. 66: (2003) |
| 35 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Valentino Crespi,
Reneta P. Barneva,
Mauro Leoncini:
Computation of the Lovász Theta Function for Circulant Graphs
Electronic Colloquium on Computational Complexity (ECCC)(081): (2003) |
| 2002 |
|---|
| 34 | EE | Bruno Codenotti,
Igor Shparlinski,
Arne Winterhof:
On the hardness of approximating the permanent of structured matrices.
Computational Complexity 11(3-4): 158-170 (2002) |
| 33 | EE | Bruno Codenotti,
Igor Shparlinski:
Non-approximability of the Permanent of Structured Matrices over Finite Fields
Electronic Colloquium on Computational Complexity (ECCC)(071): (2002) |
| 2001 |
|---|
| 32 | | Bruno Codenotti,
Gianluca De Marco,
Mauro Leoncini,
Manuela Montangero:
Distributed Algorithm for Certain Assignment Problems.
OPODIS 2001: 91-112 |
| 31 | EE | Paolo Boldi,
Bruno Codenotti,
Massimo Santini,
Sebastiano Vigna:
Trovatore: Towards a Highly Scalable Distributed Web Crawler.
WWW Posters 2001 |
| 30 | EE | Bruno Codenotti,
Mauro Leoncini,
Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion.
Algorithmica 30(4): 685-707 (2001) |
| 29 | EE | Anna Bernasconi,
Bruno Codenotti,
Jeffrey M. Vanderkam:
A Characterization of Bent Functions in Terms of Strongly Regular Graphs.
IEEE Trans. Computers 50(9): 984-985 (2001) |
| 2000 |
|---|
| 28 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Valentino Crespi,
Mauro Leoncini:
On the Lovász Number of Certain Circulant Graphs.
CIAC 2000: 291-305 |
| 27 | EE | Bruno Codenotti,
Pavel Pudlák,
Giovanni Resta:
Some structural properties of low-rank matrices related to computational complexity.
Theor. Comput. Sci. 235(1): 89-107 (2000) |
| 1999 |
|---|
| 26 | | Anna Bernasconi,
Bruno Codenotti:
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem.
IEEE Trans. Computers 48(3): 345-351 (1999) |
| 1997 |
|---|
| 25 | | Gianfranco Bilardi,
Bruno Codenotti,
G. Del Corso,
Maria Cristina Pinotti,
Giovanni Resta:
Broadcast and Associative Operations on Fat-Trees.
Euro-Par 1997: 196-207 |
| 24 | | Bruno Codenotti,
Funda Ergün,
Peter Gemmell,
Ravi Kumar:
Checking Properties of Polynomials (Extended Abstract).
ICALP 1997: 203-213 |
| 23 | | Bruno Codenotti,
Peter Gemmell,
Petr Pudlak,
Janos Simon:
On the Amount of Randomness Needed in Distributed Computations.
OPODIS 1997: 237-248 |
| 22 | EE | Bruno Codenotti,
Pavel Pudlák,
Giovanni Resta:
Some structural properties of low rank matrices related to computational complexity
Electronic Colloquium on Computational Complexity (ECCC) 4(43): (1997) |
| 21 | EE | Bruno Codenotti,
Biswa N. Datta,
Karabi Datta,
Mauro Leoncini:
Parallel Algorithms for Certain Matrix Computations.
Theor. Comput. Sci. 180(1-2): 287-308 (1997) |
| 1996 |
|---|
| 20 | | Paolo Boldi,
Shella Shammah,
Sebastiano Vigna,
Bruno Codenotti,
Peter Gemmell,
Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations.
ISTCS 1996: 16-26 |
| 19 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem.
Theor. Comput. Sci. 165(2): 483-490 (1996) |
| 1995 |
|---|
| 18 | | Bruno Codenotti,
Peter Gemmell,
Janos Simon:
Average Circuit Depth and Average Communication Complexity.
ESA 1995: 102-112 |
| 17 | | Manuel Blum,
Bruno Codenotti,
Peter Gemmell,
Troy Shahoumian:
Self-Correcting for Function Fields Transcendental Degree.
ICALP 1995: 547-557 |
| 16 | EE | Bruno Codenotti,
Giovanni Manzini,
Luciano Margara:
Algebraic Techniques in Communication Complexity.
Inf. Process. Lett. 56(4): 191-195 (1995) |
| 1994 |
|---|
| 15 | | Anna Bernasconi,
Bruno Codenotti:
Measures of Boolean Function Complexity Based on Harmonic Analysis.
CIAC 1994: 63-72 |
| 14 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra.
Theor. Comput. Sci. 127(1): 99-121 (1994) |
| 1993 |
|---|
| 13 | EE | Sigal Ar,
Manuel Blum,
Bruno Codenotti,
Peter Gemmell:
Checking approximate computations over the reals.
STOC 1993: 786-795 |
| 12 | | Bruno Codenotti,
Giovanni Manzini,
Luciano Margara,
Giovanni Resta:
Global Strategies for Augmenting the Efficiency of TSP Heuristics.
WADS 1993: 253-264 |
| 1992 |
|---|
| 11 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Repeated Matrix Squaring for the Parallel Solution of Linear Systems.
PARLE 1992: 725-732 |
| 1991 |
|---|
| 10 | | Bruno Codenotti,
Roberto Tamassia:
A Network Flow Approach to the Reconfiguration of VLSI Arrays.
IEEE Trans. Computers 40(1): 118-121 (1991) |
| 9 | EE | Bruno Codenotti,
Mauro Leoncini:
Matrix inversion in RNC1.
J. Complexity 7(3): 282-295 (1991) |
| 1990 |
|---|
| 8 | | Bruno Codenotti,
Grazia Lotti,
Francesco Romani:
Area-Time Trade-Offs for Matrix-Vector Multiplication.
J. Parallel Distrib. Comput. 8(1): 52-59 (1990) |
| 1989 |
|---|
| 7 | | Bruno Codenotti,
Claudio Montani:
Visualizing A Channel Router: An Experimental Study.
ICCAL 1989: 38-52 |
| 6 | EE | Bruno Codenotti,
Franco Flandoli:
A Monte Carlo method for the parallel solution of linear systems.
J. Complexity 5(1): 107-117 (1989) |
| 1988 |
|---|
| 5 | | Bruno Codenotti,
Roberto Tamassia:
Efficient Reconfiguration of VLSI Arrays.
AWOC 1988: 191-200 |
| 1986 |
|---|
| 4 | | Bruno Codenotti,
Grazia Lotti:
A Note on the VLSI Counter.
Inf. Process. Lett. 22(4): 193-195 (1986) |
| 3 | | Bruno Codenotti,
Grazia Lotti:
Area-Time Tradeoffs for Bilinear Forms Computations in VLSI.
Inf. Process. Lett. 23(2): 107-109 (1986) |
| 2 | | Bruno Codenotti,
Grazia Lotti:
A VLSI Fast Solver for Tridiagonal Linear Systems.
Inf. Process. Lett. 23(3): 111-114 (1986) |
| 1985 |
|---|
| 1 | | Bruno Codenotti,
Francesco Romani,
Grazia Lotti:
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix.
Inf. Process. Lett. 21(3): 159-163 (1985) |
