Author:
Caminiti Saverio,Petreschi Rossella
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Boppana, V., Hartanto, I., Fuchs, W.K.: Full Fault Dictionary Storage Based on Labeled Tree Encoding. In: Proc. of IEEE VTS, pp. 174–179 (1996)
2. Brent, R.P.: The Parallel Evaluation of General Arithmetic Expressions. J. of ACM 21(2), 201–206 (1974)
3. Caminiti, S.: On Coding Labeled Trees. PhD thesis, Sapienza University of Rome (December 2007)
4. Caminiti, S., Deo, N., Micikevičius, P.: Linear-time Algorithms for Encoding Trees as Sequences of Node Labels. Congr. Num. 183, 65–75 (2006)
5. Caminiti, S., Finocchi, I., Petreschi, R.: On Coding Labeled Trees. TCS 382(2), 97–108 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献