Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Maurizio A. Bonuccelli
2010 – today
- 2012
[c17]Maurizio A. Bonuccelli, Donatella Ermini, Loreto Pescosolido, Chiara Petrioli: Goodput maximization in opportunistic spectrum access radio links with imperfect spectrum sensing and fec-based packet protection. MASS 2012: 344-352
2000 – 2009
- 2009
- [c16]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Exploiting signal strength detection and collision cancellation for tag identification in RFID systems. ISCC 2009: 500-506
- [c15]Maurizio A. Bonuccelli, Donatella Ermini: Traffic scheduling for frame length minimization in OFDMA based systems. MSWiM 2009: 229-234
- 2008
- [i1]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Perfect tag identification protocol in RFID networks. CoRR abs/0805.1877 (2008)
- 2007
- [j20]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Instant collision resolution for tag identification in RFID networks. Ad Hoc Networks 5(8): 1220-1232 (2007)
- [c14]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Exploiting id knowledge for tag identification in rfid networks. PE-WASUN 2007: 70-77
- 2006
- [c13]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks. WOWMOM 2006: 603-608
- 2005
- [j19]Maurizio A. Bonuccelli, Alessandro Urpi: Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique. Cluster Computing 8(1): 7-14 (2005)
- [c12]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli: Temporal Transcoding for Mobile Video Communication. MobiQuitous 2005: 502-506
- 2004
- [j18]Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti: Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters. MONET 9(4): 289-295 (2004)
- [c11]Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti: An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks. MSWiM 2004: 47-51
- 2003
- [j17]Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela: Foreword. Discrete Applied Mathematics 129(1): 1 (2003)
- 2002
- [c10]Maurizio A. Bonuccelli, Alessandro Urpi: A Multicast FCFS Output Queued Switch without Speedup. NETWORKING 2002: 1057-1068
- 2001
- [j16]Maurizio A. Bonuccelli, M. Claudia Clò: Scheduling of real-time messages in optical broadcast-and-select networks. IEEE/ACM Trans. Netw. 9(5): 541-552 (2001)
- [c9]Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti: Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters. IPDPS 2001: 184
- 2000
- [j15]Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni: Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. IEEE Trans. Parallel Distrib. Syst. 11(10): 1090-1102 (2000)
- [c8]Maurizio A. Bonuccelli, Susanna Pelagatti: Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems. IPDPS 2000: 343-352
1990 – 1999
- 1999
- [j14]Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli: Assigning codes in wireless networks: bounds and scaling properties. Wireless Networks 5(3): 195-209 (1999)
- [c7]Maurizio A. Bonuccelli, M. Claudia Clò: EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems. IPPS/SPDP 1999: 668-677
- 1997
- [j13]Maurizio A. Bonuccelli, Stefano Leonardi: On scheduling variable length broadcasts in wireless networks. Telecommunication Systems 8(2-4): 211-227 (1997)
- 1996
- [c6]Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni: Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). Euro-Par, Vol. II 1996: 594-601
- 1995
- [j12]Alan A. Bertossi, Maurizio A. Bonuccelli: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Netw. 3(4): 441-449 (1995)
- 1994
- [j11]Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti: Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems. J. Parallel Distrib. Comput. 23(3): 264-277 (1994)
- [j10]Piera Barcaccia, Maurizio A. Bonuccelli: Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. IEEE/ACM Trans. Netw. 2(3): 247-251 (1994)
- [e1]Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi (Eds.): Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings. Lecture Notes in Computer Science 778, Springer 1994, ISBN 3-540-57811-0
- 1992
- [c5]Alan A. Bertossi, Maurizio A. Bonuccelli: Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. INFOCOM 1992: 701-709
- 1991
- [j9]Maurizio A. Bonuccelli: A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes. SIAM J. Discrete Math. 4(1): 28-35 (1991)
- [j8]Maurizio A. Bonuccelli, Inder S. Gopal, C. K. Wong: Incremental time-slot assignment in SS/TDMA satellite systems. IEEE Transactions on Communications 39(7): 1147-1156 (1991)
- [c4]
1980 – 1989
- 1989
- [j7]Alan A. Bertossi, Maurizio A. Bonuccelli: A Gracefully Degradable VLSI System for Linear Programming. IEEE Trans. Computers 38(6): 853-861 (1989)
- [j6]Maurizio A. Bonuccelli: A fast time slot assignment algorithm for TDM hierarchical switching systems. IEEE Transactions on Communications 37(8): 870-874 (1989)
- [c3]Maurizio A. Bonuccelli, Luca Simoncini: A Fault-Tolerant Distributed Control VLSI Permutation Network. Fehlertolerierende Rechensysteme 1989: 85-99
- 1987
- [j5]Alan A. Bertossi, Maurizio A. Bonuccelli: A VLSI Implementation of the Simplex Algorithm. IEEE Trans. Computers 36(2): 241-247 (1987)
- 1986
- [j4]Alan A. Bertossi, Maurizio A. Bonuccelli: Hamiltonian Circuits in Interval Graph Generalizations. Inf. Process. Lett. 23(4): 195-200 (1986)
- 1984
- [j3]Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli: External Sorting in VLSI. IEEE Trans. Computers 33(10): 931-934 (1984)
- 1983
- [j2]Alan A. Bertossi, Maurizio A. Bonuccelli: Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. Inf. Process. Lett. 16(1): 3-6 (1983)
- [c2]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli: VLSI Mesh of Trees for Data Base Processing. CAAP 1983: 155-166
- [c1]Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli: A VLSI Tree Machine for Relational Data Bases. ISCA 1983: 67-73
1970 – 1979
- 1979
- [j1]Maurizio A. Bonuccelli, Daniel P. Bovet: Minimum Node Disjoint Path Covering for Circular-Arc Graphs. Inf. Process. Lett. 8(4): 159-161 (1979)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-26 21:28 CEST by the dblp team