Maurizio A. Bonuccelli

Affiliations:
  • University of Pisa, Italy


According to our database1, Maurizio A. Bonuccelli authored at least 46 papers between 1979 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A very fast tags polling protocol for single and multiple readers RFID systems, and its applications.
Ad Hoc Networks, 2018

2016
Goodput maximization in opportunistic spectrum access networks under constraints on the inter-packet transmission waiting time.
Ad Hoc Networks, 2016

A fast tags polling protocol for multireader RFID systems.
Proceedings of the IEEE Symposium on Computers and Communication, 2016

2013
Minimum Message Waiting Time Scheduling in Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 2013

2012
Goodput maximization in opportunistic spectrum access radio links with imperfect spectrum sensing and fec-based packet protection.
Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

2010
Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems.
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, 2010

2009
Traffic scheduling for frame length minimization in OFDMA based systems.
Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2009

Exploiting signal strength detection and collision cancellation for tag identification in RFID systems.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

2007
Instant collision resolution for tag identification in RFID networks.
Ad Hoc Networks, 2007

Exploiting id knowledge for tag identification in rfid networks.
Proceedings of the 4th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2007

2006
Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks.
Proceedings of the 2006 International Symposium on a World of Wireless, 2006

2005
Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique.
Clust. Comput., 2005

Temporal Transcoding for Mobile Video Communication.
Proceedings of the 2nd Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2005), 2005

2004
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters.
Mob. Networks Appl., 2004

An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks.
Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2004

2003
Foreword.
Discret. Appl. Math., 2003

2002
A Multicast FCFS Output Queued Switch without Speedup.
Proceedings of the NETWORKING 2002, 2002

2001
Scheduling of real-time messages in optical broadcast-and-select networks.
IEEE/ACM Trans. Netw., 2001

2000
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 2000

Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Assigning codes in wireless networks: bounds and scaling properties.
Wirel. Networks, 1999

EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1997
On scheduling variable length broadcasts in wireless networks.
Telecommun. Syst., 1997

1996
Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Code assignment for hidden terminal interference avoidance in multihop packet radio networks.
IEEE/ACM Trans. Netw., 1995

1994
Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems.
IEEE/ACM Trans. Netw., 1994

Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems.
J. Parallel Distributed Comput., 1994

1991
Incremental time-slot assignment in SS/TDMA satellite systems.
IEEE Trans. Commun., 1991

A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes.
SIAM J. Discret. Math., 1991

Minimum Fragmentation Internetwork Routing.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1989
A fast time slot assignment algorithm for TDM hierarchical switching systems.
IEEE Trans. Commun., 1989

A Gracefully Degradable VLSI System for Linear Programming.
IEEE Trans. Computers, 1989

A Fault-Tolerant Distributed Control VLSI Permutation Network.
Proceedings of the Fehlertolerierende Rechensysteme / Fault-Tolerant Computing Systems, 1989

1987
Time Slot Assignment in SS/TDMA Systems with Intersatellite Links.
IEEE Trans. Commun., 1987

A VLSI Implementation of the Simplex Algorithm.
IEEE Trans. Computers, 1987

Some parallel algorithms on interval graphs.
Discret. Appl. Math., 1987

1986
Hamiltonian Circuits in Interval Graph Generalizations.
Inf. Process. Lett., 1986

1985
Dominating sets and domatic number of circular arc graphs.
Discret. Appl. Math., 1985

A polynomial feasibility test for preemptive periodic scheduling of unrelated processors.
Discret. Appl. Math., 1985

1984
External Sorting in VLSI.
IEEE Trans. Computers, 1984

1983
Scheduling in Multibeam Satellites with Interfering Zones.
IEEE Trans. Commun., 1983

Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems.
Inf. Process. Lett., 1983

A VLSI Tree Machine for Relational Data Bases
Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983

VLSI Mesh of Trees for Data Base Processing.
Proceedings of the CAAP'83, 1983

1982
An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams.
IEEE Trans. Commun., 1982

1979
Minimum Node Disjoint Path Covering for Circular-Arc Graphs.
Inf. Process. Lett., 1979


  Loading...