The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maurizio A. Bonuccelli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
    VLSI Mesh of Trees for Data Base Processing. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:155-166 [Conf]
  2. Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
    Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:594-601 [Conf]
  3. Maurizio A. Bonuccelli, Luca Simoncini
    A Fault-Tolerant Distributed Control VLSI Permutation Network. [Citation Graph (0, 0)][DBLP]
    Fehlertolerierende Rechensysteme, 1989, pp:85-99 [Conf]
  4. Alan A. Bertossi, Maurizio A. Bonuccelli
    Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:701-709 [Conf]
  5. Maurizio A. Bonuccelli
    Minimum Fragmentation Internetwork Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:289-294 [Conf]
  6. Maurizio A. Bonuccelli, M. Claudia Clò
    EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:668-677 [Conf]
  7. Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
    Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:184- [Conf]
  8. Maurizio A. Bonuccelli, Susanna Pelagatti
    Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:343-352 [Conf]
  9. Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli
    A VLSI Tree Machine for Relational Data Bases [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:67-73 [Conf]
  10. Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
    Temporal Transcoding for Mobile Video Communication. [Citation Graph (0, 0)][DBLP]
    MobiQuitous, 2005, pp:502-506 [Conf]
  11. Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
    An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks. [Citation Graph (0, 0)][DBLP]
    MSWiM, 2004, pp:47-51 [Conf]
  12. Maurizio A. Bonuccelli, Alessandro Urpi
    A Multicast FCFS Output Queued Switch without Speedup. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2002, pp:1057-1068 [Conf]
  13. Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
    Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks. [Citation Graph (0, 0)][DBLP]
    WOWMOM, 2006, pp:603-608 [Conf]
  14. Maurizio A. Bonuccelli, Alessandro Urpi
    Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2005, v:8, n:1, pp:7-14 [Journal]
  15. Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:1, pp:1- [Journal]
  16. Alan A. Bertossi, Maurizio A. Bonuccelli
    Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:3-6 [Journal]
  17. Alan A. Bertossi, Maurizio A. Bonuccelli
    Hamiltonian Circuits in Interval Graph Generalizations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:4, pp:195-200 [Journal]
  18. Maurizio A. Bonuccelli, Daniel P. Bovet
    Minimum Node Disjoint Path Covering for Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:159-161 [Journal]
  19. Alan A. Bertossi, Maurizio A. Bonuccelli, Marco Roccetti
    Reconfigurable Tree Architectures for Gracefully Degradable VLSI Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:3, pp:264-277 [Journal]
  20. Maurizio A. Bonuccelli, Francesca Martelli, Susanna Pelagatti
    Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters. [Citation Graph (0, 0)][DBLP]
    MONET, 2004, v:9, n:4, pp:289-295 [Journal]
  21. Maurizio A. Bonuccelli
    A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:28-35 [Journal]
  22. Alan A. Bertossi, Maurizio A. Bonuccelli
    A VLSI Implementation of the Simplex Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:2, pp:241-247 [Journal]
  23. Alan A. Bertossi, Maurizio A. Bonuccelli
    A Gracefully Degradable VLSI System for Linear Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:853-861 [Journal]
  24. Maurizio A. Bonuccelli, Elena Lodi, Linda Pagli
    External Sorting in VLSI. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:10, pp:931-934 [Journal]
  25. Maurizio A. Bonuccelli, Stefano Leonardi
    On scheduling variable length broadcasts in wireless networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 1997, v:8, n:2-4, pp:211-227 [Journal]
  26. Alan A. Bertossi, Maurizio A. Bonuccelli
    Code assignment for hidden terminal interference avoidance in multihop packet radio networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1995, v:3, n:4, pp:441-449 [Journal]
  27. Maurizio A. Bonuccelli, M. Claudia Clò
    Scheduling of real-time messages in optical broadcast-and-select networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:5, pp:541-552 [Journal]
  28. Piera Barcaccia, Maurizio A. Bonuccelli
    Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1994, v:2, n:3, pp:247-251 [Journal]
  29. Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
    Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:10, pp:1090-1102 [Journal]
  30. Roberto Battiti, Alan A. Bertossi, Maurizio A. Bonuccelli
    Assigning codes in wireless networks: bounds and scaling properties. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 1999, v:5, n:3, pp:195-209 [Journal]
  31. Maurizio A. Bonuccelli, Francesca Lonetti, Francesca Martelli
    Instant collision resolution for tag identification in RFID networks. [Citation Graph (0, 0)][DBLP]
    Ad Hoc Networks, 2007, v:5, n:8, pp:1220-1232 [Journal]

  32. Exploiting signal strength detection and collision cancellation for tag identification in RFID systems. [Citation Graph (, )][DBLP]


  33. Traffic scheduling for frame length minimization in OFDMA based systems. [Citation Graph (, )][DBLP]


  34. Exploiting id knowledge for tag identification in rfid networks. [Citation Graph (, )][DBLP]


  35. Perfect tag identification protocol in RFID networks [Citation Graph (, )][DBLP]


Search in 1.390secs, Finished in 1.392secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002