1. 1. G. Jacobson. Space-efficient static trees and graphs. In FOCS, pages 549–554, 1989.
   2. J. I. Munro. Tables. In FSTTCS, pages 37–42, 1996.
   3. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In SODA, pages 841– 850, 2003.
   4. G. Gottlob and T. Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In KR, 2012.
   5. R. Grossi, A. Gupta, and J. Vitter. High-order entropycompressed text indexes. In Proc. 14th Symposium on Discrete Algorithms (SODA), pages 841–850, 2003
   6. Ladra. Algorithms and Compressed Data Structures for Information Retrieval. PhD thesis, University of A Coruña, 2011.
   7. S. Muthukrishnan. Data streams: Algorithms and applications, 2003. Plenary talk at the 14th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2003).
   8. Bernard Chazelle. Who says you have to look at the input? The brave new world of sublinear computing, 2004. Plenary talk at at the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004).
   9. Scott Aaronson. NP-complete problems and physical reality. SIGACT News, 36(1):30, 2005.
   10. Eric Baum. What is Thought? MIT Press, 2004.
   11. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, and Srinivasa Rao. Representing trees of higher degree. Algorithmica, 43(4):275{292, 2005.
   12. Richard F. Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In SODA '04: Proceedings of the _fiffteenth annual ACM-SIAM symposium on Discrete algorithms, pages 1{10. Society for Industrial and Applied Mathematics, 2004.
   13. Sunil Kumar and Varun Sharma, “Working of Cloud Architecture and Components”, In Proceedings of International Multi Track Conference on Sciences, Engineering & Technical Innovations(IMTC-14), June3- 4,2014, Vol.1, pp.313-316, ISBN: 978-81-929077-0-3.
   14. Gupta, A., Hon, W.K., Shah, R., Vitter, J.S.: Compressed data structures: Dictionaries and data-aware measures. In: Proc. of the 2006 IEEE Data Compression Conference (DCC ’06). (2006)
   15. Yanbin Sun, Yu Zhang, Binxing Fang, Hongli Zhang Succinct and practical greedy embedding for geometric routing Computer Communications, Volume 114, 1 December 2017, Pages 51-61
   16. Dekel Tsur Succinct data structures for nearest colored node in a tree Information Processing Letters, Volume 132, April 2018, Pages 6-10
   17. Sebastian Rudolph Succinctness and tractability of closure operator representations Theoretical Computer Science, Volume 658, Part B, 7 January 2017, Pages 327- 345