1. Abrahams, J.: Code and parse trees for lossless source encoding. In: Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES’97, pp. 145–171. IEEE Comput. Soc., Washington (1997)
2. Adler, M., Demaine, E.D., Harvey, N.J.A., Pǎtraşcu, M.: Lower bounds for asymmetric communication channels and distributed source coding. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’06, pp. 251–260. ACM, New York (2006)
3. Adler, M., Heeringa, B.: Approximating optimal binary decision trees. In: Proceedings of the 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, APPROX’08/RANDOM’08, pp. 1–9. Springer, Berlin (2008)
4. Adler, M., Maggs, B.: Protocols for asymmetric communication channels. J. Comput. Syst. Sci. 63(4), 573–596 (2001)
5. Arkin, E., Meijer, H., Mitchell, J., Rappaport, D., Skiena, S.: Decision trees for geometric models. Int. J. Comput. Geom. Appl. 8(3), 343–364 (1998)