default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurizio A. Bonuccelli
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j29]Maurizio A. Bonuccelli, Francesca Martelli
:
A very fast tags polling protocol for single and multiple readers RFID systems, and its applications. Ad Hoc Networks 71: 14-30 (2018)- 2016
- [j28]Maurizio A. Bonuccelli, Donatella Ermini, Loreto Pescosolido, Chiara Petrioli:
Goodput maximization in opportunistic spectrum access networks under constraints on the inter-packet transmission waiting time. Ad Hoc Networks 38: 19-37 (2016) - [c19]Maurizio A. Bonuccelli:
A fast tags polling protocol for multireader RFID systems. ISCC 2016: 1120-1127 - 2013
- [j27]Francesca Martelli, Maurizio A. Bonuccelli:
Minimum Message Waiting Time Scheduling in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 24(9): 1797-1806 (2013) - 2012
- [c18]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 - 2010
- [c17]Donatella Ermini, Maurizio Angelo Bonuccelli:
Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems. PM2HW2N@MSWiM 2010: 31-38
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 - 2007
- [j26]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
- [j25]Maurizio A. Bonuccelli, Alessandro Urpi:
Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique. Clust. Comput. 8(1): 7-14 (2005) - [c12]Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli:
Temporal Transcoding for Mobile Video Communication. MobiQuitous 2005: 502-506 - 2004
- [j24]Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti:
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters. Mob. Networks Appl. 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
- [j23]Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela:
Foreword. Discret. Appl. Math. 129(1): 1 (2003) - 2002
- [c10]Maurizio A. Bonuccelli, Alessandro Urpi:
A Multicast FCFS Output Queued Switch without Speedup. NETWORKING 2002: 1057-1068 - 2001
- [j22]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
- [j21]Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni:
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. IEEE Trans. Parallel Distributed 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
- [j20]Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli:
Assigning codes in wireless networks: bounds and scaling properties. Wirel. 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
- [j19]Maurizio A. Bonuccelli, Stefano Leonardi:
On scheduling variable length broadcasts in wireless networks. Telecommun. Syst. 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
- [j18]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
- [j17]Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti:
Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems. J. Parallel Distributed Comput. 23(3): 264-277 (1994) - [j16]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:
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 [contents] - 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
- [j15]Maurizio A. Bonuccelli:
A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes. SIAM J. Discret. Math. 4(1): 28-35 (1991) - [j14]Maurizio A. Bonuccelli, Inder S. Gopal, C. K. Wong:
Incremental time-slot assignment in SS/TDMA satellite systems. IEEE Trans. Commun. 39(7): 1147-1156 (1991) - [c4]Maurizio A. Bonuccelli:
Minimum Fragmentation Internetwork Routing. INFOCOM 1991: 289-294
1980 – 1989
- 1989
- [j13]Alan A. Bertossi, Maurizio A. Bonuccelli:
A Gracefully Degradable VLSI System for Linear Programming. IEEE Trans. Computers 38(6): 853-861 (1989) - [j12]Maurizio A. Bonuccelli:
A fast time slot assignment algorithm for TDM hierarchical switching systems. IEEE Trans. Commun. 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
- [j11]Alan A. Bertossi, Maurizio A. Bonuccelli:
Some parallel algorithms on interval graphs. Discret. Appl. Math. 16(2): 101-111 (1987) - [j10]Alan A. Bertossi, Maurizio A. Bonuccelli:
A VLSI Implementation of the Simplex Algorithm. IEEE Trans. Computers 36(2): 241-247 (1987) - [j9]Alan A. Bertossi, Giancarlo Bongiovanni, Maurizio A. Bonuccelli:
Time Slot Assignment in SS/TDMA Systems with Intersatellite Links. IEEE Trans. Commun. 35(6): 602-608 (1987) - 1986
- [j8]Alan A. Bertossi, Maurizio A. Bonuccelli:
Hamiltonian Circuits in Interval Graph Generalizations. Inf. Process. Lett. 23(4): 195-200 (1986) - 1985
- [j7]Alan A. Bertossi, Maurizio A. Bonuccelli:
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors. Discret. Appl. Math. 12(3): 195-201 (1985) - [j6]Maurizio A. Bonuccelli:
Dominating sets and domatic number of circular arc graphs. Discret. Appl. Math. 12(3): 203-213 (1985) - 1984
- [j5]Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli:
External Sorting in VLSI. IEEE Trans. Computers 33(10): 931-934 (1984) - 1983
- [j4]Alan A. Bertossi, Maurizio A. Bonuccelli:
Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. Inf. Process. Lett. 16(1): 3-6 (1983) - [j3]Inder S. Gopal, Maurizio A. Bonuccelli, C. K. Wong:
Scheduling in Multibeam Satellites with Interfering Zones. IEEE Trans. Commun. 31(8): 941-951 (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 - 1982
- [j2]Inder S. Gopal, Giancarlo Bongiovanni, Maurizio A. Bonuccelli, Donald T. Tang, C. K. Wong:
An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams. IEEE Trans. Commun. 30(11): 2475-2481 (1982)
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
