Bruno Codenotti

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis.

[BibT_eX]

[DOI]

Proceedings of the E-Commerce and Web Technologies, 11th International Conference, 2010

2009

An optimal multiprocessor combinatorial auction solver.

[BibT_eX]

[DOI]

Shouxi Yang

Alberto Maria Segre

Comput. Oper. Res., 2009

2008

The complexity of equilibria: Hardness results for economies via a correspondence with games.

[BibT_eX]

[DOI]

Amin Saberi

Yinyu Ye

Theor. Comput. Sci., 2008

An experimental study of different approaches to solve the market equilibrium problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

An experimental analysis of Lemke-Howson algorithm

[BibT_eX]

[DOI]

Stefano De Rossi

Marino Pagan

CoRR, 2008

2006

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Computing Equilibrium Prices in Exchange Economies with Tax Distortions.

[BibT_eX]

[DOI]

Luis Rademacher

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

On the computational complexity of Nash equilibria for (0, 1) bimatrix games.

[BibT_eX]

[DOI]

Daniel Stefankovic

Inf. Process. Lett., 2005

Leontief Economies Encode Nonzero Sum Two-Player Games

[BibT_eX]

[DOI]

Amin Saberi

Yinyu Ye

Electron. Colloquium Comput. Complex., 2005

Market equilibrium via the excess demand function.

[BibT_eX]

[DOI]

Benton McCune

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the polynomial time computation of equilibria for certain exchange economies.

[BibT_eX]

[DOI]

Sriram V. Pemmaraju

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation.

[BibT_eX]

[DOI]

Benton McCune

Sriram Penumatcha

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Computing Equilibrium Prices: Does Theory Meet Practice?.

[BibT_eX]

[DOI]

Benton McCune

Rajiv Raman

Proceedings of the Algorithms, 2005

2004

UbiCrawler: a scalable fully distributed Web crawler.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2004

The computation of market equilibria.

[BibT_eX]

[DOI]

Sriram V. Pemmaraju

SIGACT News, 2004

Spectral Analysis of Symmetric Threshold Functions.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2004

Approximation algorithms for a hierarchically structured bin packing problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Computation of the Lovász Theta Function for Circulant Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Some remarks on the Shannon capacity of odd cycles.

[BibT_eX]

Ivan Gerace

Ars Comb., 2003

Generating Realistic Data Sets for Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003

2002

Non-approximability of the Permanent of Structured Matrices over Finite Fields

[BibT_eX]

[DOI]

Igor E. Shparlinski

Electron. Colloquium Comput. Complex., 2002

On the hardness of approximating the permanent of structured matrices.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Arne Winterhof

Comput. Complex., 2002

2001

A Characterization of Bent Functions in Terms of Strongly Regular Graphs.

[BibT_eX]

[DOI]

Jeffrey M. Vanderkam

IEEE Trans. Computers, 2001

The Role of Arithmetic in Fast Parallel Matrix Inversion.

[BibT_eX]

[DOI]

Franco P. Preparata

Algorithmica, 2001

Trovatore: Towards a Highly Scalable Distributed Web Crawler.

[BibT_eX]

[DOI]

Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

Distributed Algorithm for Certain Assignment Problems.

[BibT_eX]

Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001

2000

Some structural properties of low-rank matrices related to computational complexity.

[BibT_eX]

[DOI]

Pavel Pudlák

Theor. Comput. Sci., 2000

On the Lovász Number of Certain Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1999

1997

A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices.

[BibT_eX]

[DOI]

Ilan Bar-On

SIAM J. Matrix Anal. Appl., April, 1997

Parallel Algorithms for Certain Matrix Computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Computing Groebner Bases in the Boolean Setting with Applications to Counting.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Parallel Implementation of a Discontinuous Finite Element Method for the Solution of the Navier-Stokes Equations.

[BibT_eX]

[DOI]

Proceedings of the Conference on Parallel Computational Fluid Dynamics 1997, 1997

On the Amount of Randomness Needed in Distributed Computations.

[BibT_eX]

Proceedings of the On Principles Of Distributed Systems, 1997

Checking Properties of Polynomials (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Broadcast and Associative Operations on Fat-Trees.

[BibT_eX]

[DOI]

Gianfranco Bilardi

Gianna Maria Del Corso

Maria Cristina Pinotti

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

Strong NP-Completeness of a Matrix Similarity Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1996

Symmetry Breaking in Anonymous Networks: Characterizations.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Algebraic Techniques in Communication Complexity.

[BibT_eX]

[DOI]

Giovanni Manzini

Luciano Margara

Inf. Process. Lett., 1995

Self-Correcting for Function Fields Transcendental Degree.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Average Circuit Depth and Average Communication Complexity.

[BibT_eX]

[DOI]

Peter Gemmell

Janos Simon

Proceedings of the Algorithms, 1995

1994

Oracle Computations in Parallel Numerical Linear Algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Measures of Boolean Function Complexity Based on Harmonic Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

Global Strategies for Augmenting the Efficiency of TSP Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Checking approximate computations over the reals.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Introduction to parallel processing.

[BibT_eX]

International computer science series, Addison-Wesley, ISBN: 978-0-201-56887-5, 1993

1992

Repeated Matrix Squaring for the Parallel Solution of Linear Systems.

[BibT_eX]

[DOI]

Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1991

A Network Flow Approach to the Reconfiguration of VLSI Arrays.

[BibT_eX]

[DOI]

Roberto Tamassia

IEEE Trans. Computers, 1991

Matrix inversion in <i>RNC</i><sup>1</sup>.

[BibT_eX]

[DOI]

J. Complex., 1991

An experimental environment for design and analysis of global routing heuristics.

[BibT_eX]

[DOI]

Proceedings of the First Great Lakes Symposium on VLSI, 1991

Parallel complexity of linear system solution.

[BibT_eX]

World Scientific, ISBN: 978-981-02-0502-7, 1991

1990

Area-Time Trade-Offs for Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1990

1989

A Monte Carlo method for the parallel solution of linear systems.

[BibT_eX]

[DOI]

Franco Flandoli

J. Complex., 1989

Visualizing A Channel Router: An Experimental Study.

[BibT_eX]

[DOI]

Claudio Montani

Proceedings of the Computer Assisted Learning, 2nd International Conference, 1989

1988

Efficient Reconfiguration of VLSI Arrays.

[BibT_eX]

[DOI]

Roberto Tamassia

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A compact and modular VLSI design for the solution of general sparse linear systems.

[BibT_eX]

[DOI]

Integr., 1987

1986

A VLSI Fast Solver for Tridiagonal Linear Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Area-Time Tradeoffs for Bilinear Forms Computations in VLSI.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

A Note on the VLSI Counter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

1985

VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

VLSI implementation of iterative methods for the solution of linear systems.

[BibT_eX]

[DOI]