The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bruno Codenotti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  52. On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis. [Citation Graph (, )][DBLP]


  53. An optimal multiprocessor combinatorial auction solver. [Citation Graph (, )][DBLP]


  54. An experimental analysis of Lemke-Howson algorithm [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002