A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/spire/MilidiuPL99
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/spire/MilidiuPL99
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Artur_Alves_Pessoa
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eduardo_Sany_Laber
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ruy_Luiz_Milidi%E2%88%9A%C4%BC
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSPIRE.1999.796587
>
foaf:
homepage
<
https://doi.org/10.1109/SPIRE.1999.796587
>
dc:
identifier
DBLP conf/spire/MilidiuPL99
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSPIRE.1999.796587
(xsd:string)
dcterms:
issued
1999
(xsd:gYear)
rdfs:
label
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Artur_Alves_Pessoa
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eduardo_Sany_Laber
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ruy_Luiz_Milidi%E2%88%9A%C4%BC
>
swrc:
pages
128-134
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/spire/1999
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/spire/MilidiuPL99/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/spire/MilidiuPL99
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/spire/spire99.html#MilidiuPL99
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SPIRE.1999.796587
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/spire
>
dc:
subject
Data Compression, Prefix Codes, Huffman Tree, Space Usage, Homogenization
(xsd:string)
dc:
title
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document