18.04.2013 Views

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Literature<br />

Next: People Up: On-Line Resources Previous: On-Line Resources<br />

Literature<br />

<strong>The</strong>re are many bibliographic sources available on the WWW, but the following I find indispensable.<br />

● Computer Science Bibliographies - This is a collection of over 700,000 references to papers and<br />

technical reports in Computer Science, beneath a sophisticated search engine. While there is much<br />

duplication, this is my first stop whenever I need to look something up. <strong>The</strong> primary site is<br />

http://liinwww.ira.uka.de/bibliography/index.html, although several mirror sites are in operation<br />

around the world. All references are provided in bibtex format.<br />

● Joel Seiferas' paper.lst - References to over 55,000 papers and technical reports (at last count),<br />

mostly on algorithms and related areas of theoretical computer science. Each paper is reduced to a<br />

one-line format, which I find easy to grep through. It is available by anonymous ftp from<br />

ftp.cs.rochester.edu in /pub/u/joel, and a copy is included on the enclosed CD-ROM. Strongly<br />

recommended.<br />

● Geom.bib - <strong>The</strong> complete bibliography on anything related to computational geometry, it<br />

references over 8,000 books, papers, and reports and includes detailed abstracts for many of them.<br />

Grep-ing through geom.bib is an amazingly efficient way to find out about previous work without<br />

leaving your office. It is available via anonymous ftp from ftp.cs.usask.ca, in file<br />

pub/geometry/geombib.tar.Z, and a copy is included on the enclosed CD-ROM.<br />

● Usenet FAQ files - <strong>The</strong> straightest, most accurate dope about any topic is likely to be had in a<br />

USENET frequently asked questions (FAQ) file. Dedicated volunteers maintain FAQ files for<br />

many USENET newsgroups, many of which are quite detailed, and which always emphasize other<br />

on-line resources. Excellent FAQ files on algorithm-related topics such as cryptography, linear<br />

programming, and data compression are currently available. A collection of current FAQ files is<br />

maintained at ftp://rtfm.mit.edu/pub/usenet/news.answers.<br />

<strong>Algorithm</strong>s<br />

Mon Jun 2 23:33:50 EDT 1997<br />

file:///E|/BOOK/BOOK5/NODE228.HTM [19/1/2003 1:32:31]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!