








Search Home : Computers : Algorithms
See Also:
 ACM SIGACT: 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.
 Abstract State Machines: A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area.
 Algorithm Design Paradigms: A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS.
 Algorithms Courses: Links to courses in algorithms maintained at various university computer science departments.
 Algorithms in the Real World: Notes for a course at Carnegie Mellon University.
 Analysis Of Algorithms: 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.
 CATS: Combinatorial Algorithms Test Sets: Searchable index of problems, links and methodology.
 Circular Queues: A brief discussion and implementation of circular queues in C.
 Combinatorial Algorithms: Lecture notes of a course at San Diego State University.
 Combinatorial Algorithms: Course material, syllabus and notes for a course by Roger Whitney at SDSU.
 Computer Programming Algorithms Directory: Resources that describe computer programming algorithms.
 Data Structures: Lecture Notes by Steven Skiena.
 Data Structures: Introduction to data structures, with Java code, by Peter M. Williams.
 Data Structures And Number Systems: Web text by Brian Brown.
 Data Structures and Algorithms: Course Notes, University of Western Australia
 Design and Analysis of Computer Algorithms: Lecture notes; applets and code in C, C++, and Java; links regarding books, journals, computability, quantum computing, societies and organizations.
 Dictionary of Algorithms, Data Structures, and Problems: A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
 Fundamental Algorithms: Data structures and code for some important algorithms.
 HoshenKopelman Algorithm for Cluster Identification: An algorithm for identifying connected clusters on a lattice where sites may be occupied or nonoccupied. With example C code.
 Introduction to Quantum Algorithms: An introduction to quantum algorithms by Matthew Hayward for those new to the field and who do not have an extensive physics background.
 OOPWeb Algorithms Directory: Algorithms lecture notes, courses, tutorials, references, guides and online books.
 On the Road to Algorithms: Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond).
 Pattern Matching Pointers: A collection of links for and to researchers in the subject.
 Priority Queues: Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software.
 Problems in Analysis of Algorithms: A list of open problems with updates and solutions.
 Resources for the Analysis of Algorithms: Links to papers, conferences and other sites, maintained by Helmut Prodinger.
 Selfstabilizing Algorithms: A project to create tools for developing and testing selfstabilizing algorithms.
 Softpanorama Virtual Library: Section on Algorithms and Data Structures. A compilation of links.
 Sourcebank  Computer Science  Algorithms: A collection of source code for various topics.
 Stony Brook Algorithm Repository: 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.
 The Algorithm Base: Database of algorithms. May be scanned through or can be questioned through a knowledge based assistant. Links to originating web sites.
 The Grail Project: A symbolic computation environment for finitestate machines, regular expressions, and finite languages.
 Tree Automata Techniques and Applications: An evolving web text in PostScript and PDF, with related software.
 Web Data Structures and Algorithms: Lecture notes and links for a course by Godfried Toussaint.


 


