[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/icci/OlariuOW91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/C._Michael_Overstreet>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stephan_Olariu>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Zhaofang_Wen>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-54029-6%5F198>
foaf:homepage <https://doi.org/10.1007/3-540-54029-6_198>
dc:identifier DBLP conf/icci/OlariuOW91 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-54029-6%5F198 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
rdfs:label An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/C._Michael_Overstreet>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stephan_Olariu>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Zhaofang_Wen>
swrc:pages 484-495 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/icci/1991>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/icci/OlariuOW91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/icci/OlariuOW91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/icci/icci1991.html#OlariuOW91>
rdfs:seeAlso <https://doi.org/10.1007/3-540-54029-6_198>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/icci>
dc:subject Algorithms; Binary trees; Ordered trees; PRAM; Parallel algorithms; Traversals (xsd:string)
dc:title An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document