Bilgisayar ve İnternet: DMOZ arşiv kayıtları ve alt kategoriler.
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 dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
A collection of links for and to researchers in the subject.
Course material, syllabus and notes for a course by Roger Whitney at SDSU.
Links to courses in algorithms maintained at various university computer science departments.
Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond).
Lecture notes and links for a course by Godfried Toussaint.
A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area.
Algorithms lecture notes, courses, tutorials, references, guides and online books.
Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software.
Lecture notes; applets and code in C, C++, and Java; links regarding books, journals, computability, quantum computing, societies and organizations.
Lecture notes of a course at San Diego State University.
Resources that describe computer programming algorithms.
A collection including searching, sorting, tracking, mathematics and cellular automata. In English and Italian.
Links to papers, conferences and other sites, maintained by Helmut Prodinger.
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.
A list of open problems with updates and solutions.
An evolving web text in PostScript and PDF, with related software.
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.
Lecture notes by Steven Skiena.
A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS.
An integrated C programming environment for reversible execution and logic-based software visualization developed at the University of Rome "La Sapienza".
Tools (Java programs) for visualizing and interacting with theoretical computer science concepts. JAWAA is a tool for creating algorithm animations on the web.
A Java applet designed to teach binary search tree algorithms. It is unique in the way it combines programming, proof, and animation to enhance the learning experience.
Applet and web site for teaching sort algorithms. Includes animation of 11 algorithms and some in-depth studies.
Demonstrate fundamental concepts in Data Structures and Algorithms.
A combinatorial puzzle is presented making visible the performance of a backtracking algorithm (requires JavaScript).
JIVE is an object-oriented general-purpose animation system for the visualization of Java coded algorithms. Visualizations can be embedded in a Java browser or attended in a Virtual Classroom by several users at once.