Succinct representation of dynamic trees-Reference-Cited by-同舟云学术

Succinct representation of dynamic trees

Published:2011-05 Issue:24 Volume:412 Page:2668-2678
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Farzan Arash,Munro J. Ian

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9–13, 2007, Proceedings,2007

2. Representing trees of higher degree;Benoit;Algorithmica,2005

3. Compressed indexes for dynamic text collections;Chan;ACM Trans. Algorithms,2007

4. D.R. Clark, J.I. Munro, Efficient suffix trees on secondary storage (extended abstract), in: ACM–SIAM Symposium on Discrete Algorithms, SODA, 1996, pp. 383–391.

5. A. Farzan, Succinct representation of trees and graphs, Ph.D. Thesis, School of Computer Science, University of Waterloo, 2009.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generation matrix: An embeddable matrix representation for hierarchical trees;Theoretical Computer Science;2023-11

2. Space-Efficient B Trees via Load-Balancing;Lecture Notes in Computer Science;2022

3. Representation of ordered trees with a given degree distribution;Journal of Computer and System Sciences;2021-06

4. Succinct data structure for dynamic trees with faster queries;Theoretical Computer Science;2019-08

5. Biconnectivity, st-numbering and other applications of DFS using O(n) bits;Journal of Computer and System Sciences;2017-12