The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Netlib Next: Collected Algorithms of the Up: Software systems Previous: LEDA Netlib Netlib is an on-line repository of mathematical software that contains a large number of interesting codes, tables, and papers. Netlib is a compilation of resources from a variety of places, with fairly detailed indices and search mechanisms to help you find what is there. Netlib is important because of its breadth and ease of access. Whenever you need a specialized piece of mathematical software, you should look here first. There are three ways to access netlib: by e-mail, ftp, or WWW: ● E-mail - Netlib provides an email server to send indices and sources on demand. To get an index, send e-mail to netlib@netlib.org with the words send index on its own line in the message. The index will provide a list of other files you can send for. The e-mail server and netlib in general are discussed in [DG87]. ● FTP - Connect by ftp to ftp.netlib.org. Log in as anonymous and use your e-mail address as password. Use ``ls'' to see the contents of a directory, ``cd'' to move to a different directory, and ``get'' to fetch the desired file. Type ``binary'' before ``get'' in order to ensure uncorrupted transmission, and ``quit'' to quit. Obtaining an index first can make it easier to move around. ● WWW - With your favorite browser, open the URL address http://www.netlib.org/ and prowl around to your heart's content. There is a forms index that permits searching based on keywords. GAMS, the Guide to Available Mathematical Software, is an indexing service for Netlib and other related software repositories that can help you find what you want. Check it out at http://gams.nist.gov. GAMS is a service of the National Institute of Standards and Technology (NIST). Netlib pointers ● Collected Algorithms of the ACM file:///E|/BOOK/BOOK5/NODE213.HTM (1 of 2) [19/1/2003 1:32:21]
Netlib Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK5/NODE213.HTM (2 of 2) [19/1/2003 1:32:21]
- Page 607 and 608: Motion Planning There is a wide ran
- Page 609 and 610: Motion Planning often arise in the
- Page 611 and 612: Maintaining Line Arrangements Think
- Page 613 and 614: Maintaining Line Arrangements Next:
- Page 615 and 616: Minkowski Sum where x+y is the vect
- Page 617 and 618: Set and String Problems Next: Set C
- Page 619 and 620: Set Cover Next: Set Packing Up: Set
- Page 621 and 622: Set Cover Figure: Hitting set is du
- Page 623 and 624: Set Packing Next: String Matching U
- Page 625 and 626: Set Packing Notes: An excellent exp
- Page 627 and 628: String Matching shouldn't try. Furt
- Page 629 and 630: String Matching and texts, I recomm
- Page 631 and 632: Approximate String Matching This sa
- Page 633 and 634: Approximate String Matching http://
- Page 635 and 636: Text Compression Next: Cryptography
- Page 637 and 638: Text Compression code string. ASCII
- Page 639 and 640: Cryptography Next: Finite State Mac
- Page 641 and 642: Cryptography ● How can I validate
- Page 643 and 644: Cryptography MD5 [Riv92] is the sec
- Page 645 and 646: Finite State Machine Minimization F
- Page 647 and 648: Finite State Machine Minimization S
- Page 649 and 650: Longest Common Substring than edit
- Page 651 and 652: Longest Common Substring include [A
- Page 653 and 654: Shortest Common Superstring Finding
- Page 655 and 656: Software systems Next: LEDA Up: Alg
- Page 657: LEDA Next: Netlib Up: Software syst
- Page 661 and 662: The Stanford GraphBase Next: Combin
- Page 663 and 664: Algorithm Animations with XTango Ne
- Page 665 and 666: Programs from Books Next: Discrete
- Page 667 and 668: Handbook of Data Structures and Alg
- Page 669 and 670: Algorithms from P to NP Next: Compu
- Page 671 and 672: Algorithms in C++ Next: Data Source
- Page 673 and 674: Textbooks Next: On-Line Resources U
- Page 675 and 676: On-Line Resources Next: Literature
- Page 677 and 678: People Next: Software Up: On-Line R
- Page 679 and 680: Professional Consulting Services Ne
- Page 681 and 682: Index A Up: Index - All Index: A ab
- Page 683 and 684: Index A artists steal ASA ASCII asp
- Page 685 and 686: Index B binary representation - sub
- Page 687 and 688: Index C Up: Index - All Index: C C+
- Page 689 and 690: Index C clustering , , co-NP coding
- Page 691 and 692: Index C consulting services , conta
- Page 693 and 694: Index D Up: Index - All Index: D DA
- Page 695 and 696: Index D Dictionaries dictionaries -
- Page 697 and 698: Index D dynamic programming - appli
- Page 699 and 700: Index E empirical results - heurist
- Page 701 and 702: Index F Up: Index - All Index: F fa
- Page 703 and 704: Index F frequency domain friend-or-
- Page 705 and 706: Index G geometric shortest path , g
- Page 707 and 708: Index H Up: Index - All Index: H ha
Netlib<br />
<strong>Algorithm</strong>s<br />
Mon Jun 2 23:33:50 EDT 1997<br />
file:///E|/BOOK/BOOK5/NODE213.HTM (2 of 2) [19/1/2003 1:32:21]
Change language