Algorithms

A prescribed finite set of well defined rules or processes for the solutions of a problem in a finite number of steps. Explained in simple English, it is the mathematical formula for an operation, such as computing the check digits on packets of data that travel via packet switched networks.

• Top/Science/Math/Combinatorics
• Top/Computers/Computer Science/Theoretical/Quantum Computing
• Top/Computers/Programming

• - Lecture notes; applets and code in C, C++, and Java; links regarding books, journals, computability, quantum computing, societies and organizations.
  
• - Notes for a course at Carnegie Mellon University.
  
• - 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
  
• - A collection of links for and to researchers in the subject.
  
• - Resources that describe computer programming algorithms.
  
• - An algorithm for identifying connected clusters on a lattice where sites may be occupied or non-occupied. With example C code.
  
• - Data structures and code for some important algorithms.
  
• - Links to courses in algorithms maintained at various university computer science departments.
  
• - An evolving web text in PostScript and PDF, with related software.
  
• - Lecture notes of a course at San Diego State University.
  
• - Course Notes, University of Western Australia
  
• - Searchable index of problems, links and methodology.
  
• - Links to papers, conferences and other sites, maintained by Helmut Prodinger.
  
• - A list of open problems with updates and solutions.
  
• - 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.
  
• - Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software.
  
• - Section on Algorithms and Data Structures. A compilation of links.
  
• - A collection including searching, sorting, tracking, mathematics and cellular automata. In English and Italian.
  
• - A brief discussion and implementation of circular queues in C.
  
• - A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area.
  
• - A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
  
• - Introduction to data structures, with Java code, by Peter M. Williams.
  
• - A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS.
  
• - Algorithms lecture notes, courses, tutorials, references, guides and online books.
  
• - Database of algorithms. May be scanned through or can be questioned through a knowledge based assistant. Links to originating web sites.
  
• - Lecture notes and links for a course by Godfried Toussaint.
  
• - A collection of source code for various topics.
  
• - Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond).
  
• - A symbolic computation environment for finite-state machines, regular expressions, and finite languages.
  
• - 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 project to create tools for developing and testing self-stabilizing algorithms.
  
• - Web text by Brian Brown.
  
• - An introduction to quantum algorithms by Matthew Hayward for those new to the field and who do not have an extensive physics background.
  
  

Copyright © 1995-2008 Internet Advertising Solutions, Inc.
Copyright Notice | Privacy Policy | Site Map | APR