My Account
Computers Algorithms
208
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.
More information

Subcategories 18

Related categories 3

A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area.
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 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.
Course material, syllabus and notes for a course by Roger Whitney at SDSU.
Lecture notes of a course at San Diego State University.
Lecture notes by Steven Skiena.
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.
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.
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.
A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS.
Lecture notes by Steven Skiena.
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.
A compilation of links and background information.
An evolving web text in PostScript and PDF, with related software.
Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software.
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.
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; applets and code in C, C++, and Java; links regarding books, journals, computability, quantum computing, societies and organizations.
Lecture notes and links for a course by Godfried Toussaint.
A collection including searching, sorting, tracking, mathematics and cellular automata. In English and Italian.
Course material, syllabus and notes for a course by Roger Whitney at SDSU.
Notes for a course at Carnegie Mellon University.
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.
Lecture notes of a course at San Diego State University.
A collection of links for and to researchers in the subject.
Links to papers, conferences and other sites, maintained by Helmut Prodinger.

Other languages 4

Last update:
March 3, 2021 at 6:55:14 UTC
Computers
Games
Health
Home
News
Recreation
Reference
Regional
Science
Shopping
Society
Sports
All Languages
Arts
Business