2009 |
29 | EE | Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Partially controlled deployment strategies for wireless sensors.
Ad Hoc Networks 7(1): 1-23 (2009) |
2007 |
28 | EE | Paolo Santi,
Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta:
Topology Control with Better Radio Models: Implications for Energy and Multi-Hop Interference.
Geometry in Sensor Networks 2007 |
27 | EE | Filippo Geraci,
Mauro Leoncini,
Manuela Montangero,
Marco Pellegrini,
M. Elena Renda:
FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering.
HCI (12) 2007: 606-615 |
26 | EE | Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Topology control with better radio models: Implications for energy and multi-hop interference.
Perform. Eval. 64(5): 379-398 (2007) |
2006 |
25 | EE | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.
ESA 2006: 232-243 |
24 | EE | Gianluca De Marco,
Mauro Leoncini,
Manuela Montangero:
Distributed algorithm for a color assignment on asynchronous rings.
IPDPS 2006 |
23 | EE | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games
Electronic Colloquium on Computational Complexity (ECCC)(012): (2006) |
22 | EE | Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks.
IEEE Trans. Mob. Comput. 5(9): 1267-1282 (2006) |
2005 |
21 | EE | Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring.
IPSN 2005: 239-245 |
20 | EE | Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Topology control with better radio models: implications for energy and multi-hop interference.
MSWiM 2005: 260-268 |
2004 |
19 | EE | Bruno Codenotti,
Gianluca De Marco,
Mauro Leoncini,
Manuela Montangero,
Massimo Santini:
Approximation algorithms for a hierarchically structured bin packing problem.
Inf. Process. Lett. 89(5): 215-221 (2004) |
2003 |
18 | EE | Andrea Bonaccorsi,
Bruno Codenotti,
Nicola Dimitri,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Generating Realistic Data Sets for Combinatorial Auctions.
CEC 2003: 331-338 |
17 | EE | Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
The lit K-neigh protocol for symmetric topology control in ad hoc networks.
MobiHoc 2003: 141-152 |
16 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Valentino Crespi,
Reneta P. Barneva,
Mauro Leoncini:
Computation of the Lovász Theta Function for Circulant Graphs
Electronic Colloquium on Computational Complexity (ECCC)(081): (2003) |
2002 |
15 | | Douglas M. Blough,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks.
IFIP TCS 2002: 71-82 |
2001 |
14 | | Bruno Codenotti,
Gianluca De Marco,
Mauro Leoncini,
Manuela Montangero:
Distributed Algorithm for Certain Assignment Problems.
OPODIS 2001: 91-112 |
13 | EE | Bruno Codenotti,
Mauro Leoncini,
Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion.
Algorithmica 30(4): 685-707 (2001) |
2000 |
12 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Valentino Crespi,
Mauro Leoncini:
On the Lovász Number of Certain Circulant Graphs.
CIAC 2000: 291-305 |
1999 |
11 | | Mauro Leoncini,
Giovanni Manzini,
Luciano Margara:
Parallel Complexity of Numerically Accurate Linear System Solvers.
SIAM J. Comput. 28(6): 2030-2058 (1999) |
1997 |
10 | EE | Mauro Leoncini,
Giovanni Manzini,
Luciano Margara:
On the Parallel Complexity of Matrix Factorization Algorithms.
SPAA 1997: 63-71 |
9 | EE | Bruno Codenotti,
Biswa N. Datta,
Karabi Datta,
Mauro Leoncini:
Parallel Algorithms for Certain Matrix Computations.
Theor. Comput. Sci. 180(1-2): 287-308 (1997) |
1996 |
8 | | Mauro Leoncini,
Giovanni Manzini,
Luciano Margara:
Parallel Complexity of Householder QR Factorization.
ESA 1996: 290-301 |
7 | EE | Mauro Leoncini:
On Speed versus Accuracy: Some Case Studies.
J. Complexity 12(3): 239-253 (1996) |
6 | | Mauro Leoncini:
On the Parallel Complexity of Gaussian Elimination with Pivoting.
J. Comput. Syst. Sci. 53(3): 380-394 (1996) |
5 | EE | Valentin E. Brimkov,
Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem.
Theor. Comput. Sci. 165(2): 483-490 (1996) |
1994 |
4 | EE | Mauro Leoncini:
How Much Can We Speedup Gaussian Elimination with Pivoting?
SPAA 1994: 290-297 |
3 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra.
Theor. Comput. Sci. 127(1): 99-121 (1994) |
1992 |
2 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Repeated Matrix Squaring for the Parallel Solution of Linear Systems.
PARLE 1992: 725-732 |
1991 |
1 | EE | Bruno Codenotti,
Mauro Leoncini:
Matrix inversion in RNC1.
J. Complexity 7(3): 282-295 (1991) |