RECUT: RE-Compressing partially Unordered Trees
S. Böttcher, R. Hartel, in: 2018 IEEE International Conference on Big Data (Big Data), 2018, pp. 3996–4005.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Department
Publishing Year
Proceedings Title
2018 IEEE International Conference on Big Data (Big Data)
Page
3996-4005
ISBN
LibreCat-ID
Cite this
Böttcher S, Hartel R. RECUT: RE-Compressing partially Unordered Trees. In: 2018 IEEE International Conference on Big Data (Big Data). ; 2018:3996-4005. doi:10.1109/bigdata.2018.8622261
Böttcher, S., & Hartel, R. (2018). RECUT: RE-Compressing partially Unordered Trees. In 2018 IEEE International Conference on Big Data (Big Data) (pp. 3996–4005). https://doi.org/10.1109/bigdata.2018.8622261
@inproceedings{Böttcher_Hartel_2018, title={RECUT: RE-Compressing partially Unordered Trees}, DOI={10.1109/bigdata.2018.8622261}, booktitle={2018 IEEE International Conference on Big Data (Big Data)}, author={Böttcher, Stefan and Hartel, Rita}, year={2018}, pages={3996–4005} }
Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” In 2018 IEEE International Conference on Big Data (Big Data), 3996–4005, 2018. https://doi.org/10.1109/bigdata.2018.8622261.
S. Böttcher and R. Hartel, “RECUT: RE-Compressing partially Unordered Trees,” in 2018 IEEE International Conference on Big Data (Big Data), 2018, pp. 3996–4005.
Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” 2018 IEEE International Conference on Big Data (Big Data), 2018, pp. 3996–4005, doi:10.1109/bigdata.2018.8622261.
Google Scholar
ISBN Search