[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tse/Aoe89a>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jun-Ichi_Aoe>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F32.31365>
foaf:homepage <https://doi.org/10.1109/32.31365>
dc:identifier DBLP journals/tse/Aoe89a (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F32.31365 (xsd:string)
dcterms:issued 1989 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tse>
rdfs:label An Efficient Digital Search Algorithm by Using a Double-Array Structure. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jun-Ichi_Aoe>
swrc:number 9 (xsd:string)
swrc:pages 1066-1077 (xsd:string)
is dcterms:references of <https://dblp.l3s.de/d2r/resource/publications/journals/tkde/AoeMSP96>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tse/Aoe89a/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tse/Aoe89a>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tse/tse15.html#Aoe89a>
rdfs:seeAlso <https://doi.org/10.1109/32.31365>
dc:subject digital search algorithm; double-array structure; internal array structure; matrix form; list form; arc; digital search tree; DS-tree; worst-case time complexity; key; retrieval; insertion; deletion; nodes; input symbols; constant; computational complexity; data structures; search problems; trees (mathematics) (xsd:string)
dc:title An Efficient Digital Search Algorithm by Using a Double-Array Structure. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 15 (xsd:string)