default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenato M. Capocelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j22]Luca G. Tallini, Renato M. Capocelli, Bella Bose:
Design of some new efficient balanced codes. IEEE Trans. Inf. Theory 42(3): 790-802 (1996)- 1994
- [j21]Renato M. Capocelli, Luisa Gargano
, Ugo Vaccaro:
A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. Theor. Comput. Sci. 134(1): 63-78 (1994) - [j20]Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano:
Binary prefix codes ending in a "1". IEEE Trans. Inf. Theory 40(4): 1296-1302 (1994) - 1993
- [j19]Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro:
On the Size of Shares for Secret Sharing Schemes. J. Cryptol. 6(3): 157-167 (1993) - 1992
- [j18]Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro:
On the construction of statistically synchronizable codes. IEEE Trans. Inf. Theory 38(2): 407-414 (1992) - [j17]Renato M. Capocelli, Alfredo De Santis:
On the redundancy of optimal codes with limited word length. IEEE Trans. Inf. Theory 38(2): 439-445 (1992) - 1991
- [j16]Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
Efficient q-ary immutable codes. Discret. Appl. Math. 33(1-3): 25-41 (1991) - [j15]Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
Decoders with Initial State Invariance for Multivalued Encodings. Theor. Comput. Sci. 86(2): 365-375 (1991) - [j14]Renato M. Capocelli, Alfredo De Santis:
A note on D-ary Huffman codes. IEEE Trans. Inf. Theory 37(1): 174-179 (1991) - [j13]Renato M. Capocelli, Alfredo De Santis:
New bounds on the redundancy of Huffman codes. IEEE Trans. Inf. Theory 37(4): 1095-1104 (1991) - [c3]Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro:
On the Size of Shares for Secret Sharing Schemes. CRYPTO 1991: 101-113 - 1990
- [c2]Renato M. Capocelli, Alfredo De Santis:
Minimum codeword length and redundancy of Huffman codes. EUROCODE 1990: 309-317
1980 – 1989
- 1989
- [j12]Renato M. Capocelli, Ugo Vaccaro:
Structure of decoders for multivalued encodings. Discret. Appl. Math. 23(1): 55-71 (1989) - [j11]Renato M. Capocelli:
Comments and additions to 'Robust transmission of unbounded strings using Fibonacci representations' by A. Apostolico and A.S. Fraenkel. IEEE Trans. Inf. Theory 35(1): 191-193 (1989) - [j10]Renato M. Capocelli, Alfredo De Santis:
Tight upper bounds on the redundancy of Huffman codes. IEEE Trans. Inf. Theory 35(5): 1084-1091 (1989) - [j9]Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
An efficient algorithm for testing immutability of variable-length codes. IEEE Trans. Inf. Theory 35(6): 1310-1314 (1989) - [c1]Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
Time Bound for Broadcasting in Bounded Degree Graphs. WG 1989: 19-33 - 1988
- [j8]Renato M. Capocelli, Alfredo De Santis, Inder Jeet Taneja:
Bounds on the entropy series. IEEE Trans. Inf. Theory 34(1): 134-138 (1988) - [j7]Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
On the characterization of statistically synchronizable variable-length codes. IEEE Trans. Inf. Theory 34(4): 817-825 (1988) - 1986
- [j6]Renato M. Capocelli:
Comments on "Threads in the Theory of Codes" by J. Berstel and D. Perrin. Bull. EATCS 30: 43 (1986) - [j5]Renato M. Capocelli, Alfredo De Santis:
Regular universal codeword sets. IEEE Trans. Inf. Theory 32(1): 129-133 (1986) - [j4]Renato M. Capocelli, Raffaele Giancarlo, Inder Jeet Taneja:
Bounds on the redundancy of Huffman codes. IEEE Trans. Inf. Theory 32(6): 854-857 (1986) - 1982
- [j3]Renato M. Capocelli:
A decision procedure for finite decipherability and synchronizability of multivalued encodings. IEEE Trans. Inf. Theory 28(2): 307-317 (1982)
1970 – 1979
- 1979
- [j2]Renato M. Capocelli:
A note on uniquely decipherable codes (Corresp.). IEEE Trans. Inf. Theory 25(1): 90-94 (1979) - 1973
- [j1]Renato M. Capocelli, Aldo de Luca:
Fuzzy Sets and Decision Theory. Inf. Control. 23(5): 446-473 (1973)
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 2024-04-24 22:50 CEST 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:
