Maurizio A. Bonuccelli

48 papers A* 3A 4B 2C 5Journal 29Unranked 5
YearRankTypeTitle / Venue / Authors
2018 J jnl
A very fast tags polling protocol for single and multiple readers RFID systems, and its applications.
Ad Hoc Networks
Maurizio A. Bonuccelli, Francesca Martelli
2016 C conf
A fast tags polling protocol for multireader RFID systems.
ISCC
Maurizio A. Bonuccelli
2016 J jnl
Goodput maximization in opportunistic spectrum access networks under constraints on the inter-packet transmission waiting time.
Ad Hoc Networks
Maurizio A. Bonuccelli, Donatella Ermini, Loreto Pescosolido, Chiara Petrioli
2013 J jnl
Minimum Message Waiting Time Scheduling in Distributed Systems.
IEEE Trans. Parallel Distributed Syst.
Francesca Martelli, Maurizio A. Bonuccelli
2012 B conf
Goodput maximization in opportunistic spectrum access radio links with imperfect spectrum sensing and fec-based packet protection.
MASS
Maurizio A. Bonuccelli, Donatella Ermini, Loreto Pescosolido, Chiara Petrioli
2009 C conf
Exploiting signal strength detection and collision cancellation for tag identification in RFID systems.
ISCC
Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
2009 A conf
Traffic scheduling for frame length minimization in OFDMA based systems.
MSWiM
Maurizio A. Bonuccelli, Donatella Ermini
2007 — conf
Exploiting id knowledge for tag identification in rfid networks.
PE-WASUN
Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
2007 J jnl
Instant collision resolution for tag identification in RFID networks.
Ad Hoc Networks
Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
2006 C conf
Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks.
WOWMOM
Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
2005 J jnl
Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique.
Clust. Comput.
Maurizio A. Bonuccelli, Alessandro Urpi
2005 C conf
Temporal Transcoding for Mobile Video Communication.
MobiQuitous
Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
2004 A conf
An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks.
MSWiM
Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
2004 J jnl
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters.
Mob. Networks Appl.
Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
2003 J jnl
Foreword.
Discret. Appl. Math.
Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela
2002 B conf
A Multicast FCFS Output Queued Switch without Speedup.
NETWORKING
Maurizio A. Bonuccelli, Alessandro Urpi
2001 A conf
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters.
IPDPS
Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
2001 J jnl
Scheduling of real-time messages in optical broadcast-and-select networks.
IEEE/ACM Trans. Netw.
Maurizio A. Bonuccelli, M. Claudia Clò
2000 J jnl
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems.
IEEE Trans. Parallel Distributed Syst.
Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
2000 A conf
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems.
IPDPS
Maurizio A. Bonuccelli, Susanna Pelagatti
1999 J jnl
Assigning codes in wireless networks: bounds and scaling properties.
Wirel. Networks
Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli
1999 — conf
EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems.
IPPS/SPDP
Maurizio A. Bonuccelli, M. Claudia Clò
1997 J jnl
On scheduling variable length broadcasts in wireless networks.
Telecommun. Syst.
Maurizio A. Bonuccelli, Stefano Leonardi
1996 — conf
Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract).
Euro-Par, Vol. II
Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
1995 J jnl
Code assignment for hidden terminal interference avoidance in multihop packet radio networks.
IEEE/ACM Trans. Netw.
Alan A. Bertossi, Maurizio A. Bonuccelli
1994 C ed.
Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings
CIAC
Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi
1994 J jnl
Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems.
IEEE/ACM Trans. Netw.
Piera Barcaccia, Maurizio A. Bonuccelli
1994 J jnl
Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems.
J. Parallel Distributed Comput.
Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti
1992 A* conf
Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks.
INFOCOM
Alan A. Bertossi, Maurizio A. Bonuccelli
1991 J jnl
A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes.
SIAM J. Discret. Math.
Maurizio A. Bonuccelli
1991 J jnl
Incremental time-slot assignment in SS/TDMA satellite systems.
IEEE Trans. Commun.
Maurizio A. Bonuccelli, Inder S. Gopal, C. K. Wong
1991 A* conf
Minimum Fragmentation Internetwork Routing.
INFOCOM
Maurizio A. Bonuccelli
1989 — conf
A Fault-Tolerant Distributed Control VLSI Permutation Network.
Fehlertolerierende Rechensysteme
Maurizio A. Bonuccelli, Luca Simoncini
1989 J jnl
A Gracefully Degradable VLSI System for Linear Programming.
IEEE Trans. Computers
Alan A. Bertossi, Maurizio A. Bonuccelli
1989 J jnl
A fast time slot assignment algorithm for TDM hierarchical switching systems.
IEEE Trans. Commun.
Maurizio A. Bonuccelli
1987 J jnl
A VLSI Implementation of the Simplex Algorithm.
IEEE Trans. Computers
Alan A. Bertossi, Maurizio A. Bonuccelli
1987 J jnl
Some parallel algorithms on interval graphs.
Discret. Appl. Math.
Alan A. Bertossi, Maurizio A. Bonuccelli
1987 J jnl
Time Slot Assignment in SS/TDMA Systems with Intersatellite Links.
IEEE Trans. Commun.
Alan A. Bertossi, Giancarlo Bongiovanni, Maurizio A. Bonuccelli
1986 J jnl
Hamiltonian Circuits in Interval Graph Generalizations.
Inf. Process. Lett.
Alan A. Bertossi, Maurizio A. Bonuccelli
1985 J jnl
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors.
Discret. Appl. Math.
Alan A. Bertossi, Maurizio A. Bonuccelli
1985 J jnl
Dominating sets and domatic number of circular arc graphs.
Discret. Appl. Math.
Maurizio A. Bonuccelli
1984 J jnl
External Sorting in VLSI.
IEEE Trans. Computers
Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli
1983 A* conf
A VLSI Tree Machine for Relational Data Bases
ISCA
Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
1983 J jnl
Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems.
Inf. Process. Lett.
Alan A. Bertossi, Maurizio A. Bonuccelli
1983 J jnl
Scheduling in Multibeam Satellites with Interfering Zones.
IEEE Trans. Commun.
Inder S. Gopal, Maurizio A. Bonuccelli, C. K. Wong
1983 — conf
VLSI Mesh of Trees for Data Base Processing.
CAAP
Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
1982 J jnl
An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams.
IEEE Trans. Commun.
Inder S. Gopal, Giancarlo Bongiovanni, Maurizio A. Bonuccelli, Donald T. Tang, C. K. Wong
1979 J jnl
Minimum Node Disjoint Path Covering for Circular-Arc Graphs.
Inf. Process. Lett.
Maurizio A. Bonuccelli, Daniel P. Bovet