On the isomorphism problem for decision trees and decision lists.
With V. Arvind, Johannes Köbler, Gaurav Rattan, Yadu Vasudev.
Theoretical Computer Science 590:38–54 (2015).

Abstract. We study the complexity of isomorphism testing for Boolean functions that are represented by decision trees or decision lists. Our results include a 2s poly(lg s) time algorithm for isomorphism testing of decision trees of size s. Additionally, we show:

Conference version:
On the isomorphism problem for decision trees and decision lists
With V. Arvind, Johannes Köbler, Gaurav Rattan, Yadu Vasudev.
Fundamentals of Computation Theory (Proceedings of 19th FCT). Springer, 2013. Pp. 16-27.