On Optimal Hash Tree Traversal for Interval Time-Stamping

Helger Lipmaa

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    10 Citations (Scopus)
    Original languageEnglish
    Title of host publicationISC 2002, Sao Paulo, Brazil, 30.9-2.10.
    EditorsAgnes Chan, Virgil Gligor
    Publication statusPublished - 2002
    MoE publication typeA4 Article in a conference publication

    Keywords

    • analysis of algorithms
    • implementation complexity
    • interval time-stamping
    • Laplace's method for integrals
    • tree travesal

    Cite this