Codenotti, Bruno - Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche

• Almost all symmetric functions are as powerful as majority
• Matrix Rigidity Bruno Codenotti \Lambda
• Checking Approximate Computations over the S. Ar \Lambda M. Blum y B. Codenotti z P. Gemmell x
• Strong NPcompleteness of a Matrix Similarity Problem \Lambda
• On the Fourier Analysis of Boolean Functions
• On the amount of randomness needed in distributed computations B. Codenotti \Lambda P. Gemmell y P. Pudl'ak z J. Simon x
• Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
• Parallel Algorithms for Certain Matrix Computations
• On the Permanent of Certain Circulant Bruno Codenotti 1 and Giovanni Resta 1
• Some remarks on the Shannon capacity of odd Bruno Codenotti \Lambda Ivan Gerace y Giovanni Resta z
• On the Complexity of the Discrete Fourier Transform and Related Linear Transforms
• Checking Properties of Polynomials ? (Extended Abstract)
• An Optimal Multiprocessor Combinatorial Auction Solver Shouxi Yang Alberto Maria Segre Bruno Codenotti
• Market Equilibrium via the Excess Demand Function Bruno Codenotti1
• Computing Equilibrium Prices: Does Theory Meet Practice? Bruno Codenotti 1 Benton McCune 2 Rajiv Raman 2 Kasturi Varadarajan 2
• A Characterization of Bent Functions in terms of Strongly Regular Graphs
• On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games
• A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices \Lambda
• Algebraic Techniques in Communication Complexity \Lambda
• Symmetry Breaking in Anonymous Networks Bruno Codenotti \Lambda Peter Gemmell y Janos Simon z
• On the Permanent of Certain (0; 1) Toeplitz Matrices Bruno Codenotti a , Valentino Crespi b;1 and Giovanni Resta a
• Matrix Rank and Communication Complexity Bruno Codenotti \Lambda Gianna Del Corso y Giovanni Manzini z
• Computation of sparse circulant permanents via determinants
• Some structural properties of low rank matrices related to computational complexity
• Computing Equilibrium Prices in Exchange Economies with Tax Distortions
• E#cient Computation of Equilibrium Prices for Markets with Leontief Utilities
• On Boolean Functions associated to Bipartite Cayley Graphs
• Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
• SelfCorrecting for Function Fields of Finite Transcendental Degree
• On the Lov'asz number of Certain Circulant Graphs Valentin Brimkov \Lambda Bruno Codenotti y Valentino Crespi z
• perturbation iterated local search
• The role of arithmetic in fast parallel matrix inversion
• Average Circuit Depth and Average Communication Complexity Bruno Codenotti \Lambda
• How fast can one compute the permanent of circulant matrices? A. Bernasconi \Lambda B. Codenotti y V. Crespi z G. Resta y
• Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and
• Broadcast and Associative Operations on FatTrees \Lambda G. Bilardi y B. Codenotti z G. Del Corso x C. Pinotti --
• Market Equilibrium in Exchange Economies with Some Families of Concave Utility Functions