plural of Bellman-Ford algorithm

(computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.

plural of Las Vegas algorithm

plural of randomized algorithm

plural of Rete algorithm

(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

plural of Reingold-Tilford algorithm

plural of memetic algorithm

plural of Karatsuba algorithm