2009 |
32 | EE | Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Partially controlled deployment strategies for wireless sensors.
Ad Hoc Networks 7(1): 1-23 (2009) |
2008 |
31 | EE | Stephan Eidenbenz,
Giovanni Resta,
Paolo Santi:
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes.
IEEE Trans. Mob. Comput. 7(1): 19-33 (2008) |
30 | EE | Giovanni Resta,
Paolo Santi:
WiQoSM: An Integrated QoS-Aware Mobility and User Behavior Model for Wireless Data Networks.
IEEE Trans. Mob. Comput. 7(2): 187-198 (2008) |
2007 |
29 | 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 |
28 | EE | Giovanni Resta,
Paolo Santi,
Janos Simon:
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks.
MobiHoc 2007: 140-149 |
27 | 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 |
26 | EE | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.
ESA 2006: 232-243 |
25 | EE | Giovanni Resta,
Paolo Santi:
The QoS-RWP mobility and user behavior model for public area wireless networks.
MSWiM 2006: 375-384 |
24 | EE | Douglas M. Blough,
Cyrus Harvesf,
Giovanni Resta,
George F. Riley,
Paolo Santi:
A Simulation-Based Study on the Throughput Capacity of Topology Control in CSMA/CA Networks.
PerCom Workshops 2006: 400-404 |
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 | Stephan Eidenbenz,
Giovanni Resta,
Paolo Santi:
COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes.
IPDPS 2005 |
20 | EE | Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring.
IPSN 2005: 239-245 |
19 | 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 |
18 | EE | Douglas M. Blough,
Giovanni Resta,
Paolo Santi:
A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks.
Wireless Networks 10(5): 543-554 (2004) |
2003 |
17 | EE | Andrea Bonaccorsi,
Bruno Codenotti,
Nicola Dimitri,
Mauro Leoncini,
Giovanni Resta,
Paolo Santi:
Generating Realistic Data Sets for Combinatorial Auctions.
CEC 2003: 331-338 |
16 | 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 |
15 | | Bruno Codenotti,
Ivan Gerace,
Giovanni Resta:
Some remarks on the Shannon capacity of odd cycles.
Ars Comb. 66: (2003) |
14 | EE | Christian Bettstetter,
Giovanni Resta,
Paolo Santi:
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks.
IEEE Trans. Mob. Comput. 2(3): 257-269 (2003) |
13 | | Giovanni Resta,
Jean-Charles Meyrignac:
The smallest solutions to the diophantine equation x6 + y6 = a6 + b6 +c6 + d6 + e6.
Math. Comput. 72(242): 1051-1054 (2003) |
2002 |
12 | | 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 |
11 | EE | Douglas M. Blough,
Giovanni Resta,
Paolo Santi:
A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks.
MSWiM 2002: 30-37 |
10 | EE | Giovanni Resta,
Paolo Santi:
An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks.
POMC 2002: 44-50 |
9 | EE | Alberto Maria Segre,
Sean L. Forman,
Giovanni Resta,
Andrew Wildenberg:
Nagging: A scalable fault-tolerant paradigm for distributed search.
Artif. Intell. 140(1/2): 71-106 (2002) |
2000 |
8 | EE | Bruno Codenotti,
Pavel Pudlák,
Giovanni Resta:
Some structural properties of low-rank matrices related to computational complexity.
Theor. Comput. Sci. 235(1): 89-107 (2000) |
1997 |
7 | | Gianfranco Bilardi,
Bruno Codenotti,
G. Del Corso,
Maria Cristina Pinotti,
Giovanni Resta:
Broadcast and Associative Operations on Fat-Trees.
Euro-Par 1997: 196-207 |
6 | EE | Bruno Codenotti,
Pavel Pudlák,
Giovanni Resta:
Some structural properties of low rank matrices related to computational complexity
Electronic Colloquium on Computational Complexity (ECCC) 4(43): (1997) |
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 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra.
Theor. Comput. Sci. 127(1): 99-121 (1994) |
1993 |
3 | | Bruno Codenotti,
Giovanni Manzini,
Luciano Margara,
Giovanni Resta:
Global Strategies for Augmenting the Efficiency of TSP Heuristics.
WADS 1993: 253-264 |
1992 |
2 | | Bruno Codenotti,
Mauro Leoncini,
Giovanni Resta:
Repeated Matrix Squaring for the Parallel Solution of Linear Systems.
PARLE 1992: 725-732 |
1991 |
1 | | Emanuela Fachini,
Andrea Maggiolo-Schettini,
Giovanni Resta,
Davide Sangiorgi:
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci. 83(2): 249-260 (1991) |