1. Tidy Drawings of Trees
2. ‘Tree drawing algorithms’, M.S. Thesis, Department of Computer Science, University of Illinois, Urbana, IL, Report UIUCDCS-R-81-1055, April 1981. Available as Document UILU-ENG-81-1711 from the College of Engineering Document Center at the University of Illinois.
3. ‘Tidy drawing of M-ary trees’, Report CES-88-24, Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, Ohio, November 1988.
4. ‘Empirical estimates of program entropy’, Report STAN-CS-78-698, Department of Computer Science, Stanford University, Stanford, CA, November 1978. Also issued as Report CSL-78-3, Xerox PARC, Palo Alto, CA, September 1978.
5. The complexity of drawing trees nicely