[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/DillabaughHM12>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Anil_Maheshwari>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Craig_Dillabaugh>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Meng_He>
foaf:homepage <http://dx.doi.org/10.1007%2Fs00453-011-9528-z>
foaf:homepage <http://dx.doi.org/10.1007/s00453-011-9528-z>
dc:identifier DBLP journals/algorithmica/DillabaughHM12 (xsd:string)
dc:identifier DOI 10.1007%2Fs00453-011-9528-z (xsd:string)
dcterms:issued 2012 (xsd:gYear)
swrc:journal <http://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label Succinct and I/O Efficient Data Structures for Traversal in Trees. (xsd:string)
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Anil_Maheshwari>
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Craig_Dillabaugh>
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Meng_He>
swrc:number 1-2 (xsd:string)
swrc:pages 201-223 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/DillabaughHM12/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/DillabaughHM12>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica63.html#DillabaughHM12>
rdfs:seeAlso <http://dx.doi.org/10.1007/s00453-011-9528-z>
dc:title Succinct and I/O Efficient Data Structures for Traversal in Trees. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 63 (xsd:string)