The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Renato M. Capocelli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Size of Shares for Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:101-113 [Conf]
  2. Renato M. Capocelli, Alfredo De Santis
    Minimum codeword length and redundancy of Huffman codes. [Citation Graph (0, 0)][DBLP]
    EUROCODE, 1990, pp:309-317 [Conf]
  3. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Time Bound for Broadcasting in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:19-33 [Conf]
  4. Renato M. Capocelli
    Comments on "Threads in the Theory of Codes" by J. Berstel and D. Perrin. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1986, v:30, n:, pp:43- [Journal]
  5. Renato M. Capocelli, Aldo de Luca
    Fuzzy Sets and Decision Theory [Citation Graph (0, 0)][DBLP]
    Information and Control, 1973, v:23, n:5, pp:446-473 [Journal]
  6. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Size of Shares for Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:3, pp:157-167 [Journal]
  7. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Decoders with Initial State Invariance for Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:365-375 [Journal]
  8. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:63-78 [Journal]
  9. Renato M. Capocelli
    A decision procedure for finite decipherability and synchronizability of multivalued encodings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:307-317 [Journal]
  10. Renato M. Capocelli
    Comments and additions to 'Robust transmission of unbounded strings using Fibonacci representations' by A. Apostolico and A.S. Fraenkel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:191-0 [Journal]
  11. Renato M. Capocelli, Raffaele Giancarlo, Indeer Jet Taneja
    Bounds on the redundancy of Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:6, pp:854-0 [Journal]
  12. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    On the characterization of statistically synchronizable variable-length codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:817-825 [Journal]
  13. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    An efficient algorithm for testing immutability of variable-length codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1310-0 [Journal]
  14. Renato M. Capocelli, Alfredo De Santis
    Regular universal codeword sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:1, pp:129-0 [Journal]
  15. Renato M. Capocelli, Alfredo De Santis
    Tight upper bounds on the redundancy of Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:5, pp:1084-0 [Journal]
  16. Renato M. Capocelli, Alfredo De Santis
    A note on D-ary Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:1, pp:174-0 [Journal]
  17. Renato M. Capocelli, Alfredo De Santis
    New bounds on the redundancy of Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1095-1104 [Journal]
  18. Renato M. Capocelli, Alfredo De Santis
    On the redundancy of optimal codes with limited word length. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:439-0 [Journal]
  19. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the construction of statistically synchronizable codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:407-414 [Journal]
  20. Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano
    Binary prefix codes ending in a "1". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1296-0 [Journal]
  21. Renato M. Capocelli, Alfredo De Santis, Indeer Jeet Taneja
    Bounds on the entropy series. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:134-0 [Journal]
  22. Luca G. Tallini, Renato M. Capocelli, Bella Bose
    Design of some new efficient balanced codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:790-802 [Journal]

  23. Efficient q-ary immutable codes. [Citation Graph (, )][DBLP]


  24. Structure of decoders for multivalued encodings. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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