{"id":"https://openalex.org/W1492783117","doi":"https://doi.org/10.1007/3-540-45811-5_28","title":"On Optimal Hash Tree Traversal for Interval Time-Stamping","display_name":"On Optimal Hash Tree Traversal for Interval Time-Stamping","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1492783117","doi":"https://doi.org/10.1007/3-540-45811-5_28","mag":"1492783117"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45811-5_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45811-5_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045288409","display_name":"Helger Lipmaa","orcid":"https://orcid.org/0000-0001-8393-6821"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Helger Lipmaa","raw_affiliation_strings":["Laboratory for Theoretical Computer Science Department of Computer Science and Engineering, Helsinki University of Technology, P.O.Box 5400, FI-02015, HUT, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Laboratory for Theoretical Computer Science Department of Computer Science and Engineering, Helsinki University of Technology, P.O.Box 5400, FI-02015, HUT, Espoo, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045288409"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8503,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.71448684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.9214324951171875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6110188961029053},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5944422483444214},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.5898042917251587},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5488234758377075},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5474867224693298},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5179113745689392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4775346517562866},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47031155228614807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46016547083854675},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.44148606061935425},{"id":"https://openalex.org/keywords/laplace-transform","display_name":"Laplace transform","score":0.43342167139053345},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.36648035049438477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3027799129486084},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2564617693424225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25569888949394226}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9214324951171875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6110188961029053},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5944422483444214},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.5898042917251587},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5488234758377075},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5474867224693298},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5179113745689392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4775346517562866},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47031155228614807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46016547083854675},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.44148606061935425},{"id":"https://openalex.org/C97937538","wikidata":"https://www.wikidata.org/wiki/Q199691","display_name":"Laplace transform","level":2,"score":0.43342167139053345},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.36648035049438477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3027799129486084},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2564617693424225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25569888949394226},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45811-5_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45811-5_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W47755621","https://openalex.org/W54173073","https://openalex.org/W100509257","https://openalex.org/W1488056159","https://openalex.org/W1493969756","https://openalex.org/W1504341594","https://openalex.org/W1572490578","https://openalex.org/W1676578590","https://openalex.org/W1997911919","https://openalex.org/W2005725110","https://openalex.org/W2134064004","https://openalex.org/W2148588576","https://openalex.org/W2167266655","https://openalex.org/W2752853835","https://openalex.org/W3198160809","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2072316499","https://openalex.org/W2795921908","https://openalex.org/W2749663619","https://openalex.org/W2566588687","https://openalex.org/W3155540153","https://openalex.org/W2949334283","https://openalex.org/W2491277646","https://openalex.org/W2584255950","https://openalex.org/W1492783117","https://openalex.org/W2390988250"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}