** Routing information ( Internet Routing Registry )

** Location Based Routing

** Huawei VRP ( Versatile Routing Platform ), used in routers from Huawei

** Cisco's Overview of Routing between VLANs

** RFC 2545 ( Use of BGP-4 Multiprotocol Extensions for IPv6 Inter-Domain Routing )

** Bank codes and sort codes, like IBAN, and the ABA Routing transit number.

** Cache algorithms

** Strange Attractors and TCP / IP Sequence Number Analysis-One Year Later-a follow-up article demonstrating some of the evolution of various PRNG algorithms over time.

** Formal verification, mathematical proof of the correctness of algorithms

** Evolutionary algorithms

** How can one construct algorithms that can control the generalization ability?

** Completely autonomous security-camera systems with algorithms able to correctly interpret and identify all manner of human behavior

** New features include: support for Secure Hash Algorithm 2. 0 ( SHA2 ) and all advanced hash algorithms that are supported in Windows 2008 R2 ; by default, weaker hash algorithms are disabled.

** OpenCog provides a basic pattern matcher ( on hypergraphs ) which is used to implement various AI algorithms.

** Martin E. Dyer, Alan M. Frieze and Ravindran Kannan for random-walk-based approximation algorithms for the volume of convex bodies.

** Michel X. Goemans and David P. Williamson for approximation algorithms based on semidefinite programming.

** Daniel A. Spielman and Shang-Hua Teng, for smoothed analysis of linear programming algorithms.

** Patrick-Gilles Maillot's Thesis on computer Graphics, pages 52 ( circle ), 53 ( B-Splines ) and respective algorithms pages 95 and 97.

** To provide full access to algorithms and their implementation

** Eunectes murinus, the green anaconda, the largest species, is found east of the Andes in Colombia, Venezuela, the Guianas, Ecuador, Peru, Bolivia, Brazil and on the island of Trinidad.

** Eunectes notaeus, the yellow anaconda, a smaller species, is found in eastern Bolivia, southern Brazil, Paraguay and northeastern Argentina.

** Eunectes deschauenseei, the dark-spotted anaconda, is a rare species found in northeastern Brazil and coastal French Guiana.

** Eunectes beniensis, the Bolivian anaconda, the most recently defined species, is found in the Departments of Beni and Pando in Bolivia.

** Well-ordering theorem: Every set can be well-ordered.

** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.

** Trichotomy: If two sets are given, then either they have the same cardinality, or one has a smaller cardinality than the other.

** The Cartesian product of any family of nonempty sets is nonempty.

** König's theorem: Colloquially, the sum of a sequence of cardinals is strictly less than the product of a sequence of larger cardinals.

** Every surjective function has a right inverse.

** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.

** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.

** Tukey's lemma: Every non-empty collection of finite character has a maximal element with respect to inclusion.

** Antichain principle: Every partially ordered set has a maximal antichain.

** Every vector space has a basis.

** Every unital ring other than the trivial ring contains a maximal ideal.

** For every non-empty set S there is a binary operation defined on S that makes it a group.

** The closed unit ball of the dual of a normed vector space over the reals has an extreme point.

** Tychonoff's theorem stating that every product of compact topological spaces is compact.

** In the product topology, the closure of a product of subsets is equal to the product of the closures.

** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.

** Any union of countably many countable sets is itself countable.