# Findings:

- Extended Euclidean algorithm
- Needleman Wunsch algorithm
- Luhn Algorithm
- Metropolis algorithm
- God Algorithm
- Peterson's Algorithm
- Ford-Fulkerson algorithm
- algorithm
- Proof that the greedy algorithm for egyptian fractions terminates
- Cayley-Purser Algorithm
- Markov algorithm
- shortest path algorithm
- Smith Waterman algorithm
- Evolutionary algorithm
- Digital Signature Algorithm
- Merge Sort
- Integer Relation Detection Algorithm
- Shor's Algorithm
- Sim's stripping algorithm
- International Data Encryption Algorithm
- greedy algorithm
- encryption algorithm
- baker's algorithm implementations
- Dijkstra's algorithm
- Booth's Algorithm
- offline algorithm
- Quick Sort
- Las Vegas Algorithm
- Risch Algorithm
- Cohen Sutherland Algorithm
- Floyd-Steinberg Dithering Algorithm
- Logarithm algorithm
- Carnival Booth Algorithm
- Nagle algorithm
- parallel prefix algorithm
- Algorithm for calculating individual hexadecimal digits of pi
- Christian's Algorithm
- Radix Sort
- A* algorithm
- Arithmetic geometric mean algorithm for computing pi
- sorting algorithm
- Strassen algorithm for matrix multiplication
- knapsack algorithm
- Bidirectional Algorithm
- Lempel-Ziv algorithm
- Prim's algorithm
- Berkeley (Gusella & Zatti) Algorithm
- Elevator algorithm
- Hunter-Seeker Algorithm
- Buchberger's algorithm
- Walking Algorithm
- Strassen algorithm for polynomial multiplication
- Algorithm A and A*
- Simplex Algorithm
- RFC 1321
- Floyd's Algorithm
- Kruskal's algorithm
- Lamport's Algorithm
- Selection Sort
- quantum algorithm
- bisection algorithm
- Ledeczi Algorithm
- Rational Algorithm
- Euclid's algorithm
- Brent-Salamin Algorithm
- Earley's Algorithm
- Euclidean ring
- factorizing algorithm
- We exchange stories of almosts, of near deaths, theories on fate and algorithm, probability and God
- Knuth-Morris-Pratt algorithm
- Grover's search algorithm
- Cache-oblivious algorithms
- clipping algorithm
- Binary GCD algorithm
- Breaking the Knapsack Algorithm
- Standard Cryptographic Algorithm Naming
- Euclidean space
- Sorting Algorithms
- Lamarckian genetic algorithm
- ant colony algorithm
- Burrows-Wheeler block-sorting transformation algorithm
- Shell Sort
- Berlekamp-Massey Algorithm
- Infix to postfix conversion algorithm
- Tomasulo's Algorithm
- Van Jacobson algorithm
- Babylonian square root algorithm
- Stutter/Feedback Algorithm
- Karmarkar's Algorithm
- Euclidean vector space
- Painter's Algorithm
- We control the algorithms for all emotions. We will make your steel city cry.
- Zen Sort
- Multiplication algorithm
- Viterbi algorithm
- Bresenham's Algorithm
- card shuffling algorithms
- World's first social algorithm?
- Euclidean geometry
- Heap Sort
- Sorting Algorithms : Rank Sort
- randomized algorithm
- Anytime algorithm
- Douglas-Peucker Algorithm
- Warshall's algorithm
- Prefix to Postfix Conversion Algorithm
- Diffusing update algorithm
- algorithm for generating odd-order magic squares
- Division Algorithm
- online algorithm
- Teaching "Advanced Euclidean Geometry"
- Insertion Sort
- White Trash Encryption Algorithm
- algorithm trace
- The Air Canada Algorithm
- genetic algorithm
- Bailey-Borwein-Plouffe Algorithm
- optimal difference algorithm
- Baby-Step, Giant-Step algorithm

If you Log in you could create a "Euclidean Algorithm" node. If you don't already have an account, you can register here.