mirror of
https://git.savannah.gnu.org/git/gperf.git
synced 2025-12-02 13:09:22 +00:00
Regenerated.
This commit is contained in:
@@ -1,94 +1,93 @@
|
||||
<HTML>
|
||||
<HEAD>
|
||||
<!-- This HTML file has been created by texi2html 1.51
|
||||
from gperf.texi on 7 May 2003 -->
|
||||
<!-- Created by texi2html 1.56k from gperf.texi on 12 June 2003 -->
|
||||
|
||||
<TITLE>Perfect Hash Function Generator - 7 Bibliography</TITLE>
|
||||
<TITLE>Perfect Hash Function Generator - 7. Bibliography</TITLE>
|
||||
</HEAD>
|
||||
<BODY>
|
||||
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_8.html">previous</A>, <A HREF="gperf_10.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
|
||||
<P><HR><P>
|
||||
|
||||
|
||||
<H1><A NAME="SEC27" HREF="gperf_toc.html#TOC27">7 Bibliography</A></H1>
|
||||
<H1><A NAME="SEC27" HREF="gperf_toc.html#TOC27">7. Bibliography</A></H1>
|
||||
|
||||
<P>
|
||||
[1] Chang, C.C.: <I>A Scheme for Constructing Ordered Minimal Perfect
|
||||
Hashing Functions</I> Information Sciences 39(1986), 187-195.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[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.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[3] Cichelli, Richard J. <I>Minimal Perfect Hash Functions Made Simple</I>
|
||||
Communications of the ACM, 23, 1(January 1980), 17-19.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[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.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[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] Schmidt, Douglas C. <I>GPERF: A Perfect Hash Function Generator</I>
|
||||
C++ Report, SIGS 10 10 (November/December 1998).
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[11] 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>
|
||||
[12] 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>
|
||||
[13] Stallman, Richard M. <I>Using and Porting GNU CC</I> Free Software Foundation,
|
||||
1988.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[14] Stroustrup, Bjarne <I>The C++ Programming Language.</I> Addison-Wesley, 1986.
|
||||
|
||||
</P>
|
||||
|
||||
<P>
|
||||
[15] 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_8.html">previous</A>, <A HREF="gperf_10.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
|
||||
</BODY>
|
||||
|
||||
Reference in New Issue
Block a user