Open Directory - Computers: Algorithms
See also: This category in other languages: - Special Interest Group on Algorithms and Computation Theory, the ACM special interest group for Theoretical Computer Science. Site has membership information, meetings, reports and a newsletter for members. - A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area. - A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS. - A collection including searching, sorting, tracking, mathematics and cellular automata. In English and Italian. - Links to courses in algorithms maintained at various university computer science departments. - Notes for a course at Carnegie Mellon University. - An initiative of attendees of the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin board, and links to researchers and other resources in the field. The focus is on average case and probabilistic analysis. - Course material, syllabus and notes for a course by Roger Whitney at SDSU. - Lecture notes of a course at San Diego State University. - Resources that describe computer programming algorithms. - Lecture notes by Steven Skiena. - Introduction to data structures, with Java code, by Peter M. Williams. - Lecture notes; applets and code in C, C++, and Java; links regarding books, journals, computability, quantum computing, societies and organizations. - A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references. - Includes a guide how to build it and a JAVA tutorial how to use it. - A introduction to quantum algorithms by Matthew Hayward for those new to the field and who do not have a physics background. - Algorithms lecture notes, courses, tutorials, references, guides and online books. - Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond). - A collection of links for and to researchers in the subject. - Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software. - A list of open problems with updates and solutions. - Links to papers, conferences and other sites, maintained by Helmut Prodinger. - A compilation of links and background information. - This is a collection of implementations for 75 fundamental algorithms problems, including data structures, numerical and combinatorial algorithms,graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages. - An evolving web text in PostScript and PDF, with related software. - Lecture notes and links for a course by Godfried Toussaint.
