Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Leoncini, Mauro"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient computation of Nash equilibria for very sparse win-lose bimatrix games
Bruno Codenotti
,
Mauro Leoncini
,
Giovanni Resta
Lecture Notes in Computer Science
4168
, 2006, pp. 232-243
Approximation algorithms for a hierarchically structured bin packing problem
Bruno Codenotti
,
Gianluca De Marco
,
Mauro Leoncini
,
Manuela Montangero
,
Massimo Santini
Information Processing Letters
89
(5), 2004, pp. 215-221
On the Lovász number of certain circulant graphs
Valentin E. Brimkov
,
Bruno Codenotti
,
Valentino Crespi
,
Mauro Leoncini
Lecture Notes in Computer Science
1767
, 2000, pp. 291-305
Parallel complexity of numerically accurate linear system solvers
Mauro Leoncini
,
Giovanni Manzini
,
Luciano Margara
SIAM Journal on Computing
28
(6), 1999, pp. 2030-2058
Parallel algorithms for certain matrix computations
Bruno Codenotti
,
Biswa N. Datta
,
Karabi Datta
,
Mauro Leoncini
Theoretical Computer Science
180
(1-2), 1997, pp. 287-308
On the parallel complexity of matrix factorization algorithms
Mauro Leoncini
,
Giovanni Manzini
,
Luciano Margara
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'97 (Newport, Rhode Island, June 22-25, 1997)
, 1997, pp. 63-71
Parallel complexity of householder
QR
factorization
Mauro Leoncini
,
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1136
, 1996, pp. 290-301
On speed versus accuracy: Some case studies
Mauro Leoncini
Journal of Complexity
12
(3), 1996, pp. 239-253
Repeated matrix squaring for the parallel solution of linear systems
Bruno Codenotti
,
Mauro Leoncini
,
Giovanni Resta
Lecture Notes in Computer Science
605
, 1992, pp. 725-732