Representing Trees of Higher Degree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/BenoitDMRRR05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/BenoitDMRRR05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_Benoit
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/J._Ian_Munro
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Raman
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S._Srinivasa_Rao_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Venkatesh_Raman_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-004-1146-6
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-004-1146-6
>
dc:
identifier
DBLP journals/algorithmica/BenoitDMRRR05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-004-1146-6
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Representing Trees of Higher Degree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_Benoit
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/J._Ian_Munro
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rajeev_Raman
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S._Srinivasa_Rao_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Venkatesh_Raman_0001
>
swrc:
number
4
(xsd:string)
swrc:
pages
275-292
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/BenoitDMRRR05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/BenoitDMRRR05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica43.html#BenoitDMRRR05
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-004-1146-6
>
dc:
subject
Data structures; Analysis of algorithms; Succinct data structures; Data compression; Information theory; Cardinal trees; Ordinal trees; Tries; Digital search trees; Dictionary; Hashing
(xsd:string)
dc:
title
Representing Trees of Higher Degree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
43
(xsd:string)