Papers by Bruno Codenotti
IEEE International Conference on E-Commerce, 2003. CEC 2003., 2000
We consider the generation of realistic data sets for combinatorial auctions. This problem has be... more We consider the generation of realistic data sets for combinatorial auctions. This problem has been recognized as central to enhance the contribution of the computer science community to the field. We put forward the notions of structure and budget as main guidelines towards the generation of succinct and realistic input data. We describe a computational framework for the analysis of
Computers Mathematics With Applications, Dec 31, 1987
The Lovász theta function θ(G) of a graph G has attracted a lot of attention for its connection w... more The Lovász theta function θ(G) of a graph G has attracted a lot of attention for its connection with diverse issues, such as communicating without errors and computing large cliques in graphs. Indeed this function enjoys the remarkable property of being computable in polynomial time, despite being sandwitched between clique and chromatic number, two well known hard to compute quantities.
Nasa Sti Recon Technical Report N, Jun 1, 1985
An algorithm is described for reconfiguring a 2-dimensional VLSI array on a silicon wafer that ha... more An algorithm is described for reconfiguring a 2-dimensional VLSI array on a silicon wafer that has some faulty cells. The functional cells of the array are interconnected in order to simulate a fault-free array of smaller size, where the interconnection wires are routed inside horizontal and vertical channels, according to the Manhattan model. The concept of simulation distance is introduced, and it is shown to be related to the length of the longest interconnection wire. The algorithm makes use of network flow techniques in order to find wiring with minimum simulation distance. This results in a practical heuristic for minimum simulation distance. This results in a practical heuristic for minimizing the maximum wire length. The complexity and performance of this algorithm are also discussed in the paper.
Integration the Vlsi Journal, Mar 1, 1987
We show that for several natural classes of "structured" matrices, including sy... more We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approx- imating the permanent modulo a prime p is as hard as computing the exact value. Results of this kind are well known for the class of arbi- trary matrices; however the techniques used do not seem to apply to "structured" matrices. Our
) Bruno Codenotti, 1 Funda Ergun, 2 Peter Gemmell, 3 and S Ravi Kumar 2 1 IMC-CNR, Via S. Maria 4... more ) Bruno Codenotti, 1 Funda Ergun, 2 Peter Gemmell, 3 and S Ravi Kumar 2 1 IMC-CNR, Via S. Maria 46, 56126-Pisa, Italy. ([email protected]) 2 Cornell University, Ithaca, NY 14853. (fergun, [email protected]) 3 Sandia National Labs, Albuquerque, NM 87185. ( ...
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93, 1993
Remarkable progress has been made in both theory and applications of all important areas of contr... more Remarkable progress has been made in both theory and applications of all important areas of control. On the other hand, progress in computational aspects of control theory, especially in the area of large-scale and parallel computations, has been painfully slow. In this paper we address some central problems arising in control theory, namely the controllability and the eigenvalue assignment problems, and the solution of the Lyapunov and Sylvester observer matrix equations. For all these problems we give parallel algorithms that run in almost linear time on a Parallel Random Access Machine model. The algorithms make efficient use of the processors and are scalable, which makes them of practical worth also in the case of limited parallelism. This paper is in part based on an invited talk delivered to the 1992 American Control Conference in Chicago, Il. y Istituto di Elaborazione dell'Informazione, Consiglio Nazionale delle Ricerche, Pisa (Italy). Partly supported by ESPRIT Basic R...
International Conference On Principles Of DIstributed Systems, 2001
Lecture Notes in Computer Science, 1995
We use algebraic field extension theory to find self-correctors for a broad class of functions. M... more We use algebraic field extension theory to find self-correctors for a broad class of functions. Many functions whose translations are contained in a function field that is a finite degree extension of a scalar field satisfy polynomial identities that can be transformed into self-correctors. These functions can be efficiently corrected in a way that is simpler and different from how
Lecture Notes in Computer Science, 1997
This paper analyzes the cost of performing broadcast, productand prefix computation on the ideal ... more This paper analyzes the cost of performing broadcast, productand prefix computation on the ideal fat-tree, a model proposed hereto capture distance and bandwidth properties common to a variety offat-tree networks. Algorithms are developed and analyzed in terms ofthe capacity of channels at different levels of the fat-tree. Non triviallower bounds are derived establishing the optimality of our algorithmsfor a wide
Lecture Notes in Business Information Processing, 2010
... References 1. V. Abhishek, K. Hosanagar. ... San Diego, CA. 25. GA Miller, C. Fellbaum, R. Te... more ... References 1. V. Abhishek, K. Hosanagar. ... San Diego, CA. 25. GA Miller, C. Fellbaum, R. Tengi, P. Wakefield, R. Poddar, H. Langone, B. Haskell, WordNet: A Lexical Database for English, Princeton University (2006). 26. GA Miller, WordNet: An On-line Lexical Database, Int. ...
Uploads
Papers by Bruno Codenotti