diff options
Diffstat (limited to 'doc/gperf_10.html')
| -rw-r--r-- | doc/gperf_10.html | 74 |
1 files changed, 63 insertions, 11 deletions
diff --git a/doc/gperf_10.html b/doc/gperf_10.html index 736ce2b..cdde570 100644 --- a/doc/gperf_10.html +++ b/doc/gperf_10.html @@ -1,29 +1,81 @@ <HTML> <HEAD> <!-- This HTML file has been created by texi2html 1.51 - from gperf.texi on 15 April 1998 --> + from gperf.texi on 20 August 2000 --> -<TITLE>User's Guide to gperf - 7 Implementation Details of GNU gperf</TITLE> +<TITLE>Perfect Hash Function Generator - 8 Bibliography</TITLE> </HEAD> <BODY> Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_9.html">previous</A>, <A HREF="gperf_11.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. <P><HR><P> -<H1><A NAME="SEC22" HREF="gperf_toc.html#TOC22">7 Implementation Details of GNU <CODE>gperf</CODE></A></H1> +<H1><A NAME="SEC23" HREF="gperf_toc.html#TOC23">8 Bibliography</A></H1> <P> -A paper describing the high-level description of the data structures and -algorithms used to implement <CODE>gperf</CODE> will soon be available. This -paper is useful not only from a maintenance and enhancement perspective, -but also because they demonstrate several clever and useful programming -techniques, e.g., `Iteration Number' boolean arrays, double -hashing, a "safe" and efficient method for reading arbitrarily long -input from a file, and a provably optimal algorithm for simultaneously -determining both the minimum and maximum elements in a list. +[1] Chang, C.C.: <I>A Scheme for Constructing Ordered Minimal Perfect +Hashing Functions</I> Information Sciences 39(1986), 187-195. + +[2] Cichelli, Richard J. <I>Author's Response to "On Cichelli's Minimal Perfect Hash +Functions Method"</I> Communications of the ACM, 23, 12(December 1980), 729. + +[3] Cichelli, Richard J. <I>Minimal Perfect Hash Functions Made Simple</I> +Communications of the ACM, 23, 1(January 1980), 17-19. + +[4] Cook, C. R. and Oldehoeft, R.R. <I>A Letter Oriented Minimal +Perfect Hashing Function</I> SIGPLAN Notices, 17, 9(September 1982), 18-27. </P> +<P> +[5] Cormack, G. V. and Horspool, R. N. S. and Kaiserwerth, M. +<I>Practical Perfect Hashing</I> Computer Journal, 28, 1(January 1985), 54-58. + +[6] Jaeschke, G. <I>Reciprocal Hashing: A Method for Generating Minimal +Perfect Hashing Functions</I> Communications of the ACM, 24, 12(December +1981), 829-833. + +</P> +<P> +[7] Jaeschke, G. and Osterburg, G. <I>On Cichelli's Minimal Perfect +Hash Functions Method</I> Communications of the ACM, 23, 12(December 1980), +728-729. + +</P> +<P> +[8] Sager, Thomas J. <I>A Polynomial Time Generator for Minimal Perfect +Hash Functions</I> Communications of the ACM, 28, 5(December 1985), 523-532 + +</P> +<P> +[9] Schmidt, Douglas C. <I>GPERF: A Perfect Hash Function Generator</I> +Second USENIX C++ Conference Proceedings, April 1990. + +</P> +<P> +[10] Sebesta, R.W. and Taylor, M.A. <I>Minimal Perfect Hash Functions +for Reserved Word Lists</I> SIGPLAN Notices, 20, 12(September 1985), 47-53. +</P> +<P> +[11] Sprugnoli, R. <I>Perfect Hashing Functions: A Single Probe +Retrieving Method for Static Sets</I> Communications of the ACM, 20 +11(November 1977), 841-850. + +</P> +<P> +[12] Stallman, Richard M. <I>Using and Porting GNU CC</I> Free Software Foundation, +1988. + +</P> +<P> +[13] Stroustrup, Bjarne <I>The C++ Programming Language.</I> Addison-Wesley, 1986. + +</P> +<P> +[14] Tiemann, Michael D. <I>User's Guide to GNU C++</I> Free Software +Foundation, 1989. + +</P> <P><HR><P> Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_9.html">previous</A>, <A HREF="gperf_11.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. </BODY> |