<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\begin{thebibliography}{10}

\bibitem{Ash:1967}
Robert Ash.
\newblock {\em Information Theory}.
\newblock John Wiley \&amp; Sons, New York, 3 edition, 1967.

\bibitem{Balaguer:SEP:2004}
Mark Balaguer.
\newblock Platonism in {Metaphysics}.
\newblock In Edward~N. Zalta, editor, {\em The Stanford Encyclopedia of
  Philosophy}. Summer 2004.

\bibitem{Basili:CACM:1996}
Victor~R. Basili, Lionel~C. Briand, and Walcélio~L. Melo.
\newblock How reuse influences productivity in object-oriented systems.
\newblock {\em Commun. ACM}, 39(10):104--116, 1996.

\bibitem{Ben-David:JCSS:1992}
S.~Ben-David, B.~Chor, O.~Goldreich, and M.~Luby.
\newblock On the theory of average case complexity.
\newblock {\em Journal of Computer and System Sciences}, 44(2):193--219, April
  1992.

\bibitem{Berry:SIGPLAN:1983}
Daniel~M. Berry.
\newblock A new methodology for generating test cases for a programming
  language compiler.
\newblock {\em SIGPLAN Not.}, 18(2):46--56, 1983.

\bibitem{Compton:NATO:1988}
Kevin~J. Compton.
\newblock 0--1 laws in logic and combinatorics.
\newblock In I.~Rival, editor, {\em Proceedings NATO Advanced Study Institute
  on Algorithms and Order}, pages 353--383, Dordrecht, 1988. Reidel.

\bibitem{Cover:1991}
Thomas~M. Cover and Joy~A. Thomas.
\newblock {\em Elements of information theory}.
\newblock Wiley series in telecommunications. John Wiley \&amp; Sons, 1991.

\bibitem{Erdos:AJM:1940}
P.~Erd{\"o}s and M.~Kac.
\newblock The {G}aussian law of errors in the theory of additive number
  theoretic functions.
\newblock {\em Amer. J. Math.}, 62:738--742, 1940.

\bibitem{Frakes:SE:1996}
William~B. Frakes and Christopher~J. Fox.
\newblock Quality improvement using a software reuse failure modes model.
\newblock {\em IEEE Transactions on Software Engineering}, 22(4):274--279,
  April 1996.

\bibitem{Graham:1994}
Ronald~L. Graham, Donald~E. Knuth, and Oren Patashnik.
\newblock {\em Concrete Mathematics: {A} Foundation for Computer Science}.
\newblock Ad{\-d}i{\-s}on-Wes{\-l}ey, Reading, MA, USA, second edition, 1994.

\bibitem{Green:HCI:1989}
T.~R.~G. Green.
\newblock Cognitive dimensions of notations.
\newblock In {\em Proceedings of the HCI'89 Conference on People and Computers
  V}, Cognitive Ergonomics, pages 443--460, 1989.

\bibitem{Griss:IBMSJ:1993}
M.~L. Griss.
\newblock Software reuse: From library to factory.
\newblock {\em IBM Systems Journal}, 32(4):548--566, 1993.

\bibitem{Harremoes:E:2001}
P.~Harrem{\"o}es and F.~Tops\o e.
\newblock Maximum entropy fundamentals.
\newblock {\em Entropy}, 3(3):191--226, 2001.

\bibitem{Heaps:1978}
H.~S. Heaps.
\newblock {\em Information retrieval: theoretical and computational aspects}.
\newblock Academic Press, New York, NY, 1978.

\bibitem{Krueger:CSUR:1992}
Charles~W. Krueger.
\newblock Software reuse.
\newblock {\em ACM Comput. Surv.}, 24(2):131--183, 1992.

\bibitem{Kuck:1978}
D.~Kuck.
\newblock {\em The Structure of Computers and Computations, {Volume 1}}.
\newblock John Wiley and Sons, New York, NY, 1978.

\bibitem{Laemmel:TR:1977}
A.~Laemmel and M.~Shooman.
\newblock Statistical (natural) language theory and computer program
  complexity.
\newblock Technical Report POLY/EE/E0-76-020, Dept of Electrical Engineering
  and Electrophysics, Polytechnic Institute of New York, Brooklyn, August 15
  1977.

\bibitem{Latendresse:IVME:2003}
Mario Latendresse and Marc Feeley.
\newblock Generation of fast interpreters for {Huffman} compressed bytecode.
\newblock In {\em IVME '03: Proceedings of the 2003 workshop on Interpreters,
  virtual machines and emulators}, pages 32--40, New York, NY, USA, 2003. ACM
  Press.

\bibitem{Li:1997}
M.~Li and P.~Vitányi.
\newblock {\em An introduction to Kolmogorov complexity and its applications}.
\newblock Springer-Verlag, New York, 2nd edition, 1997.

\bibitem{Li:HTCS:1990}
M.~Li and P.~M.~B. Vitányi.
\newblock {K}olmogorov complexity and its applications.
\newblock In Jan van Leeuwen, editor, {\em Handbook of Theoretical Computer
  Science}, volume A: Algorithms and Complexity. Elsevier, New York, NY, USA,
  1990.

\bibitem{Li:WWW:2005}
Wentian Li.
\newblock Bibliography on {Zipf's Law}, 2005.
\newblock http://www.nslij-genetics.org/wli/zipf/index.html.

\bibitem{Mohagheghi:ICSE:2004}
Parastoo Mohagheghi, Reidar Conradi, Ole~M. Killi, and Henrik Schwarz.
\newblock An empirical study of software reuse vs. defect-density and
  stability.
\newblock In {\em ICSE '04: Proceedings of the 26th International Conference on
  Software Engineering}, pages 282--292, Washington, DC, USA, 2004. IEEE
  Computer Society.

\bibitem{Poulin:1997}
Jeffrey~S. Poulin.
\newblock {\em Measuring Software Reuse: Princples, Practices, and Economic
  Models}.
\newblock Addison-Wesley, 1997.

\bibitem{Powers:ACL:1998}
David M.~W. Powers.
\newblock Applications and explanations of {Z}ipf's law.
\newblock In Jill Burstein and Claudia Leacock, editors, {\em Proceedings of
  the Joint Conference on New Methods in Language Processing and Computational
  Language Learning}, pages 151--160. Association for Computational
  Linguistics, Somerset, New Jersey, 1998.

\bibitem{Rissanen:1989}
Jorma Rissanen.
\newblock {\em Stochastic Complexity in Statistical Inquiry}, volume~15 of {\em
  Series in Computer Science}.
\newblock World Scientific, 1989.

\bibitem{Ross:1996}
Sheldon~M. Ross.
\newblock {\em Stochastic Processes}.
\newblock John Wiley and Sons; New York, NY, 2nd edition, 1996.

\bibitem{Wortman:1973}
David~Barkley Wortman.
\newblock {\em A study of language directed computer design}.
\newblock PhD thesis, Stanford University, 1973.

\end{thebibliography}
</pre></body></html>