On Optimal Hash Tree Traversal for Interval Time-Stamping. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/isw/Lipmaa02a>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Helger_Lipmaa>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F3-540-45811-5%5F28>
foaf:homepage	<https://doi.org/10.1007/3-540-45811-5_28>
dc:identifier	DBLP conf/isw/Lipmaa02a (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F3-540-45811-5%5F28 (xsd:string)
dcterms:issued	2002 (xsd:gYear)
rdfs:label	On Optimal Hash Tree Traversal for Interval Time-Stamping. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Helger_Lipmaa>
swrc:pages	357-371 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/isw/2002>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/isw/Lipmaa02a/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/isw/Lipmaa02a>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/isw/isc2002.html#Lipmaa02a>
rdfs:seeAlso	<https://doi.org/10.1007/3-540-45811-5_28>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/isw>
dc:subject	Analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal. (xsd:string)
dc:title	On Optimal Hash Tree Traversal for Interval Time-Stamping. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document