This distribution has been tested as part of the cpan-testers effort to test as many new uploads to CPAN as possible. See http://testers.cpan.org/
Please cc any replies to [email protected] to keep other test volunteers informed and to prevent any duplicate effort. -- Dear Mark Nodine, This is a computer-generated report for Text-BibTeX-BibStyle-0.01 on perl-5.10.0 patch 32468, created automatically by CPAN-Reporter-1.06 and sent to the CPAN Testers mailing list. If you have received this email directly, it is because the person testing your distribution chose to send a copy to your CPAN email address; there may be a delay before the official report is received and processed by CPAN Testers. Thank you for uploading your work to CPAN. However, it appears that there were some problems with your distribution. If these results are not what you expect or if you would like to learn how to avoid FAIL reports for missing dependencies, unsupported operating systems, etc., please consult "Notes for CPAN Authors" on the CPAN Testers Wiki: http://cpantest.grango.org Sections of this report: * Tester comments * Program output * Prerequisites * Environment and other context ------------------------------ TESTER COMMENTS ------------------------------ Additional comments from tester: [none provided] ------------------------------ PROGRAM OUTPUT ------------------------------ Output from '/usr/local/bin/make test': PERL_DL_NONLAZY=1 /usr/local/home/david/cpantesting/perl-5.10.0/bin/perl "-MExtUtils::Command::MM" "-e" "test_harness(0, 'blib/lib', 'blib/arch')" t/*.t t/10_built_in....ok t/20_xampl.......bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel bibs/xampl.bib, line 29, warning: 125 characters of junk seen at toplevel ok t/30_html........ # Failed test 'abbrv' # at t/30_html.t line 33. # got: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[1]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[2]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 41(7):73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[3]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # In <em>G-Animal's Journal</em> <a href="#whole-journal">[4]</a>, pages 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[4]</a></td><td> # <em>G-Animal's Journal</em>, 41(7), July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="whole-set">[5]</a></td><td> # D. E. Knuth. # <em>The Art of Computer Programming</em>. # Four volumes. Addison-Wesley, 1968–90. # Seven volumes planned (this is a cross-referenced set of BOOKs). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[6]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, chapter 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[7]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, volume 1 of <em>The Art of Computer Programming</em>, section 1.2, pages 10–119. # Addison-Wesley, Reading, Massachusetts, second edition, 10 Jan. 1973. # This is a full INBOOK entry. # # </td> # <tr valign="top"><td><a name="inbook-crossref">[8]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, section 1.2. # Volume 1 of <em>The Art of Computer Programming</em> <a href="#whole-set">[5]</a>, second edition, 1973. # This is a cross-referencing INBOOK entry. # # </td> # <tr valign="top"><td><a name="book-minimal">[9]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>. # Addison-Wesley, 1981. # # </td> # <tr valign="top"><td><a name="book-full">[10]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>, volume 2 of <em>The Art of Computer Programming</em>. # Addison-Wesley, Reading, Massachusetts, second edition, 10 Jan. 1981. # This is a full BOOK entry. # # </td> # <tr valign="top"><td><a name="book-crossref">[11]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>. # Volume 2 of <em>The Art of Computer Programming</em> <a href="#whole-set">[5]</a>, second edition, 1981. # This is a cross-referencing BOOK entry. # # </td> # <tr valign="top"><td><a name="booklet-minimal">[12]</a></td><td> # The programming of computer art. # # </td> # <tr valign="top"><td><a name="booklet-full">[13]</a></td><td> # J. C. Knvth. # The programming of computer art. # Vernier Art Center, Stanford, California, Feb. 1988. # This is a full BOOKLET entry. # # </td> # <tr valign="top"><td><a name="incollection-minimal">[14]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In <em>High Speed Computer and Algorithm Organization</em>. Academic Press, 1977. # # </td> # <tr valign="top"><td><a name="incollection-full">[15]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors, <em>High Speed Computer and Algorithm Organization</em>, number 23 in Fast Computers, part 3, pages 179–183. Academic Press, New York, third edition, Sept. 1977. # This is a full INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="incollection-crossref">[16]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In Lipcoll et al. <a href="#whole-collection">[17]</a>, pages 179–183. # This is a cross-referencing INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="whole-collection">[17]</a></td><td> # D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors. # <em>High Speed Computer and Algorithm Organization</em>. # Number 23 in Fast Computers. Academic Press, New York, third edition, Sept. 1977. # This is a cross-referenced BOOK (collection) entry. # # </td> # <tr valign="top"><td><a name="manual-minimal">[18]</a></td><td> # <em>The Definitive Computer Manual</em>. # # </td> # <tr valign="top"><td><a name="manual-full">[19]</a></td><td> # L. Manmaker. # <em>The Definitive Computer Manual</em>. # Chips-R-Us, Silicon Valley, silver edition, Apr.-May 1986. # This is a full MANUAL entry. # # </td> # <tr valign="top"><td><a name="mastersthesis-minimal">[20]</a></td><td> # É. Masterly. # Mastering thesis writing. # Master's thesis, Stanford University, 1988. # # </td> # <tr valign="top"><td><a name="mastersthesis-full">[21]</a></td><td> # É. Masterly. # Mastering thesis writing. # Master's project, Stanford University, English Department, June-Aug. 1988. # This is a full MASTERSTHESIS entry. # # </td> # <tr valign="top"><td><a name="misc-minimal">[22]</a></td><td> # This is a minimal MISC entry. # # </td> # <tr valign="top"><td><a name="misc-full">[23]</a></td><td> # J.-B. Missilany. # Handing out random pamphlets in airports. # Handed out at O'Hare, Oct. 1984. # This is a full MISC entry. # # </td> # <tr valign="top"><td><a name="inproceedings-minimal">[24]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="inproceedings-full">[25]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In W. V. Oz and M. Yannakakis, editors, <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, pages 133–139, Boston, Mar. 1983. The OX Association for Computing Machinery, Academic Press. # This is a full INPROCEDINGS entry. # # </td> # <tr valign="top"><td><a name="inproceedings-crossref">[26]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In OXstoc <a href="#whole-proceedings">[27]</a>, pages 133–139. # This is a cross-referencing INPROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="whole-proceedings">[27]</a></td><td> # The OX Association for Computing Machinery. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, Boston, 1983. # This is a cross-referenced PROCEEDINGS. # # </td> # <tr valign="top"><td><a name="proceedings-minimal">[28]</a></td><td> # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="proceedings-full">[29]</a></td><td> # W. V. Oz and M. Yannakakis, editors. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, Boston, Mar. 1983. The OX Association for Computing Machinery, Academic Press. # This is a full PROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="phdthesis-minimal">[30]</a></td><td> # F. P. Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD thesis, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="phdthesis-full">[31]</a></td><td> # F. P. Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD dissertation, Fanstord University, Department of French, June-Aug. 1988. # This is a full PHDTHESIS entry. # # </td> # <tr valign="top"><td><a name="techreport-minimal">[32]</a></td><td> # T. Terrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Technical report, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="techreport-full">[33]</a></td><td> # T. Térrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, Oct. 1988. # This is a full TECHREPORT entry. # # </td> # <tr valign="top"><td><a name="unpublished-minimal">[34]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a minimal UNPUBLISHED entry). # # </td> # <tr valign="top"><td><a name="unpublished-full">[35]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a full UNPUBLISHED entry), Nov., Dec. 1988. # # </td> # <tr valign="top"><td><a name="random-note-crossref">[36]</a></td><td> # Volume 2 is listed under Knuth <a href="#book-full">[10]</a>. # # </td></table> # ' # expected: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[1]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[2]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 41(7):73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[3]</a></td><td> # L. A. Aamport. # The gnats and gnus document preparation system. # In <em>G-Animal's Journal</em> <a href="#whole-journal">[4]</a>, pages 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[4]</a></td><td> # <em>G-Animal's Journal</em>, 41(7), July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="whole-set">[5]</a></td><td> # D. E. Knuth. # <em>The Art of Computer Programming</em>. # Four volumes. Addison-Wesley, 1968–90. # Seven volumes planned (this is a cross-referenced set of BOOKs). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[6]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, chapter 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[7]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, volume 1 of <em>The Art of Computer Programming</em>, section 1.2, pages 10–119. # Addison-Wesley, Reading, Massachusetts, second edition, 10 Jan. 1973. # This is a full INBOOK entry. # # </td> # <tr valign="top"><td><a name="inbook-crossref">[8]</a></td><td> # D. E. Knuth. # <em>Fundamental Algorithms</em>, section 1.2. # Volume 1 of <em>The Art of Computer Programming</em> <a href="#whole-set">[5]</a>, second edition, 1973. # This is a cross-referencing INBOOK entry. # # </td> # <tr valign="top"><td><a name="book-minimal">[9]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>. # Addison-Wesley, 1981. # # </td> # <tr valign="top"><td><a name="book-full">[10]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>, volume 2 of <em>The Art of Computer Programming</em>. # Addison-Wesley, Reading, Massachusetts, second edition, 10 Jan. 1981. # This is a full BOOK entry. # # </td> # <tr valign="top"><td><a name="book-crossref">[11]</a></td><td> # D. E. Knuth. # <em>Seminumerical Algorithms</em>. # Volume 2 of <em>The Art of Computer Programming</em> <a href="#whole-set">[5]</a>, second edition, 1981. # This is a cross-referencing BOOK entry. # # </td> # <tr valign="top"><td><a name="booklet-minimal">[12]</a></td><td> # The programming of computer art. # # </td> # <tr valign="top"><td><a name="booklet-full">[13]</a></td><td> # J. C. Knvth. # The programming of computer art. # Vernier Art Center, Stanford, California, Feb. 1988. # This is a full BOOKLET entry. # # </td> # <tr valign="top"><td><a name="incollection-minimal">[14]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In <em>High Speed Computer and Algorithm Organization</em>. Academic Press, 1977. # # </td> # <tr valign="top"><td><a name="incollection-full">[15]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors, <em>High Speed Computer and Algorithm Organization</em>, number 23 in Fast Computers, part 3, pages 179–183. Academic Press, New York, third edition, Sept. 1977. # This is a full INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="incollection-crossref">[16]</a></td><td> # D. D. Lincoll. # Semigroups of recurrences. # In Lipcoll et al. <a href="#whole-collection">[17]</a>, pages 179–183. # This is a cross-referencing INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="whole-collection">[17]</a></td><td> # D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors. # <em>High Speed Computer and Algorithm Organization</em>. # Number 23 in Fast Computers. Academic Press, New York, third edition, Sept. 1977. # This is a cross-referenced BOOK (collection) entry. # # </td> # <tr valign="top"><td><a name="manual-minimal">[18]</a></td><td> # <em>The Definitive Computer Manual</em>. # # </td> # <tr valign="top"><td><a name="manual-full">[19]</a></td><td> # L. Manmaker. # <em>The Definitive Computer Manual</em>. # Chips-R-Us, Silicon Valley, silver edition, Apr.-May 1986. # This is a full MANUAL entry. # # </td> # <tr valign="top"><td><a name="mastersthesis-minimal">[20]</a></td><td> # É. Masterly. # Mastering thesis writing. # Master's thesis, Stanford University, 1988. # # </td> # <tr valign="top"><td><a name="mastersthesis-full">[21]</a></td><td> # É. Masterly. # Mastering thesis writing. # Master's project, Stanford University, English Department, June-Aug. 1988. # This is a full MASTERSTHESIS entry. # # </td> # <tr valign="top"><td><a name="misc-minimal">[22]</a></td><td> # This is a minimal MISC entry. # # </td> # <tr valign="top"><td><a name="misc-full">[23]</a></td><td> # J.-B. Missilany. # Handing out random pamphlets in airports. # Handed out at O'Hare, Oct. 1984. # This is a full MISC entry. # # </td> # <tr valign="top"><td><a name="inproceedings-minimal">[24]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="inproceedings-full">[25]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In W. V. Oz and M. Yannakakis, editors, <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, pages 133–139, Boston, Mar. 1983. The OX Association for Computing Machinery, Academic Press. # This is a full INPROCEDINGS entry. # # </td> # <tr valign="top"><td><a name="inproceedings-crossref">[26]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis. # On notions of information transfer in VLSI circuits. # In OXstoc <a href="#whole-proceedings">[27]</a>, pages 133–139. # This is a cross-referencing INPROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="whole-proceedings">[27]</a></td><td> # The OX Association for Computing Machinery. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, Boston, 1983. # This is a cross-referenced PROCEEDINGS. # # </td> # <tr valign="top"><td><a name="proceedings-minimal">[28]</a></td><td> # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="proceedings-full">[29]</a></td><td> # W. V. Oz and M. Yannakakis, editors. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, Boston, Mar. 1983. The OX Association for Computing Machinery, Academic Press. # This is a full PROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="phdthesis-minimal">[30]</a></td><td> # F. P. Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD thesis, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="phdthesis-full">[31]</a></td><td> # F. P. Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD dissertation, Fanstord University, Department of French, June-Aug. 1988. # This is a full PHDTHESIS entry. # # </td> # <tr valign="top"><td><a name="techreport-minimal">[32]</a></td><td> # T. Terrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mo>!</mo></mfrac><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Technical report, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="techreport-full">[33]</a></td><td> # T. Térrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mo>!</mo></mfrac><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, Oct. 1988. # This is a full TECHREPORT entry. # # </td> # <tr valign="top"><td><a name="unpublished-minimal">[34]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a minimal UNPUBLISHED entry). # # </td> # <tr valign="top"><td><a name="unpublished-full">[35]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a full UNPUBLISHED entry), Nov., Dec. 1988. # # </td> # <tr valign="top"><td><a name="random-note-crossref">[36]</a></td><td> # Volume 2 is listed under Knuth <a href="#book-full">[10]</a>. # # </td></table> # ' # Failed test 'alpha' # at t/30_html.t line 33. # got: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[Aam86a]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[Aam86b]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 41(7):73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[Aam86c]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # In <em>G-Animal's Journal</em> <a href="#whole-journal">[GAJ86]</a>, pages 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[GAJ86]</a></td><td> # <em>G-Animal's Journal</em>, 41(7), July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="whole-set">[Knu68]</a></td><td> # Donald E. Knuth. # <em>The Art of Computer Programming</em>. # Four volumes. Addison-Wesley, 1968–90. # Seven volumes planned (this is a cross-referenced set of BOOKs). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[Knu73a]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, chapter 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[Knu73b]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, volume 1 of <em>The Art of Computer Programming</em>, section 1.2, pages 10–119. # Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1973. # This is a full INBOOK entry. # # </td> # <tr valign="top"><td><a name="inbook-crossref">[Knu73c]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, section 1.2. # Volume 1 of <em>The Art of Computer Programming</em> <a href="#whole-set">[Knu68]</a>, second edition, 1973. # This is a cross-referencing INBOOK entry. # # </td> # <tr valign="top"><td><a name="book-minimal">[Knu81a]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>. # Addison-Wesley, 1981. # # </td> # <tr valign="top"><td><a name="book-full">[Knu81b]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>, volume 2 of <em>The Art of Computer Programming</em>. # Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1981. # This is a full BOOK entry. # # </td> # <tr valign="top"><td><a name="book-crossref">[Knu81c]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>. # Volume 2 of <em>The Art of Computer Programming</em> <a href="#whole-set">[Knu68]</a>, second edition, 1981. # This is a cross-referencing BOOK entry. # # </td> # <tr valign="top"><td><a name="booklet-minimal">[Knv]</a></td><td> # The programming of computer art. # # </td> # <tr valign="top"><td><a name="booklet-full">[Knv88]</a></td><td> # Jill C. Knvth. # The programming of computer art. # Vernier Art Center, Stanford, California, February 1988. # This is a full BOOKLET entry. # # </td> # <tr valign="top"><td><a name="incollection-minimal">[Lin77a]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In <em>High Speed Computer and Algorithm Organization</em>. Academic Press, 1977. # # </td> # <tr valign="top"><td><a name="incollection-full">[Lin77b]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors, <em>High Speed Computer and Algorithm Organization</em>, number 23 in Fast Computers, part 3, pages 179–183. Academic Press, New York, third edition, September 1977. # This is a full INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="incollection-crossref">[Lin77c]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In Lipcoll et al. <a href="#whole-collection">[LLS77]</a>, pages 179–183. # This is a cross-referencing INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="whole-collection">[LLS77]</a></td><td> # David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors. # <em>High Speed Computer and Algorithm Organization</em>. # Number 23 in Fast Computers. Academic Press, New York, third edition, September 1977. # This is a cross-referenced BOOK (collection) entry. # # </td> # <tr valign="top"><td><a name="manual-minimal">[Man]</a></td><td> # <em>The Definitive Computer Manual</em>. # # </td> # <tr valign="top"><td><a name="manual-full">[Man86]</a></td><td> # Larry Manmaker. # <em>The Definitive Computer Manual</em>. # Chips-R-Us, Silicon Valley, silver edition, April-May 1986. # This is a full MANUAL entry. # # </td> # <tr valign="top"><td><a name="mastersthesis-minimal">[Mas88a]</a></td><td> # Édouard Masterly. # Mastering thesis writing. # Master's thesis, Stanford University, 1988. # # </td> # <tr valign="top"><td><a name="mastersthesis-full">[Mas88b]</a></td><td> # Édouard Masterly. # Mastering thesis writing. # Master's project, Stanford University, English Department, June-August 1988. # This is a full MASTERSTHESIS entry. # # </td> # <tr valign="top"><td><a name="misc-minimal">[Mis]</a></td><td> # This is a minimal MISC entry. # # </td> # <tr valign="top"><td><a name="misc-full">[Mis84]</a></td><td> # Joe-Bob Missilany. # Handing out random pamphlets in airports. # Handed out at O'Hare, October 1984. # This is a full MISC entry. # # </td> # <tr valign="top"><td><a name="inproceedings-minimal">[OUY83a]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="inproceedings-full">[OUY83b]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In Wizard V. Oz and Mihalis Yannakakis, editors, <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, pages 133–139, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. # This is a full INPROCEDINGS entry. # # </td> # <tr valign="top"><td><a name="inproceedings-crossref">[OUY83c]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In OXstoc <a href="#whole-proceedings">[OXstoc83a]</a>, pages 133–139. # This is a cross-referencing INPROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="whole-proceedings">[OXstoc83a]</a></td><td> # The OX Association for Computing Machinery. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, Boston, 1983. # This is a cross-referenced PROCEEDINGS. # # </td> # <tr valign="top"><td><a name="proceedings-minimal">[OXstoc83b]</a></td><td> # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="proceedings-full">[OY83]</a></td><td> # Wizard V. Oz and Mihalis Yannakakis, editors. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. # This is a full PROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="phdthesis-minimal">[PB88a]</a></td><td> # F. Phidias Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD thesis, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="phdthesis-full">[PB88b]</a></td><td> # F. Phidias Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD dissertation, Fanstord University, Department of French, June-August 1988. # This is a full PHDTHESIS entry. # # </td> # <tr valign="top"><td><a name="techreport-minimal">[Ter88a]</a></td><td> # Tom Terrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Technical report, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="techreport-full">[Tér88b]</a></td><td> # Tom Térrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, October 1988. # This is a full TECHREPORT entry. # # </td> # <tr valign="top"><td><a name="unpublished-minimal">[ÜÑP]</a></td><td> # Ulrich Ünderwood, Ned Ñet, and Paul Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a minimal UNPUBLISHED entry). # # </td> # <tr valign="top"><td><a name="unpublished-full">[ÜÑP88]</a></td><td> # Ulrich Ünderwood, Ned Ñet, and Paul Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a full UNPUBLISHED entry), November, December 1988. # # </td> # <tr valign="top"><td><a name="random-note-crossref">[Vol]</a></td><td> # Volume 2 is listed under Knuth <a href="#book-full">[Knu81b]</a>. # # </td></table> # ' # expected: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[Aam86a]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[Aam86b]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # <em>G-Animal's Journal</em>, 41(7):73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[Aam86c]</a></td><td> # L[eslie] A. Aamport. # The gnats and gnus document preparation system. # In <em>G-Animal's Journal</em> <a href="#whole-journal">[GAJ86]</a>, pages 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[GAJ86]</a></td><td> # <em>G-Animal's Journal</em>, 41(7), July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="whole-set">[Knu68]</a></td><td> # Donald E. Knuth. # <em>The Art of Computer Programming</em>. # Four volumes. Addison-Wesley, 1968–90. # Seven volumes planned (this is a cross-referenced set of BOOKs). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[Knu73a]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, chapter 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[Knu73b]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, volume 1 of <em>The Art of Computer Programming</em>, section 1.2, pages 10–119. # Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1973. # This is a full INBOOK entry. # # </td> # <tr valign="top"><td><a name="inbook-crossref">[Knu73c]</a></td><td> # Donald E. Knuth. # <em>Fundamental Algorithms</em>, section 1.2. # Volume 1 of <em>The Art of Computer Programming</em> <a href="#whole-set">[Knu68]</a>, second edition, 1973. # This is a cross-referencing INBOOK entry. # # </td> # <tr valign="top"><td><a name="book-minimal">[Knu81a]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>. # Addison-Wesley, 1981. # # </td> # <tr valign="top"><td><a name="book-full">[Knu81b]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>, volume 2 of <em>The Art of Computer Programming</em>. # Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1981. # This is a full BOOK entry. # # </td> # <tr valign="top"><td><a name="book-crossref">[Knu81c]</a></td><td> # Donald E. Knuth. # <em>Seminumerical Algorithms</em>. # Volume 2 of <em>The Art of Computer Programming</em> <a href="#whole-set">[Knu68]</a>, second edition, 1981. # This is a cross-referencing BOOK entry. # # </td> # <tr valign="top"><td><a name="booklet-minimal">[Knv]</a></td><td> # The programming of computer art. # # </td> # <tr valign="top"><td><a name="booklet-full">[Knv88]</a></td><td> # Jill C. Knvth. # The programming of computer art. # Vernier Art Center, Stanford, California, February 1988. # This is a full BOOKLET entry. # # </td> # <tr valign="top"><td><a name="incollection-minimal">[Lin77a]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In <em>High Speed Computer and Algorithm Organization</em>. Academic Press, 1977. # # </td> # <tr valign="top"><td><a name="incollection-full">[Lin77b]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors, <em>High Speed Computer and Algorithm Organization</em>, number 23 in Fast Computers, part 3, pages 179–183. Academic Press, New York, third edition, September 1977. # This is a full INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="incollection-crossref">[Lin77c]</a></td><td> # Daniel D. Lincoll. # Semigroups of recurrences. # In Lipcoll et al. <a href="#whole-collection">[LLS77]</a>, pages 179–183. # This is a cross-referencing INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="whole-collection">[LLS77]</a></td><td> # David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors. # <em>High Speed Computer and Algorithm Organization</em>. # Number 23 in Fast Computers. Academic Press, New York, third edition, September 1977. # This is a cross-referenced BOOK (collection) entry. # # </td> # <tr valign="top"><td><a name="manual-minimal">[Man]</a></td><td> # <em>The Definitive Computer Manual</em>. # # </td> # <tr valign="top"><td><a name="manual-full">[Man86]</a></td><td> # Larry Manmaker. # <em>The Definitive Computer Manual</em>. # Chips-R-Us, Silicon Valley, silver edition, April-May 1986. # This is a full MANUAL entry. # # </td> # <tr valign="top"><td><a name="mastersthesis-minimal">[Mas88a]</a></td><td> # Édouard Masterly. # Mastering thesis writing. # Master's thesis, Stanford University, 1988. # # </td> # <tr valign="top"><td><a name="mastersthesis-full">[Mas88b]</a></td><td> # Édouard Masterly. # Mastering thesis writing. # Master's project, Stanford University, English Department, June-August 1988. # This is a full MASTERSTHESIS entry. # # </td> # <tr valign="top"><td><a name="misc-minimal">[Mis]</a></td><td> # This is a minimal MISC entry. # # </td> # <tr valign="top"><td><a name="misc-full">[Mis84]</a></td><td> # Joe-Bob Missilany. # Handing out random pamphlets in airports. # Handed out at O'Hare, October 1984. # This is a full MISC entry. # # </td> # <tr valign="top"><td><a name="inproceedings-minimal">[OUY83a]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="inproceedings-full">[OUY83b]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In Wizard V. Oz and Mihalis Yannakakis, editors, <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, pages 133–139, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. # This is a full INPROCEDINGS entry. # # </td> # <tr valign="top"><td><a name="inproceedings-crossref">[OUY83c]</a></td><td> # Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. # On notions of information transfer in VLSI circuits. # In OXstoc <a href="#whole-proceedings">[OXstoc83a]</a>, pages 133–139. # This is a cross-referencing INPROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="whole-proceedings">[OXstoc83a]</a></td><td> # The OX Association for Computing Machinery. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, Boston, 1983. # This is a cross-referenced PROCEEDINGS. # # </td> # <tr valign="top"><td><a name="proceedings-minimal">[OXstoc83b]</a></td><td> # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="proceedings-full">[OY83]</a></td><td> # Wizard V. Oz and Mihalis Yannakakis, editors. # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, number 17 in All ACM Conferences, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. # This is a full PROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="phdthesis-minimal">[PB88a]</a></td><td> # F. Phidias Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD thesis, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="phdthesis-full">[PB88b]</a></td><td> # F. Phidias Phony-Baloney. # <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD dissertation, Fanstord University, Department of French, June-August 1988. # This is a full PHDTHESIS entry. # # </td> # <tr valign="top"><td><a name="techreport-minimal">[Ter88a]</a></td><td> # Tom Terrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mo>!</mo></mfrac><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Technical report, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="techreport-full">[Tér88b]</a></td><td> # Tom Térrific. # An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mo>!</mo></mfrac><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow><mo>)</mo></mrow></mstyle></math> sorting algorithm. # Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, October 1988. # This is a full TECHREPORT entry. # # </td> # <tr valign="top"><td><a name="unpublished-minimal">[ÜÑP]</a></td><td> # Ulrich Ünderwood, Ned Ñet, and Paul Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a minimal UNPUBLISHED entry). # # </td> # <tr valign="top"><td><a name="unpublished-full">[ÜÑP88]</a></td><td> # Ulrich Ünderwood, Ned Ñet, and Paul Pot. # Lower bounds for wishful research results. # Talk at Fanstord University (this is a full UNPUBLISHED entry), November, December 1988. # # </td> # <tr valign="top"><td><a name="random-note-crossref">[Vol]</a></td><td> # Volume 2 is listed under Knuth <a href="#book-full">[Knu81b]</a>. # # </td></table> # ' # Failed test 'ieeetr' # at t/30_html.t line 33. # got: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[1]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[2]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” <em>G-Animal's Journal</em>, vol. 41, pp. 73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[3]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” in <em>G-Animal's Journal</em> <a href="#whole-journal">[4]</a>, pp. 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[4]</a></td><td> # <em>G-Animal's Journal</em>, vol. 41, July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[5]</a></td><td> # D. E. Knuth, <em>Fundamental Algorithms</em>, ch. 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[6]</a></td><td> # D. E. Knuth, <em>Fundamental Algorithms</em>, vol. 1 of <em>The Art of Computer Programming</em>, section 1.2, pp. 10–119. # Reading, Massachusetts: Addison-Wesley, second ed., 10 Jan. 1973. # This is a full INBOOK entry. # # </td> # <tr valign="top"><td><a name="inbook-crossref">[7]</a></td><td> # D. E. Knuth, <em>Fundamental Algorithms</em>, section 1.2. # Vol. 1 of <em>The Art of Computer Programming</em> <a href="#whole-set">[11]</a>, second ed., 1973. # This is a cross-referencing INBOOK entry. # # </td> # <tr valign="top"><td><a name="book-minimal">[8]</a></td><td> # D. E. Knuth, <em>Seminumerical Algorithms</em>. # Addison-Wesley, 1981. # # </td> # <tr valign="top"><td><a name="book-full">[9]</a></td><td> # D. E. Knuth, <em>Seminumerical Algorithms</em>, vol. 2 of <em>The Art of Computer Programming</em>. # Reading, Massachusetts: Addison-Wesley, second ed., 10 Jan. 1981. # This is a full BOOK entry. # # </td> # <tr valign="top"><td><a name="book-crossref">[10]</a></td><td> # D. E. Knuth, <em>Seminumerical Algorithms</em>. # Vol. 2 of <em>The Art of Computer Programming</em> <a href="#whole-set">[11]</a>, second ed., 1981. # This is a cross-referencing BOOK entry. # # </td> # <tr valign="top"><td><a name="whole-set">[11]</a></td><td> # D. E. Knuth, <em>The Art of Computer Programming</em>. # Four volumes, Addison-Wesley, 1968–90. # Seven volumes planned (this is a cross-referenced set of BOOKs). # # </td> # <tr valign="top"><td><a name="booklet-minimal">[12]</a></td><td> # “The programming of computer art.” # # </td> # <tr valign="top"><td><a name="booklet-full">[13]</a></td><td> # J. C. Knvth, “The programming of computer art.” Vernier Art Center, Stanford, California, Feb. 1988. # This is a full BOOKLET entry. # # </td> # <tr valign="top"><td><a name="incollection-minimal">[14]</a></td><td> # D. D. Lincoll, “Semigroups of recurrences,” in <em>High Speed Computer and Algorithm Organization</em>, Academic Press, 1977. # # </td> # <tr valign="top"><td><a name="incollection-full">[15]</a></td><td> # D. D. Lincoll, “Semigroups of recurrences,” in <em>High Speed Computer and Algorithm Organization</em> (D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, eds.), no. 23 in Fast Computers, part 3, pp. 179–183, New York: Academic Press, third ed., Sept. 1977. # This is a full INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="incollection-crossref">[16]</a></td><td> # D. D. Lincoll, “Semigroups of recurrences,” in Lipcoll <em>et al.</em> <a href="#whole-collection">[17]</a>, pp. 179–183. # This is a cross-referencing INCOLLECTION entry. # # </td> # <tr valign="top"><td><a name="whole-collection">[17]</a></td><td> # D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, eds., <em>High Speed Computer and Algorithm Organization</em>. # No. 23 in Fast Computers, New York: Academic Press, third ed., Sept. 1977. # This is a cross-referenced BOOK (collection) entry. # # </td> # <tr valign="top"><td><a name="manual-minimal">[18]</a></td><td> # <em>The Definitive Computer Manual</em>. # # </td> # <tr valign="top"><td><a name="manual-full">[19]</a></td><td> # L. Manmaker, <em>The Definitive Computer Manual</em>. # Chips-R-Us, Silicon Valley, silver ed., Apr.-May 1986. # This is a full MANUAL entry. # # </td> # <tr valign="top"><td><a name="mastersthesis-minimal">[20]</a></td><td> # É. Masterly, “Mastering thesis writing,” Master's thesis, Stanford University, 1988. # # </td> # <tr valign="top"><td><a name="mastersthesis-full">[21]</a></td><td> # É. Masterly, “Mastering thesis writing,” master's project, Stanford University, English Department, June-Aug. 1988. # This is a full MASTERSTHESIS entry. # # </td> # <tr valign="top"><td><a name="misc-minimal">[22]</a></td><td> # This is a minimal MISC entry. # # </td> # <tr valign="top"><td><a name="misc-full">[23]</a></td><td> # J.-B. Missilany, “Handing out random pamphlets in airports.” Handed out at O'Hare, Oct. 1984. # This is a full MISC entry. # # </td> # <tr valign="top"><td><a name="inproceedings-minimal">[24]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="inproceedings-full">[25]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in <em>Proc. Fifteenth Annual ACM Symposium on the Theory of Computing</em> (W. V. Oz and M. Yannakakis, eds.), no. 17 in All ACM Conferences, (Boston), pp. 133–139, The OX Association for Computing Machinery, Academic Press, Mar. 1983. # This is a full INPROCEDINGS entry. # # </td> # <tr valign="top"><td><a name="inproceedings-crossref">[26]</a></td><td> # A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in OXstoc <a href="#whole-proceedings">[29]</a>, pp. 133–139. # This is a cross-referencing INPROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="proceedings-minimal">[27]</a></td><td> # <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, 1983. # # </td> # <tr valign="top"><td><a name="proceedings-full">[28]</a></td><td> # W. V. Oz and M. Yannakakis, eds., <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, no. 17 in All ACM Conferences, (Boston), The OX Association for Computing Machinery, Academic Press, Mar. 1983. # This is a full PROCEEDINGS entry. # # </td> # <tr valign="top"><td><a name="whole-proceedings">[29]</a></td><td> # The OX Association for Computing Machinery, <em>Proc. Fifteenth Annual Symposium on the Theory of Computing</em>, (Boston), 1983. # This is a cross-referenced PROCEEDINGS. # # </td> # <tr valign="top"><td><a name="phdthesis-minimal">[30]</a></td><td> # F. P. Phony-Baloney, <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD thesis, Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="phdthesis-full">[31]</a></td><td> # F. P. Phony-Baloney, <em>Fighting Fire with Fire: Festooning French Phrases</em>. # PhD dissertation, Fanstord University, Department of French, June-Aug. 1988. # This is a full PHDTHESIS entry. # # </td> # <tr valign="top"><td><a name="techreport-minimal">[32]</a></td><td> # T. Terrific, “An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm,” tech. rep., Fanstord University, 1988. # # </td> # <tr valign="top"><td><a name="techreport-full">[33]</a></td><td> # T. Térrific, “An <math><mstyle><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mrow><mo>log</mo><mi>n</mi></mrow></mrow></mfrac><mo>)</mo></mrow></mstyle></math> sorting algorithm,” Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, Oct. 1988. # This is a full TECHREPORT entry. # # </td> # <tr valign="top"><td><a name="unpublished-minimal">[34]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot, “Lower bounds for wishful research results.” Talk at Fanstord University (this is a minimal UNPUBLISHED entry). # # </td> # <tr valign="top"><td><a name="unpublished-full">[35]</a></td><td> # U. Ünderwood, N. Ñet, and P. Pot, “Lower bounds for wishful research results.” Talk at Fanstord University (this is a full UNPUBLISHED entry), Nov., Dec. 1988. # # </td> # <tr valign="top"><td><a name="random-note-crossref">[36]</a></td><td> # Volume 2 is listed under Knuth <a href="#book-full">[9]</a>. # # </td></table> # ' # expected: ' # <h2>References</h2> # # <table> # # <tr valign="top"><td><a name="article-minimal">[1]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” <em>G-Animal's Journal</em>, 1986. # # </td> # <tr valign="top"><td><a name="article-full">[2]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” <em>G-Animal's Journal</em>, vol. 41, pp. 73+, July 1986. # This is a full ARTICLE entry. # # </td> # <tr valign="top"><td><a name="article-crossref">[3]</a></td><td> # L. A. Aamport, “The gnats and gnus document preparation system,” in <em>G-Animal's Journal</em> <a href="#whole-journal">[4]</a>, pp. 73+. # This is a cross-referencing ARTICLE entry. # # </td> # <tr valign="top"><td><a name="whole-journal">[4]</a></td><td> # <em>G-Animal's Journal</em>, vol. 41, July 1986. # The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)). # # </td> # <tr valign="top"><td><a name="inbook-minimal">[5]</a></td><td> # D. E. Knuth, <em>Fundamental Algorithms</em>, ch. 1.2. # Addison-Wesley, 1973. # # </td> # <tr valign="top"><td><a name="inbook-full">[6]</a></td><td> # D. E. Knuth, <em>Fundamental Algorithms</em>, vol.&nb [Output truncated after 50K] ------------------------------ PREREQUISITES ------------------------------ Prerequisite modules loaded: requires: Module Need Have ----------------- ---- ---- HTML::Entities 0 1.35 Text::ASCIIMathML 0 0.7 Text::BibTeX 0 0.37 ------------------------------ ENVIRONMENT AND OTHER CONTEXT ------------------------------ Environment variables: LD_LIBRARY_PATH = /usr/local/lib:/usr/lib:/usr/openwin/lib:/usr/ucblib:. PATH = /usr/local/bin:/usr/bin:/sbin:/usr/sbin:/usr/openwin/bin:/usr/ccs/bin:/usr/ucb:/etc:. PERL5LIB = PERL5_CPANPLUS_IS_RUNNING = 6340 PERL5_CPAN_IS_RUNNING = 6340 SHELL = /bin/bash TERM = screen Perl special variables (and OS-specific diagnostics, for MSWin32): $^X = /usr/local/home/david/cpantesting/perl-5.10.0/bin/perl $UID/$EUID = 10217 / 10217 $GID = 1 1 $EGID = 1 1 Perl module toolchain versions installed: Module Have ------------------- --------- CPAN 1.9205 Cwd 3.25_01 ExtUtils::CBuilder 0.21 ExtUtils::Command 1.13 ExtUtils::Install 1.44 ExtUtils::MakeMaker 6.36_01 ExtUtils::Manifest 1.51_01 ExtUtils::ParseXS 2.18_02 File::Spec 3.25 Module::Build 0.2808_01 Module::Signature n/a Test::Harness 2.64 Test::More 0.72 YAML n/a YAML::Syck n/a version 0.74 -- Summary of my perl5 (revision 5 version 10 subversion 0 patch 32468) configuration: Platform: osname=solaris, osvers=2.9, archname=sun4-solaris-thread-multi uname='sunos ohno.mrbill.net 5.9 generic_122300-03 sun4u sparc sunw,ultra-80 solaris ' config_args='-de -Dprefix=/usr/local/home/david/cpantesting/perl-5.10.0 -Dusethreads' hint=recommended, useposix=true, d_sigaction=define useithreads=define, usemultiplicity=define useperlio=define, d_sfio=undef, uselargefiles=define, usesocks=undef use64bitint=undef, use64bitall=undef, uselongdouble=undef usemymalloc=n, bincompat5005=undef Compiler: cc='cc', ccflags ='-D_REENTRANT -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64', optimize='-O', cppflags='-D_REENTRANT -fno-strict-aliasing -pipe -I/usr/local/include' ccversion='', gccversion='4.2.1', gccosandvers='' intsize=4, longsize=4, ptrsize=4, doublesize=8, byteorder=4321 d_longlong=define, longlongsize=8, d_longdbl=define, longdblsize=16 ivtype='long', ivsize=4, nvtype='double', nvsize=8, Off_t='off_t', lseeksize=8 alignbytes=8, prototype=define Linker and Libraries: ld='cc', ldflags =' -L/usr/local/lib ' libpth=/usr/local/lib /usr/lib /usr/ccs/lib libs=-lsocket -lnsl -lgdbm -ldb -ldl -lm -lpthread -lc perllibs=-lsocket -lnsl -ldl -lm -lpthread -lc libc=/lib/libc.so, so=so, useshrplib=false, libperl=libperl.a gnulibc_version='' Dynamic Linking: dlsrc=dl_dlopen.xs, dlext=so, d_dlsymun=undef, ccdlflags=' ' cccdlflags='-fPIC', lddlflags='-G -L/usr/local/lib'
