1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
\begin{thebibliography}{10}
\bibitem{BaezaTrees}
R.~A. Baeza-Yates.
\newblock On embedding a binary tree on a hypercube.
\newblock Submitted for publication, November 1988.
\bibitem{Tables}
R.~J. Beach.
\newblock {\em Setting Tables and Illustrations with Style}.
\newblock PhD thesis, University of Waterloo, 1985.
\bibitem{Karlsruhe}
A.~Br{\"u}ggemann-Klein, P.~Dolland, and A.~Heinz.
\newblock How to please authors and publishers: A versatile document
preparation system at {K}arlsruhe.
\newblock In J.~D\'esarm\'enien, editor, {\em {\TeX{}} for Scientific
Documentation}, pages 8--31, Strasbourg, France, June 1986.
\newblock Springer-Verlag Lecture Notes in Computer Science~236.
\bibitem{Exeter}
A.~Br{\"u}ggemann-Klein and D.~Wood.
\newblock Drawing trees nicely with {\TeX}.
\newblock In M.~Clark, editor, {\em Proceedings of the Third European
\TeX{}-Conference}, Exeter, England, July 1988.
\newblock To appear.
\bibitem{BinarySearchTrees}
L.~Devroye.
\newblock A note on the height of binary search trees.
\newblock {\em Journal of the ACM}, 33(3):489--498, July 1986.
\bibitem{BinaryTrees}
Ph. Flajolet and A.~Odlyzko.
\newblock The average height of binary trees and other simple trees.
\newblock {\em Journal of Computer and System Sciences}, 25:171--213, 1982.
\bibitem{DocumentFormatting}
R.~Furuta, J.~Scofield, and A.~Shaw.
\newblock Document formatting systems: Surveys, concepts, issues.
\newblock {\em Computing Surveys}, 14(3):417--472, 1982.
\bibitem{GML}
Ch.~F. Goldfarb.
\newblock A generalized approach to document markup.
\newblock {\em SIGPLAN Notices of the ACM}, 16(6):68--73, June 1981.
\bibitem{KWIFIP}
R.~Klein and D.~Wood.
\newblock On binary trees.
\newblock In G.~Ritter, editor, {\em Proceedings of the 11th World Computer
Congress}, San Francisco, USA, 1989.
\newblock To appear.
\bibitem{ACP}
D.~E. Knuth.
\newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
Programming}.
\newblock Addison-Wesley, Reading, Massachusetts, 1973.
\bibitem{TeXbook}
D.~E. Knuth.
\newblock {\em The {\TeX{}}book}, volume~A of {\em Computers \& Typesetting}.
\newblock Addison-Wesley, Reading, Massachusetts, 1986.
\bibitem{LaTeX}
L.~Lamport.
\newblock {\em {\LaTeX}, User's Guide \& Reference Manual}.
\newblock Addison-Wesley, Reading, Massachusetts, 1986.
\bibitem{OAPD}
Th. Ottmann and P.~Widmayer.
\newblock {\em Algorithmen und Datenstrukturen}.
\newblock Bibliographisches Institut, Mannheim, 1989.
\newblock To appear.
\bibitem{Grif}
V.~Quint, I.~Vatton, and H.~Bedor.
\newblock Grif: An interactive environment for {\TeX{}}.
\newblock In J.~D\'esarm\'enien, editor, {\em {\TeX{}} for Scientific
Documentation}, pages 145--158, Strasbourg, France, June 1986.
\newblock Springer-Verlag Lecture Notes in Computer Science~236.
\bibitem{Scribe}
B.~K. Reid.
\newblock {\em Scribe: A Document Specification Language and its Compiler}.
\newblock PhD thesis, Carnegie Mellon University, 1980.
\bibitem{TidierTrees}
E.~M. Reingold and J.~S. Tilford.
\newblock Tidier drawings of tree.
\newblock {\em IEEE Transactions on Software Engineering}, 7(2):223--228, March
1981.
\bibitem{Complexity}
K.~J. Supowit and E.~M. Reingold.
\newblock The complexity of drawing trees nicely.
\newblock {\em Acta Informatica}, 18(4):377--392, 1983.
\bibitem{TidyTrees}
Ch. Wetherell and A.~Shannon.
\newblock Tidy drawings of trees.
\newblock {\em IEEE Transactions on Software Engineering}, 5(5):514--520,
September 1979.
\end{thebibliography}
|
