traversal
101Online creation — Online Creation, also referred to as OLC, Online Coding, Online Building, and online editing, is a software feature of MUDs that allows users to edit a virtual world from within the game itself. In the absence of online creation, content is… …
102Aleksandr Danilovich Aleksandrov — ( ru. Александр Данилович Александров , alternative transliterations: Alexandr or Alexander (first name), and Alexandrov (last name)) (August 4, 1912 ndash;July 27, 1999), was a Soviet/Russian mathematician, physicist, philosopher and mountaineer …
103DC++ — 0.777 running on a Windows 7 Installation Developer(s) Jacek Sieka …
104Teredo tunneling — Teredo is a tunneling protocol designed to grant IPv6 connectivity to nodes that are located behind IPv6 unaware NAT devices. It defines a way of encapsulating IPv6 packets within IPv4 UDP datagrams that can be routed through NAT devices and on… …
105Mephisto Waltzes — For the goth/death rock band, see Mephisto Walz. For the 1971 film, see Mephisto Waltz (film). The Mephisto Waltzes are four waltzes composed by Franz Liszt in 1859 62, 1880–81, 1883 and 1885. Nos. 1 2 were composed for orchestra, later arranged… …
106Session Border Controller — A Session Border Controller is a device used in some VoIP networks to exert control over the signaling and usually also the media streams involved in setting up, conducting, and tearing down calls. Within the context of VoIP, the word Session in… …
107Cache-oblivious algorithm — In computing, a cache oblivious algorithm is an algorithm designed to exploit the CPU cache without having the size of the cache (or the length of the cache lines, etcetera) as an explicit parameter. An optimal cache oblivious algorithm is a… …
108UDP hole punching — In computing, UDP hole punching refers to a commonly used NAT traversal technique.DescriptionNAT traversal through UDP hole punching is a method for establishing bidirectional UDP connections between Internet hosts in private networks using NAT.… …
109Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …
110Threaded binary tree — A threaded binary tree may be defined as follows:A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node, and all left child pointers that would normally be null point to …
