A construct named for this person corresponds to the number of runs in each iteration of the perfect 3-file case of polyphase merge sort. Nodes have imbalance plus or minus one in trees named for this person, which are the most unbalanced possible AVL tree. Every codeword ends with 11 (“one-one”) in a self-synchronizing code (-5[1])named for this person. (-5[1])Arrays are split in two using (-5[1])a construct named for this person in a namesake divide-and-conquer technique based on golden-section search. This man names a data structure developed by Fredman and Tarjan, which consists of trees (10[1])whose roots are linked by a circular doubly-linked list. (10[1])That structure speeds up Prim’s and (10[1])Dijkstra’s (-5[1])(“DYKE-struh’s”) algorithms (10[1])and is his (10[1])namesake heap. (10[1])Memoization (10[3])is often illustrated using, for 10 points, what mathematician’s (10[1])namesake sequence, where each term (10[1])is the sum (10[1])of the previous (10[4])two? (10[1])■END■ (10[4])