1 paper
Julius D'souza
A string-like compact data structure for unlabelled rooted trees is given using 2n bits.