A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jpdc/LarmoreP96
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jpdc/LarmoreP96
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lawrence_L._Larmore
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Teresa_M._Przytycka
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1006%2Fjpdc.1996.0067
>
foaf:
homepage
<
https://doi.org/10.1006/jpdc.1996.0067
>
dc:
identifier
DBLP journals/jpdc/LarmoreP96
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1006%2Fjpdc.1996.0067
(xsd:string)
dcterms:
issued
1996
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jpdc
>
rdfs:
label
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lawrence_L._Larmore
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Teresa_M._Przytycka
>
swrc:
number
1
(xsd:string)
swrc:
pages
49-56
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jpdc/LarmoreP96/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jpdc/LarmoreP96
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jpdc/jpdc35.html#LarmoreP96
>
rdfs:
seeAlso
<
https://doi.org/10.1006/jpdc.1996.0067
>
dc:
title
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
35
(xsd:string)