´¨ 3 üÆÜÚ÷ ü¨¤ê ýõ÷ù¦ø induction implication pointer cursor Óã® ýÂÖµ¨ ................ strong induction ................. ýì ýÂÖµ¨ ôÃܵ¨ ........................... Âðù¤ª .............................. Þ÷öØõ ,üÆþÀ÷ Âðù¤ª ................. íµª intersection . . . . . . . . . . . . . . . . . . . . . . . . . . inclusion-exclusion principle zero-one principle .............. pigeonhole principle Euclid üÈþÃê .......................... ý¢Þä üÖê ...................... §ÀÜì .............................. Euclidean ü¨ÀÜì ........................... ý¢ã¬fÀî strictly increasing ............... strictly decreasing ................ üóøÃ÷fÀî concatenation . . . . . . . . . . . . . . . . . . . . . . . . . alphabet algorithm ............................... ........................... ρ-approximation algorithm probabilistic algorithm approximation algorithm greedy algorithm ... ....... ............. ............ ÝÖµÆõ üû¢§¤¢ full array supersink ............... .......................... ....................  ýþ¤ e þ ýþ¤ üÜΨ ýþ¤ .................... éÂðÂd d °ãØõÂd d supersource . . . . . . . . . . . . . . . . . . . . . . . . . . â±õÂdd hyperedge . . . . . . . . . . . . . . . . . . . . . . . . . . . . ñþÂdd constructive proof . . . . . . . . . . . . . . . . ùÀ÷¥¨ ± hypergraph ......................... hypercube union ......................... ............................... set union ........................ ±Ôó .................... ü±þÂÖ Ýµþ¤Úó ÷Êþ ݵþ¤Úó multiway merge polyphase merge external merge in-place merging merge ................ ............ áÞµ äÞ¹õ áÞµ ..................... k-way merge üóÞµ ݵþ¤Úó ×ûÂd d .......................... probabilistic ݵþ¤Úó þ¤ üÞ¹÷ ýþ¤ ë½ó ü±þÂÖ ρ ݵþ¤Úó ........ associative array bucket array ¥Âê üø¡ ßóø ý¢ø¤ø ßþ¡ ................................. ý±î÷ Û¬ .............................. ..... direct-addressing array ´Èð¥ ßþ¡ .................. last-in, first-out dynamic array ñÞäd incremental rectilinear ........... tail recursion ×þ ø ÂÔ¬ Û¬ ............................ operations partition ñÞª ø ¢a¤ Û¬ ... ÂÖµ¨ ............................. weak induction üóÞµ û¤ k ôè¢ û¤À ôè¢ ýÜÂõÀ ôè¢ .................. .................. ü¤¡ ôè¢ ¤¢ ôè¢ ................................ ôè¢ 3 ´¨ 480 bit vector cut ñÀõ ü¨¤Â ................... external algorithm hybrid algorithm minimum cut ........... ©Â e Þî ü¨b¤ ©Â polynomial-time algorithm Þî ©Â nondeterministic algorithm ...................... .................................... dynamic programming off-line ï þ ýÃþ¤õ÷ .......... Í¡öø ............................. íµÈõ ¿õ ßþÂï¤Ã greatest common denominator greatest common divisor bin packing ........................ memoization optimal ¤ª ýÖ ¢¤ê ßÞÜ íÜ .................... optimum ý¤³¨ÂÏ¡ ............................... maximal ú ý¨¨ ýú .............................. ßÈ ............................. È maximum inorder ................ ßú ý¥¨ú ....................... global optimum üó ´ó ßþµú ................................ optimization .................... ù¹÷¥¢ ........................... ............... antisymmetric omicron ü±ÂõÜÆܨ ,ü÷ð¢ ö¤Öµõ¢ ...................... aggregate array index in-branching ............................... ................... ÂÖµ¨ ýþ potential . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...................... Prim Çþ .......................... .......................... backtracking stack öި .................................. postorder postfix ÛÆ÷µ ýÀ÷¥Âê ¤À query . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . derangement ÷þ ¤Àþ ......................... ............................. Ýþ °ÂÅ ¢ÂðÅ ýÀ÷øÅ .................................. µÈ e ãÈ÷ ................. üø¡ ãÈ÷ ................... ý¢ø¤ø ãÈ÷ branch and bound À ø ãÈ÷ ............... ´þóø .............................. first-in, first-out üø¡ ßóø ý¢ø¤ø ßóø ...... µÆþ .................................. üþø¢ø¢ ôô ..................... reflexive ............................. recursion ............................ return .................. collective recursion interval ..... üãÞ¹ ´Èð¥ ÂþÁ©¤ÞªüµÈð¥ ............................ üµÈð¥ ÂþÁ§Öõ¥ ....................... ................................. open interval ..................... semi-open interval partitioning partition ................ ....................... ....................... amortized worst case towers of Hanoi on-line µÆ ýù¥ ¥Þ÷ ýù¥ ýÀÇ¿ .............................. worst-case ... Ç¿ ´ó ßþÂÀ ùÀªßت¨ ´ó ßþÂÀ ................ ý÷eû ýû ................................ collision ù¥ ¥ ýù¥ ....................... closed interval range ü¥ ´Èð¥ ü÷¡Âê ×þ ¥ ´Èð¥ ............ recursively enumerable rescalable ................................. áõ÷ þ¤ (þÞ÷) ÅþÀ÷ ........................... out-branching recursive ................. û±÷ µõ¤ ñÖµ÷ ................ ................. branching priority ÂÚµª±÷ ............................ parameter passing üª¥¤ µõ¤ parent-child ôÞ üö ......................... abstraction static Úõe öøÂØõe ............................. ü¨¤¢ µõ¤ induction basis ÂþÁöØõ ´¿¨ üö ......................... value parameter stable (öÈ÷) Ìõ ............................. reference parameter . . . . . . . . . . . . . . terminal üãÎì ݵþ¤Úó ý¥¨°Âõ ݵþ¤Úó ................................. °Âöõ ,°Âß hierarchical ........... ......................... binary GCD antichain üãÎìÂè ݵþ¤Úó ... ......... ............................ accumulator ýÀã ................................ best-case feasible ýÀµÆ ................................. boolean signature NP-hard .................... Bellman-Ford . . . . . . . . . . . . . . . . . . . . . . block sorting algorithm ýÀµÆ ............................... flow conservation deterministic algorithm NP-complete . . . . . . . . . . . . . . . . . . . . . . . ........................ encapsulation . . . . . . . . . . . . . . . . . . . . . . . succesor (µ¿õ) ð¤ø¢ ݵþ¤Úó ýÜÞÀ öõ¥ ݵþ¤Úó omega (ôô) íµÈõ ÜäôÆÖõ ßþÂï¤Ã ü¤¡ ݵþ¤Úó ............. ........ .................................... minimum vertex cut leaf üµ ¤¢Â .......................... model checking ............................. Í¡Â ¢¤¡Â ................................... ¢Â e üÆÜÚ÷ ü¨¤ê ýõ÷ù¦ø 481 linear order üΡ °Â ...................... ascending order total order ý¢ã¬ °Â ................. ô °Â ......................... descending order combination .............. dynamic °î üÔÎä °î disjunction üÜÊê °î ±î ....................... relaxation ............................. recognizer .............. randomization randomized decidable ý¥¨üê¢Ê ................... üê¢Ê ÂþÁÝÞÊ ......................... ݵþ¤Úó üðÀ» ü±÷¹õ ýÑê üðÀ» asymptotic space complexity time/space complexity Ñê/öõ¥ üðÀ» ..... ü±÷¹õ ü÷õ¥ üðÀ» asymptotic time complexity circuit complexity preorder ¤Àõ üðÀ» ............... °Â Ç .......................... oracle ............................... û¤À ÝÞÊ prefix ............................. ........... multiway decision .............. ÂþÁ÷ÝÞÊ ...................... matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . bipartite matching ...... ýù¤ ÂþÁÝÞÊ partially decidable ÕÎ üÈ¿ø¢ ÕÎ .............. þ üðÀ» complexity . . . . . . . . . . . . . . . . . . . . . . . . . . (ùÀ¨ª) ùÀû¢É¿È .......................... undecidable Ýõ ü¨b¤ Ǫ ..................... ................................ complexity of algorithm Û ª .................................. vertex cover conjunction . . . . . . . . . . . . . . . . . . . . . . combinatorics on-to ¤¢öÂî ýµÈ .................. ................................... üóøÃ÷ °Â .......................... ...................... bridge Àõãµõ ݨ ................. orthogonal drawing bounded stack configuration traversal link ðÇ ýÀ÷øÇ ýÀÂØ ....................... ÇþÞ ............................. À÷ ................................... È üÈ¿ø¢ ÕÎ maximum bipartite matching perfect matching symmetric set difference set difference symmetry ... Û®Ô äÞ¹õ ö¤Öµõ Û®Ô .................. äÞ¹õ Û®Ô ö¤Ö ............................. skew symmetry edge crossing approximation .................... °þ¤ ö¤Ö ...................... üóþ âÏÖ °þÂÖ ........................ Stirling’s approximation divide and conquer ....... Ùóµ¨ °þÂÖ ÛøÝÆÖ ................ iteration .............................. ¤ÂØ singular ............................... ßØ fully persistent ¤ðÀ÷õôÞ .................... alternation ........................... ø alternating ........................... üø sparse balance ý¥¨×ee ...................... ............................... balls and urns tour ×ee ................................. sparsification ................... ö¥ éÂÒ ø .................................... Euler tour ........................ Ûõî ÕÎ .................. difference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ¤ ýÂÜþø ¤ tournament ......................... ´Þ÷¤ description .......................... Ó¬ function potential function partial function hash function unary function ................................ üþà ⠥¨Ýû¤¢ â Àª¤ â ¤Áð â .................. .................. éÀû â ..................... ü÷Úþ â .................................... Fourier transform ................. ô þ¤ê ÛþÀ± âþ¨ ýþ¤ê ÛþÀ± Fast Fourier Transform (FFT) finite Fourier transform competitive analysis .... üûµõ ýþ¤ê ÛþÀ± .............. amortized analysis ............. backward analysis ............... trie üµì¤ Ûܽ üت¨ Ûܽ ¨Å Ûܽ .................................... binary trie ....................... ............................ transitive ...................... partial order .......................... ........... ............. ù¢ú÷ (ý¤ÁðÂ) þ ................................. topological order ýÂc üþø¢ø¢ ýÂc transpose lexicographic Ordering ± ÛÆ÷µ â ..................... objective function permutation .................... transition function total .... ................. .................... growth function â ßõdÂî cd â üþà üµÈð¥ â .............. partial recursive function order register ................................ Ackermann’s function °Â °Â üþ±Ôó °Â üØþ¦ó °Â ..................... üþà °Â 3 ´¨ greedy 482 ý¤¢Æ ....................... arithmetic ........................... Æ ü÷ÀªÛ solvable ............................ circular .............................. unsolvable ÷Êþ .............................. accounting ýÖÜ ü÷ÀÈ÷Û ......................... commutative Java ....................... layout process algebra recursion termination attribute linear ´Èð¥ ýÞ¡ ......... ÊÊ¡ ............................ ................................. automaton .......................... suffix automaton ........... pushdown automaton finite state automaton tree automaton clustering clique ýµÈ ýù¤î¢¡ üûµõ ´ó ýù¤î¢¡ üµ¡¤¢ ýù¤î¢¡ .............. ........... üóܨ ýù¤î¢¡ ............. üûµõ ýù¤î¢¡ cellular automaton finite automaton ù¤î¢¡ ýÀ÷øÅ ýù¤î¢¡ ........ ... üΡ ýÀª¡ ......................... ª¡ ................................ ûù¥¢Â ± ................... separation ......................... hash table ................... û¢Þ÷ ñøÀ connected component partially ordered ÀÝûfþì DZà .. .............. ñø µú ýø´Æ ........... decomposable searching ÂþÁþù ýø´Æ .. .............. breadth first search depth first search ÀÝû DZà °Âõüþà .................. best first search binary search ÀÝû ø¢ DZà .......... strongly connected component ý¥¨À ý¥¨Ýû¤¢ ñøÀ ..................... biconnected component ø ý¤Áðý ............................ symbol table üþ ................................... üþø¢ø¢ ýø´Æ ñø ¼Î¨ ýø´Æ ...... ñø ÕÞä ýø´Æ ......... þÆÞû ßþÂ×þ¢Ã÷ ýø´Æ nearest neighbor search forest ................................. DFS forest .......... disjoint-set forest universe ÛÚ ñø ÕÞä ýø´Æ ÛÚ ......... ................ ùõ ýäÞ¹õ ÛÚ (âÂõ ýäÞ¹õ) öú ¢ database ùÚþù¢¢ ,ö𢢠..................... data structure ü¤¡ ýÑê ¤µ¡¨ù¢¢ external memory data structure elementary data strucutre persistent data structure data type ù¢¨ ¤µ¡¨ù¢¢ ¤ðÀ÷õ ¤µ¡¨ù¢¢ ........................... abstract data type simple data type ........... ÷ðù¢¢ üäõ÷ ý÷ðù¢¢ ............... compound data type .......... ù¢¨ ý÷ðù¢¢ °îÂõ ý÷ðù¢¢ domain ................................ domino ............................... Dijkstra ............................ array entry insertion push ............................... ............................ .................. Euler cycle Hamiltonian cycle polynomial ............. polylogarithmic polyhedron ......... ýÜÞÀ ýù¤µ¨ üãÜ®À üÞµþ¤ÚóÀ .................. ........................ õø¢ þ¤¢ ¤¢ shared memory µÈ ¤¢ ¤¢ external memory üþø¢ø¢ ¤¢ state ............... ü ýÑê .............. ü¤¡ ýÑê ................................. ................. ................................ ¤¢ universal state .................... üø¡ ý¤¢ quadratic .......................... in-degree ...................... 2 ý¤¢ ý¢ø¤ø ý¤¢ .......................... üúøÀ õ¢ accepting state .................... ¡Â üµÜÞû ý¡Â ....................... star-shaped polygon ×û ýÂÜþø ý¡Â .................... ¤¢ out-degree 2-3 tree ................................. ............................... in-place degree ................................. µÆØþ¢ ............................ binary insertion sink cycle ...... ..... ¤µ¡¨ù¢¢ ..................... 2-3 ´¡¤¢ start state average-case delete pop ....................... .................... âõ ´ó áøª ´ó ßÚ÷õ ´ó ................................ ............................. ´ó üµêÂþÁ ´ó éÁ µÈ ¥ éÁ üÆÜÚ÷ ü¨¤ê ýõ÷ù¦ø 483 dual öðø¢ .................................. free tree AVL tree ¤ relation Τ recurrence relation üµÈð¥ ýΤ ............. ßÚÞû üµÈð¥ ýΤ homogeneous recursive relation ßÚÞû÷ üµÈð¥ ýΤ non-homogeneous recursive relation loop invariant vertex ............ ÖÜ ¥ ÛÖµÆõ ýΤ §b¤ ................................. free vertex .......................... Steiner vertex cut vertex Âþµª §b¤ .................... üªÂ §b¤ e µêþÕÎ §b¤ ......................... matched vertex vertices ................ .............................. intractable ......................... computable ....................... quantum computation uncomputable ÂþÁÇ÷þ¤ ÂþÁ÷Ç÷þ¤ ñÞª ø ¢¤ ................ symmetric inclusion-exclusoin . û§b¤ ü÷ÀÈ÷ô¤ üÞµ÷î Ç÷þ¤ .......... .................... inclusion-exclusoin class ¢¥ §b¤ ö¤Öµõ ñÞª ø ¢¤ .................................... complexity class ù¢¤ üðÀ» ýù¢¤ ................ (ü÷÷î) é¤ãµõ üðÀ» ýù¢¤ canonical complexity class graph drawing éÂð ݨ¤ ..................... formal ................................ string ................................. incompressible string µª¤ ü÷ÀÈ÷ù¢ÂÈê ýµª¤ ............................. °ì¤ ................................ ¢¤î¤ adversary record ....... üÞ¨¤ vertex coloring ................ ü¨b¤ ýÃõÙ÷¤ graph coloring ................ éÂð ýÃõÙ÷¤ proper coloring edge coloring ........... ............. û±÷ ©ø¤ ¢ÂðÅ ©ø¤ ý¤¢Æ ©ø¤ ................... bucketing method üÞ¨¤ ©ø¤ ýÀÛΨ ©ø¤ .............................. þø¤ ................................... Èþ¤ procedure root ................. .................... accounting method formal method üóþ ýÃõÙ÷¤ ................... aggregate method backtracking ¥¹õ ýÃõÙ÷¤ ................ garbage collection .................. ü ´¡¤¢ ............................. decision tree .................... directed tree .................. ÝÞÊ ´¡¤¢ ¤¢´ú ´¡¤¢  üþø¢ø¢ ´¡¤¢ e Ûõîf±þÂÖ üþø¢ø¢ ´¡¤¢ full binary tree ............... nearly complete binary tree binary search tree ..... complete binary tree splay tree ø´Æ üþø¢ø¢ ´¡¤¢ ....... Ûõî üþø¢ø¢ ´¡¤¢ ...... ñ¢ãõ üþø¢ø¢ ´¡¤¢ equivalent binary tree üÜc³¨ ´¡¤¢ c ¤±ä ´¡¤¢ ...................... expression tree .................. spanning tree ......... minimum spanning tree ª ´¡¤¢ ,ÂðÂê ´¡¤¢ Þî ÂðÂê ´¡¤¢ ..... ù¨ ÃõÂì ´¡¤¢ red-black tree ................ complete tree .................... general tree k-d tree ......................... partially ordered tree verification ±õ ´¡¤¢ °ÂõÞ÷ ´¡¤¢ ......... .................... ßÞêû ´¡¤¢ ...................... ü¹¨üµ¨¤¢ Huffman tree ......................... öÀ Ýû¤¢ ........................... ý¥¨Ýû¤¢ interleave hashing üÜî ´¡¤¢ ý¢üî ´¡¤¢ ......................... radix tree Ûõî ´¡¤¢ ....................... open hashing ¥ ý¥¨Ýû¤¢ ................... dynamic hashing double hashing ............... ............... þ ý¥¨Ýû¤¢ ÷ðø¢ ý¥¨Ýû¤¢ ´¡÷×þ ø ù¢¨ ý¥¨Ýû¤¢ simple uniform hashing universal hashing perfect hashing reachability simple statement tail ........... ý¨¨ ý¥¨Ýû¤¢ ................ Ûõî ý¥¨Ýû¤¢ ü¨¤´¨¢ ........................ .................. ù¢¨ ¤µ¨¢ ..................................... sequence .............................. probe sequence binary ................. rotation ô¢ e ó±÷¢ ü¨¤ø ýó±÷¢ üþø¢ø¢ ............................... ö¤ø d ¢d üØ ö¤ø¢d d ¢Âð² ö¤ø d d¢ .............................. single rotation left-rotate ..................... ...................... right-rotate bidirectional üø¤ó¥ ý¥ ´¡¤¢ § ü ´¡¤¢ ....................... ÷ðø¢ ö¤ø d ¢d ¢Â𴨤 ö¤ø d d¢ . . . . . . . . . . . . . . . . . . . . . . . . . þ¨ø¢ double rotation ¥ ´È𥠴¡¤¢ .................. ........................ B+-tree B-tree ñc.ýø.ýc ´¡¤¢ ..................... game tree Âþµª ´¡¤¢ ..................... recursion tree ............................... ¢¥ ´¡¤¢ .......................... Steiner tree .................. ................... two-dimensional ..................... ýÀã ø¢ e 3 ´¨ 484 flow network ...................... pseudo-random .................... psuedo poluynomial pseudo-code language üê¢Ê±ª formal language ýÜÞÀ ±ª ........... À .......................... simulation ......................... associative ............... counter ¤ª ýرª ý¥¨±ª (üÞ¹÷) ýÂþÁ´îª ùÀ÷¤Þª ............................. program counter õ÷ ýùÀ÷¤Þª .............. ýÜÞÀ °þÂÖ ýÞª ............ scheduling slope .................................. object oriented °ª Âðüª b ....................... makespan ................. run time queue waiting time ´¡Øþ ý¢ã¬ ¤Ñµ÷ öõ¥ ...................... ¾¨ öõ¥ polynomial time circular queue ...... Ó¬ nondeterministic polynomial time chain ¨ø¢ Ó¬ ¨ø¢ Ó c ¬ nullary Markov chain subset ............... ........................... ............................ proper subset ................ Byzantine generals ........................ ............. transitive reduction ............. üΡ ® .................... üþ¤î ´÷Þ® overflow ........................ ìÏ ................................. ........................ ............................. ´êÂÒ Â¨ ù¨ °Â¼Î¨ bucket ................................ ÛΨ ceiling ................................ ÓÖ¨ hierarchical à Ãþ¤Â¨ ùÀªßت¨ .................................... level-order ............................... þ ý c ¥¨ù¢¨ ´Æó¨ ,Àþ¨ .............................. amortized proper ¯ ............... µêþ´¡¨ ýΤ ¤µ¡¨ relational structure head ............... ü÷Úþ ,ü±ÂõÜÆܨ cellular ............................... üóܨ trinary .............................. üþ¨ black-height ...................... áÔ¤ ù¨ © á expression üõø¤ ýûñÂ÷¦ ............. § header, sentinel capacity ù¨ ýäÞ¹õÂþ¥ ¦ structured self-loop éÂðÂþ¥ äÞ¹õÂþ¥ ¤¢öÂî Ó¬ .................. .......... ´¡¤¢Âþ¥ ........................... ................... performance guarantee éî¤õ ýù¹÷¥ ................ üªÂ ý½Ô¬ e . . . . . . . . . . . . . . . . . . . . . . . . . . . . . üþÂÔ¬ linear product ù¹÷¥ ................................ ýÖÜ Ó¬ ................... doubly-ended queue cutting plane ýù¹÷¥ chaining . . . . . . . . . . . . . . . . . . . . . . . . . . . . üþø¢ø¢ ´þóø Ó¬ deque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . bounded queue ýÜÞÀ öõ¥ .............. ´þóø Ó¬ ................... binary priority queue  öõ¥ ....................... response time subgraph ................................. priority queue ¤î ßþ¡ ôÞ öõ¥ ........................... subtree « monotonically increasing . . . . . . äÞ¹õ Â¥c d ýÀöõ¥ ......................... üãÎìÂè ýÜÞÀ öõ¥ ñÞª ôÀä ø ñÞª .......... (ý¤¬) üÞ¨¤ ö¥ superset . . . . . . . . . . . . . . . . . . . . . . . . . . polynomial approximation scheme inclusion exclusion ö¥ ............................... ............................ chromatic number .................. Fibonacci number ............... ¤±ä üÚ÷¤ ¢Àä ü÷±ê ¢Àä flow .................................... blocking flow ..................... multi-commodity flow ........... ¤ª ý¢ÀÆ÷ ¤ª üþîÀ ¤ª lattice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . رª üÆÜÚ÷ ü¨¤ê ýõ÷ù¦ø 485 cutting theorem ................. Cook’s theorem .................. diameter üªÂ ýÌì e íî ýÌì ÂÎì ............................... diagonalization deterministic strongly connected constraint ö¢Âî ýÂÎì ................... üãÎì .......................... ÀÝûfþì ................. ............................... Àì Catalan’s number ................. operator total üþ¤î Úõ ¤î ..................... .................................. convolution reduction ................ unary operator .................. ............................ À÷øÛÞä operation ............................ ÜÞä bound ...... polynomially bounded ü±÷¹õ ý öÂî Euclidean distance ............ ßþ öÂî ýÜÞÀ öÂî üÞµþ¤Úó ýÜÞÀ öÂî polylogarithmically bounded asymptotic bound Kruskal .. ü±÷¹õ ýµÆ öÂî ................ ü±÷¹õ öÂî ñبøÂî ............................ ................................... Óî .................................... ÀÜî arc .................................... öÞî auxiliary ............................. üØÞî minimal ............................... ßÞî minimization ...................... ý¥¨Þî minimum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . shortest path .................. Þî ÂÆõ ßþÂùî bÀ±õ ×þ ¥ ÂÆõ ßþÂùî single-source shortest-path ÀÊÖõ ×þ ÂÆõ ßþÂùî ý¢Þä üÖê ýܬê ü¨ÀÜì ýܬê üµúõ ýܬê ............ ............................ Ûþ¤µîê ................................ ü÷¡Âê factorial ............................... öÂÂê .................................. À÷¥Âê Fortran child key floor Manhattan distance call Õì¢÷ ,ý¥ê ............................ ........ ......... asymptotically tight bound fuzzy rectilinear distance ü±÷¹õ ßþ öÂî ...... üãÎìÂè é öÂî ....................... asymptotic lower bound .................... Ûõî ýÂð Àî ........................... ................................. lower bound þÍÜè ........................ nondeterministic ×þÀ Çûî ........... asymptotic upper bound spell-checker ý¥¨ù¢¨ ,Çûî .................... Gray code ü÷Úþ ÂðÛÞä operands ö¦ó÷î ......................... many-one reduction üþø¢ø¢ ÂðÛÞä binary operator å ............................. punched card ÕÞä ÂðÛÞä ............................. í efficiency öî ¢Àä depth . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . induction hypothesis fractal ÂÖµ¨ Âê .............. ñµîÂê ............................... Stirling’s formula Ùóµ¨ ñõÂê .............. traveling salesman .......... ¢Âðù¤ø¢ ýùÀªøÂê ü¨ÀÜì ¢Âðù¤ø¢ ýùÀªøÂê Euclidean traveling salesman dictionary ...................... compaction ýù¢¢ ÙûÂê ....................... path compression incompressible ............. ü÷ÀÈ÷ù¢ÂÈê ................... Flavius Josephus ............ ý¥¨ù¢ÂÈê ÂÆõ ý¥¨ù¢ÂÈê §ê¥ø¦ §þø ê Floyd-Warshall .................. ñª¤ø ÀþÜê Ford-Fulkerson ................. ߨÂØóê ¢¤ê dining philosophers .......... ¨Âð ýûéÆÜê single-destination shortest-path §b¤ ø¢ Âû ß ÂÆõ ßþÂùî all pairs shortest path ë §b¤ø¥ ×þ ß ÂÆõ ßþÂùî reachable single-pair shortest-path ùÀ÷Â𤢠ÛεÆõ ßþÂ×î brute force coNP ....................... íµÈõ ÂÌõ ßþÂ×î ......................... ............................... predecessor ..................... Àþ¢ Ûì Â÷¤û ö÷ì ............................ üܱì ü ýùÀ÷õüì ýÌì ÷¤î¤î üöc î üþ´¨¢ Ûì .............................. Horner’s rule minimum bounding box least common multiple visible Chinese remainder theorem 3 ´¨ 486 continuous knapsack ñ pigeonhole logarithmic list ý±î÷ ........................ iterated logarithm ´Æó ×þ ø ÂÔ¬ üµÈóî ï ýÀ÷ ´Æó ....................... .......... þ¨ø¢ ýÀ÷ ´Æó induction step ...................... ........ þ¨ø¢ ýÀ÷ ´Æó state transition .................... two-way linked list .... ö¤Öµõ ýÀ÷ ´Æó .......... °Âõ ýÀ÷ ´Æó symmetrically linked list ordered linked list singly linked list .............. ÂþÁÝÆÖ üµÈóî üÞµþ¤Úó ......................... doubly linked list ......... ý¤ÂØ Ýµþ¤Úó .............. ................................... linked list 0-1 knapsack µ¨ üµÈóî ........... fractional knapsack .......... þ¨×þ ýÀ÷ ´Æó transition graph .................. (´ã®ø Âç) ¤Áð Eulerian graph ýÂÜþø éÂð .................. ..................... ýÖÜ ´Æó labeled graph ................ two-way list ..................... þ¨ø¢ ´Æó conflict graph .................... sparse graph ...................... general list .............. ýÂþÁ´îª ´Æó üÜî ´Æó ........................ unsorted list °Âõ÷ ´Æó .................... adjacency list ý¤Ýû ´Æó ................. matrix ÅþÂõ ü·Ü·õ fÀî ÅþÂõ strictly upper triangular matrix ü·Ü·õ ßþfÀî ÅþÂõ strictly lower triangular matrix upper triangular matrix ........ lower triangular matrix ....... ü·Ü·õ ÅþÂõ ü·Ü·õßþ ÅþÂõ sparse matrix .................... square matrix ................... ragged matrix uniform matrix ............. .............. random access machine Turing machine state machine persistent order ¤Þû÷ ÅþÂõ ý¤Ýû ÅþÂõ ´¡÷×þ ÅþÂõ üê¢Ê ü¨¤´¨¢ ߪõ ................. .................... finite state machine ×ee ÅþÂõ üãÂõ ÅþÂõ üÜεÆõ ÅþÂõ ............ ................. adjacency matrix ......... Ùþ¤ ߪõ ´ó ߪõ üûµõ ´ó ߪõ ............................ ¤ðÀ÷õ ................... öø¤¢  üµ±õ transducer ............................. symmetric ............................ text ±Âõ .................................. interior-based ñÀ c ±õ d ö¤Öµõ .................................... triangulation asymptotically disjoint aggregate digraph ....................... ßµõ ýÀ¶Ü·õ ....................... ü±÷¹õ ................................ ............................ ùõ áÞ¹õ ¤¢°Æ éÂð âÏÖ éÂð ×ee éÂð þ üþà éÂð ....... ¤¢´ú éÂð ........................ directed graph .................. ¤¢´ú éÂð oriented graph ................. ¤¢´ú éÂð ÷ðÀ éÂð ..................... bipartite graph .............................. rectangular matrix partially dynamic graph multigraph ô éÂð ................................. circular list association list ÂÖµ¨ ôð ´ó ¤Áð üÈ¿ø¢ éÂð ................. biconnected graph undirected graph .. layered graph ý¡Â÷ ¤¢´ú éÂð ............. strongly connected graph complete graph ÀÝûø¢ éÂð .............. directed acyclic graph ...... ¤¢´úÂè éÂð ÀÝûfþì éÂð Ûõî éÂð .................... ................... ùÀªþ éÂð dense graph ...................... Ýîµõ éÂð planar graph ..................... ¼ÎÆõ éÂð ÝÖµÆõ ¯Î¡ ¼ÎÆõ éÂð planar straight-line graph acyclic graph .................. weighted graph connected graph bag turn ¤¢ö¥ø éÂð .................. .................. ÀÝû éÂð (÷ðÀ ýäÞ¹õ) þ¢Âð ©¢Âð ................................. randomized rounding node ý¡Â÷ éÂð .................. ......... üê¢Ê ö¢Âî ¢Âð ................................... ùÂð internal node ...................... üÜ¡¢ ùÂð balanced node ..................... ö¥µõ ùÂð expansion walk ........................... ©ÂµÆð .................................. ´Èð ............................ ùðÜð assignment .......................... ©¤Þð certificate ............................ üûð bottleneck üÆÜÚ÷ ü¨¤ê ýõ÷ù¦ø 487 radix sort ........... linear probing sort heapsort ...... üΡ ü¨¤ø ý¥¨°Âõ üõÂû ý¥¨°Âõ ý¤õ ý±Âõ .................. ÛÖ ÃîÂõ ............................ circuit value problem decision problem path ............ ............. ý¥¨¼ÎÆõ hidden Markov model ....... ¼ÎÆõ ö¢ ¼ÎÆõ ÂÆõ üÈþÃê ÂÆõ latin square ß âÂõ û¤ k üõè¢ ý¥¨°Âõ ...... polyphase merge sort Àõe Ç÷þ¤ ñÀõ üõè¢ ý¥¨°Âõ .................. k-way merge sort ¤Àõ üÔ¿õ éî¤õ ñÀõ ........................ merge sort ¤½õ .. ù¥êÀ üõè¢ ý¥¨°Âõ ü¤¡ üõè¢ ý¥¨°Âõ ýÂÜþø ÂÆõ external merge sort .... ü÷½ ÂÆõ two-way merge sort .... û¤ø¢ üõè¢ ý¥¨°Âõ .. ü÷¨÷ üõè¢ ý¥¨°Âõ .................. üø ÂÆõ oscillating merge sort üÜ¡¢ ÂÆõ selection sort ýÖÜ ÂÆõ ù¢¨ ÂÆõ ........................ ....... Þ÷´ªÂ¨ ýó¢ãõ ........... üõø¤ ýùÀûãõ ö¨ ýÞãõ prisoner’s dilemma . . . . . . . . . . . . . . . ÛÊÔõ d d . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ÂãÖõ articulation vertex .................... facility location ............. ÷Êþ ýÔªØõ ................. úÆ öØõ ¢øÀ½õ ´êÂÒ úÆ öØõ capacitated facility location ................. .... exchange sort .............. topological sort distribution sort bubble sort üÌþã ý¥¨°Âõ üØþ¦ó ý¥¨°Âõ .......... üãþ¥ ý¥¨°Âõ ............ ü± ý¥¨°Âõ .................. bidirectional bubble sort þ¨ø¢ ü± ý¥¨°Âõ þ¨ø¢ ü± ý¥¨°Âõ double-direction bubble sort external sort brick sort ü¤¡ ý¥¨°Âõ ................ üµÈ¡ ý¥¨°Âõ ................... õ¥¢¡ ý¥¨°Âõ ........... ................. in-place sort .................. insertion sort ................ bÀ±õ ,â±õ ü÷õ¥ ÕÎõ ÝÑõ üê¢Ê ¢Àä Àócõ d ÀÝûßÈ ýÔóõ b maximally connected component ........ ............ ............................... ............................... Âðöõ ýÀ÷øöõ Ûõî ýõ÷ ýÀ÷øöõ infix with complete paranthesis .......................... ¤¢ ý¥¨°Âõ ü¤¢ ý¥¨°Âõ üΡ ü¤¢ ý¥¨°Âõ ...... binary insertion sort ... üþø¢ø¢ ü¤¢ ý¥¨°Âõ .. ÝÖµÆõ ü¤¢ ý¥¨°Âõ straight insertion sort tree sort ÷óù¢¨ ý¥¨°Âõ ............... ..................... external quicksort balanced quicksort bin sort üµ¡¤¢ ý¥¨°Âõ .................... quicksort ...... ...... ö¥µõ âþ¨ ý¥¨°Âõ .................. counting sort .............. .... üÜΨ ý¥¨°Âõ üÜΨ ý¥¨°Âõ üª¤Þª ý¥¨°Âõ .................... non-comparison sort âþ¨ ý¥¨°Âõ ü¤¡ âþ¨ ý¥¨°Âõ ..................... bucket sort shell sort ͨø ,÷õ üÜ¡¢ ý¥¨°Âõ linear insertion sort stooge sort ÀÝûø¢ ýÔóõ b ÀÝû ýÔóõ b . . . . . . . . . . . . . . . . . . . . . . . . . . . ü÷Àª¤úõ connected component ýù¥ ý¥¨°Âõ üÖÎ ý¥¨°Âõ internal sort .................... biconnected component ................ ÛÞØõ ................................ random number generator adaptive sort äÞ¹õ ÛÞØõ .............................. temporal logic ü¿µ÷ ý¥¨°Âõ ................ ................... introspection sort ........................... set complement range sort ýÔªØõ ........................... greedy heuristic interface ýù¤ø½õ .................... Byzantine Agreement infix ......................... ................................. ...................... characteristic equation buffer interactive model of computation ..................... tractable È ÛÖµÆõ ýäÞ¹õ maximum independent set ©¤Þð ýÜÿÆõ .................... regular ÛÖµÆõ ýäÞ¹õ .............. ................................... circular path source ÷ðÀ ýäÞ¹õ .................... independent set mode Óì ýÜÿÆõ internal path complement multi-set ................................. ................ alternating path heuristic ùõ ýûäÞ¹õ °Âõüþà ýäÞ¹õ circuit ..................... Eulerian path concave ................... .................... ÂþÁ÷ÝÞÊ ýÜÿÆõ ....... .................................. simple path poset pivot ......................... critical path ùõ ýûäÞ¹õ ýÂðÝÞÊ ýÜÿÆõ ................. augmenting path disjoint set äÞ¹õ ........... ü ü»µÆ ýÜÿÆõ ................................ planarity ................................. disjoint find-merge .. assignment problem planarization set ........... undecidable problem halting problem ¤Àõ ©¥¤ ýÜÿÆõ ........ Chinese postman problem planar ýÆþÖõ ý¥¨°Âõ ..................... order statistics centroid üþ±õ ý¥¨°Âõ .................... comparison sort üêÀ¬ ý¥¨°Âõ ýÆþÖõ Âè ý¥¨°Âõ 3 ´¨ 488 min-heap cost Þî ôÂû .......................... ................................... amortized cost equivalent edge connectivity overlap üóþ ýÀÝû ................. ü÷ªÝû ¤Ýû ............................. adjacency ý¤Ýû .......................... ´¿þ¤Ýû homomorphic . . . . . . . . . . . . . . . . . . . . . . . adjacent ............................. modular ............................ homeomorphic . . . . . . . . . . . . . . . . . . . computational geometry geometric ..... þ¨Ýû üµÈú÷Ýû ´¿þ¤öÆÞû ü±¨½õ ý¨Àû ü¨Àû ............................ ý or ....................................... edge .................................... free edge saturated edge ................... feedback edge ............ matched edge ................... xor ñþ ùÀªá±ª ñþ (¢¤¡Å) ¤¡¥ ñþ µêþÕÎ ñþ ý¥ê ñþ .......................... ............................. exclusive or þ ¢¥ ñþ ............................ fuzzy edge ..................... ý¤Ê½÷ ýþ ý¤Ê½÷ ýþ üÖÎõ ýþ inclusive or ........................ one-to-one .......................... ×þ×þ isomorphic ......................... ´¿þ¤×þ graph isomorphism one-dimensional uniform .......... .......................... ...... ö irreflexive acyclic ................ ............................. unbalanced .......................... triangle inequality ÷Úþ ................................ ü÷Úþ üµì¤ ´±Æ÷ ...................... üþ Ï ´±Æ÷ performance ratio visibility map ................... extreme point ..................... ....................... discrete p-center ......... ¸îe ýÎÖ÷ (üÔ÷) ËÖ÷ negation ......................... mapping ............................. O notation ´ªÚ÷ ï¤Ã ý c e ¢Þ÷ ...................... ï¤Ã ý c e ¢Þ÷ big-O notation .................. little-o notation ................ ×î ý c e ¢Þ÷ ..................... ×î ý c e ¢Þ÷ o notation postfix notation ................. ýÀ÷øÇ ¢Þ÷ ................... ýÀ÷øöõ ¢Þ÷ prefix notation infix notation exponential ýÀ÷øÅ ¢Þ÷ ................. üþÞ÷ ........................... moderately exponential Venn diagram Ýþ õ üþÞ÷ ............ ...................... öø c ¤¢Þ÷ descendant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ù¢÷ ancestor ................................. bisector .............................. ÷ ¥¨Ý÷ ø and ...................................... probing .............................. linear probing .................... ............. ø ü¨¤ø üΡ ü¨¤ø 2 ý¤¢ ü¨¤ø ù ýÀã k e ýÃõÙ÷¤ k ....................... kth shortest path Àþ¢ ýÈÖ÷ ÷¤î ýÈÖ÷ Karnaugh map Âþ¨ k-coloring üþ¤î ´±Æ÷ ................ ..................... quadratic probing k-dimensional ´¡Øþ üóøÃ÷ ....... ................. competitive ratio golden ratio ö¥µõ÷ ü·Ü·õ ýøÆõ÷ .............. monotonically decreasing ¤Àþ÷ ý¡Â÷ ............................ üþ÷×þ Ìä ü÷Úþ ¥÷ ........................... unstable ûéÂðÂþ¥ üµ¿þÂØþ ................................ element uniqueness unary ýÀã ×þ e ´¡÷×þ ................... subgraph isomorphism unique ûéÂð üµ¿þ¤×þ ........................... monoticity ÷õ ................................ ¥¤Ýû ü¨b¤ ýÀÝû .............. ............................ adjacent ßÚ÷õ ................................ median ýÀÝû ......................... vertex connectivity mean ùÀªßت¨ ýþÃû ............. ............................ connectivity þÃû ÂÆõ ßþÂùî ßõe k ............... µÆÆð ÃîÂõ p pruning §Âû dd ø´Æ ø §Âû dd . . . . . . . . . . . . . . . . . . . . . . . . . È ôÂû .............................. prune and search max-heap binary heap ............ ...................... üþø¢ø¢ ôÂû ´¨ 4 ü¨¤ê üÆÜÚ÷ ýõ÷ù¦ø alternating path alternation .................. amortized ........................ amortized analysis amortized cost ............. ............. amortized worst case ancestor and ... ùÀªßت¨ üت¨ Ûܽ ùÀªßت¨ ýþÃû ùÀªßت¨ ´ó ßþÂÀ ................................. ........................... approximation ........................ °þÂÖ ü±þÂÖ Ýµþ¤Úó .................................... arithmetic array ....... array index þ¤ ............................ ................. articulation vertex ascending order assignment .................... associative ............ .............. ............... associative array ÛÊ d Ôõd ý¢ã¬ °Â .......................... association list þ¤¢ þ¤ (þÞ÷) ÅþÀ÷ ................. assignment problem öÞî Æ ........................... ................................. array entry ø ö¤Öµõ¢ ...................... approximation algorithm ÷ ù¹÷¥¢ antisymmetric arc ø ...................................... antichain ©¤Þ𠩤Þð ýÜÿÆõ ýÂþÁ´îª ´Æó (üÞ¹÷) ýÂþÁ´îª ............... A üø ÂÆõ ........................... üÞ¹÷ ýþ¤ abstract data type abstraction accepting state accounting ................. accumulator ý¤¢Æ ý¤¢Æ ©ø¤ ........... ßõÂî c â d d ý¡Â÷ .............. ............................ acyclic graph .................. adaptive sort ................ ý¡Â÷ éÂð üÖÎ ý¥¨°Âõ .......................... adjacency list ................. adjacency matrix adjacent ÂÚµª±÷ ......................... Ackermann’s function adjacency áõ÷ üµêÂþÁ ´ó ....................... accounting method acyclic üäõ÷ ý÷ðù¢¢ ........... ............................ ............. ...................... ý¤Ýû ý¤Ýû ´Æó ý¤Ýû ÅþÂõ þ¨Ýû ,¤Ýû adversary ............................. °ì¤ aggregate ............................. û±÷ aggregate ............................ aggregate method algorithm ................. áÞ¹õ û±÷ ©ø¤ ........................... ݵþ¤Úó all pairs shortest path §b¤ ø¢ Âû ß ÂÆõ ßþÂùî alphabet alternating ............................... ........................... ±Ôó üø 4 ´¨ 490 binary search tree binary trie bipartite graph üþø¢ø¢ ýÂc üÈ¿ø¢ éÂ𠥨Ý÷ áÔ¤ ù¨ ...................... íÜ ................................. blocking flow boolean ý¢ÀÆ÷ ¤ª ..................... ................................ bottleneck bound ................................. bounded queue bounded stack branching ............... À ø ãÈ÷ ...... bucket ü± ý¥¨°Âõ .................. ................................ bucket array bucket sort buffer üÜΨ ý¥¨°Âõ ýÀÛΨ ©ø¤ ............. Âðöõ ............................... Byzantine Agreement Byzantine generals ÛΨ üÜΨ ýþ¤ .................... .................. bucketing method Û ÷¤î¤î ......................... bubble sort ü±÷¹õ ýÑê üðÀ» asymptotic time complexity ü±÷¹õ ü÷õ¥ üðÀ» asymptotic upper bound asymptotically asymptotically tight bound attribute automaton ........... ............. üõø¤ ýùÀûãõ üõø¤ ýûñÂ÷¦ C ñc.ýø.ýc ´¡¤¢ ..................... B B+-tree B-tree § ü ´¡¤¢ ....................... ............................. (ü÷÷î) é¤ãµõ üðÀ» ýù¢¤ ......................... backtracking .................... backward analysis bag balance ¢øÀ½õ ´êÂÒ úÆ öØõ ´êÂÒ ............................. ................. öî ¢Àä ceiling ................................ ÓÖ¨ ¨Å Ûܽ (÷ðÀ ýäÞ¹õ) þ¢Âð ............................... balanced node balls and urns ...... ö¥µõ âþ¨ ý¥¨°Âõ ................... cellular ............................... üóܨ cellular automaton centroid éÂÒ ø ¢¤ê ßÞÜ .......... biconnected component ........ big-O notation bin packing binary ÀÝûø¢ ýÔóõ b ÀÝûø¢ éÂð ......................... bidirectional bubble sort ï¤Ã ý c e ¢Þ÷ .................. ..................... ..................... ÛÖ ÃîÂõ binary heap ...................... ................................ ù¹÷¥ binary insertion sort ýù¹÷¥ Þ÷´ªÂ¨ ýó¢ãõ .................................. À÷¥Âê binary operator .................. üþø¢ø¢ üþø¢ø¢ ôô üþø¢ø¢ ôÂû üþø¢ø¢ ¤¢ üþø¢ø¢ ü¤¢ ý¥¨°Âõ ................ üþø¢ø¢ ÂðÛÞä ...... üþø¢ø¢ ´þóø Ó¬ .............. üþø¢ø¢ ýø´Æ binary priority queue binary search ... ýÀµÆ üÜΨ ý¥¨°Âõ ............................... binary insertion þ¨ø¢ þ¨ø¢ ü± ý¥¨°Âõ ........................ üûð ....... .............. ´ó ßþµú ÀÝû ø¢ DZà binary GCD chaining . . . . . . . . . . . . . . . . . . . . . . . . . . . . child ........................ üóܨ ýù¤î¢¡ ............................ characteristic equation ñø µú ýø´Æ biconnected component ............................ certificate chain ........... ........... biconnected graph ö¥ ö¥µõ ùÂð ..................... balanced quicksort bin sort ¢ÂðÅ ¢ÂðÅ ©ø¤ ............... .................. bidirectional capacitated facility location ü ´¡¤¢ backtracking best-case ü÷¡Âê canonical complexity class Catalan’s number üØÞî ßÚ÷õ ´ó .................... best first search ................................ capacity ù¤î¢¡ .......................... Bellman-Ford . . . . . . . . . . . . . . . . . . . . . . call ÊÊ¡ üÈþÃê ÂÆõ ................ ............................. average-case AVL tree ü±÷¹õ ü±÷¹õ ýµÆ öÂî .. ............................ augmenting path auxiliary ü±÷¹õ ý öÂî ...... ....................... üµÈ¡ ý¥¨°Âõ ................................... brute force asymptotic space complexity ñø ¼Î¨ ýø´Æ ................... ü±÷¹õ ßþ öÂî ...... ãÈ÷ ........................... brick sort bridge ¤¢öÂî ýµÈ .................. breadth first search öÂî ¤¢öÂî Ó¬ .................. branch and bound üó ùðÜð ............................ ü±÷¹õ öÂî ................ asymptotic lower bound üµ ¤¢Â .......................... black-height asymptotic bound üÈ¿ø¢ ÕÎ .............. .............................. bit vector block ø´Æ üþø¢ø¢ ´¡¤¢ ................. bipartite matching bisector ..... ....................... ü¨¤ê üÆÜÚ÷ ýõ÷ù¦ø 491 Cook’s theorem cost íî ýÌì .................. þÃû ................................... counter critical path cursor .............. üª¤Þª ý¥¨°Âõ ü÷½ ÂÆõ ...................... Þ÷öØõ ,üÆþÀ÷ Âðù¤ª ................. ©Â e üªÂ §b¤ e cutting plane . . . . . . . . . . . . . . . . . . . üªÂe ý½Ô¬ cutting theorem . . . . . . . . . . . . . . . . . üªÂe ýÌì cycle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ¡Â cut .................................... cut vertex ......................... data structure data type circuit circuit complexity ¤µ¡¨ù¢¢ database ùÚþù¢¢ ,ö𢢠..................... decidable ......................... decision problem decision tree ........... ÂþÁÝÞÊ ýÂðÝÞÊ ýÜÿÆõ ÝÞÊ ´¡¤¢ .................... decomposable searching ÷ðù¢¢ ÂþÁþù ýø´Æ .. degree ................................ ¤¢ delete ................................ éÁ dense graph Ýîµõ éÂð ...................... depth . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . depth first search ......... ñø ÕÞä ýø´Æ deque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . derangement ¨ø¢ Ó¬ Çþ .......................... descendant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . descending order description DFS forest .......... diagonalization diameter Ó¬ ......... üãÎì ݵþ¤Úó ñø ÕÞä ýø´Æ ÛÚ ................... ö¢Âî ýÂÎì ............................... dictionary ...................... Dijkstra ........................ .......... ¨Âð ýûéÆÜê ÝÖµÆõ üû¢§¤¢ directed acyclic graph directed tree disjoint .. ý¡Â÷ ¤¢´ú éÂð .................. .................. discrete p-center µÆØþ¢ ............ dining philosophers directed graph Û®Ô ¤¢´ú éÂð ............................ direct-addressing ÂÎì ýù¢¢ ÙûÂê difference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . digraph üãÎì .......................... deterministic algorithm ù¢÷ üóøÃ÷ °Â ................. .......................... deterministic ÕÞä ............... ¤¢´ú éÂ𠤢´ú ´¡¤¢ µÆÆð ÃîÂõ p ................................ ùõ ¤Àõ circular ¤Àõ üðÀ» ............... circuit value problem ¤Àõ ©¥¤ ýÜÿÆõ ........ ýÖÜ .............................. circular list ýÖÜ ´Æó ..................... circular path .................... ýÖÜ ÂÆõ ................... ýÖÜ Ó¬ circular queue .................................... clustering ..................... µÆ ýù¥ ......................... ýÀª¡ collective recursion collision üãÞ¹ ´Èð¥ ............ ¢¤¡Â ............................. combination commutative compaction °î .......................... combinatorics ....................... ........... ý¥¨ù¢ÂÈê complement ýÆþÖõ ý¥¨°Âõ .............. üµì¤ Ûܽ ................. üµì¤ ´±Æ÷ competitive analysis competitive ratio ±î üþ ....................... ....................... comparison sort ........................... complete binary tree complete graph complete tree ....... Ûõî éÂð .................... Ûõî ´¡¤¢ .................... complexity class compound data type computable ݵþ¤Úó üðÀ» ...... °îÂõ ý÷ðù¢¢ .......... ÂþÁÇ÷þ¤ ....................... computational geometry ..... üðÀ» üðÀ» ýù¢¤ ................ complexity of algorithm ÛÞØõ Ûõî üþø¢ø¢ ´¡¤¢ complexity . . . . . . . . . . . . . . . . . . . . . . . . . . ü±¨½õ ý¨Àû ë½ó concatenation . . . . . . . . . . . . . . . . . . . . . . . . . concave ù¢¤ ª¡ ................................ closed interval ..................... üÚ÷¤ ¢Àä .................. ................................. clique ........................... ü ü»µÆ ýÜÿÆõ ü ýùÀ÷õüì ýÌì chromatic number class D .. Chinese remainder theorem ùÀ÷¤Þª ............................. counting sort Chinese postman problem ................................ configuration ÂãÖõ ýÀÂØ ....................... .................... âÏÖ éÂð conjunction . . . . . . . . . . . . . . . . . . . . . . üÔÎä °î conflict graph connected component connected graph ............ ......................... ýÀÝû ............................... üöc î connectivity coNP ÀÝû DZà .............. ÀÝû ýÔóõ b . . . . . . . . . . . . . . . . . . ÀÝû éÂð connected component constraint ............................... constructive proof ................ continuous knapsack convolution ........... Àì ùÀ÷¥¨ ± µ¨ üµÈóî ......................... ö¦ó÷î 4 ´¨ 492 ............. ü¤¡ ݵþ¤Úó disjoint find-merge .............. ü¤¡ ýÑê disjoint set external algorithm external memory external memory data structure external quicksort external sort ü¤¡ üõè¢ ý¥¨°Âõ .... ...... ùõ ýûäÞ¹õ disjunction ......... ùõ ýäÞ¹õ ÛÚ üÜÊê °î ...................... distribution sort üãþ¥ ý¥¨°Âõ ............ divide and conquer ÛøÝÆÖ ................ ü¤¡ âþ¨ ý¥¨°Âõ domain ................................ ü¤¡ ý¥¨°Âõ domino ............................... ................ extreme point ü¤¡ ôè¢ .................. external merge sort ùõ ýûäÞ¹õ disjoint-set forest ü¤¡ ýÑê ¤µ¡¨ù¢¢ external merge ........... ................... ¸îe ýÎÖ÷ ..................... double hashing ............... double rotation õ¢ õø¢ ÷ðø¢ ý¥¨Ýû¤¢ ÷ðø¢ ö¤ø¢d d .................. double-direction bubble sort F þ¨ø¢ ü± ý¥¨°Âõ doubly linked list facility location factorial ................. úÆ öØõ Ûþ¤µîê ............................ Fast Fourier Transform (FFT) feasible ............................ ÂþÁöØõ feasible ............................ ÂþÁöØõ feedback edge finite automaton finite state automaton finite state machine first-in, first-out dynamic array dynamic hashing üûµõ ´ó ߪõ §ê¥ø¦ §þø ê edge .................................... edge coloring edge connectivity edge crossing flow .................................... ¤ª element uniqueness .................... ¤ª ýÖ ¤ª ýرª ...................... Floyd-Warshall .................. ñª¤ø ÀþÜê Ford-Fulkerson ................. ߨÂØóê ¢¤ê equivalent ÛÚ Euclid ................................ üÞ¨¤ Euclidean ................... Fourier transform fractal ................. free edge free tree ÂþÁÝÆÖ üµÈóî fully persistent ........................... Euclidean distance ............ ü¨ÀÜì ¢Âðù¤ø¢ ýùÀªøÂê ýÂÜþø ý¡Â Euler cycle .................... Euler tour ........................ Eulerian graph ýÂÜþø éÂð ýÂÜþø ÂÆõ .................... ................................ â exclusive or expansion exponential expression ýÂÜþø ¤ .................. .............. ¢¥ §b¤ §ÀÜì ü¨ÀÜì ü¨ÀÜì ýܬê exchange sort  ýþ¤ e . . . . . . . . . . . . . . . Âe üþø¢ø¢ ´¡¤¢ . . . . . . . . . . . . . . . . . . . . ¤ðÀ÷õôÞ ¥¤Ýû Euclidean traveling salesman Eulerian path .......................... ýÀµÆ ñ¢ãõ üþø¢ø¢ ´¡¤¢ ¢¥ ñþ .......................... full binary tree ...... ¢¥ ´¡¤¢ ............................ .......................... free vertex full array ......... ñµîÂê ù¢¨ ¤µ¡¨ù¢¢ ...... .............................. öÂÂê þ¤ê ÛþÀ± ............................... fractional knapsack function üÞ¨¤ ©ø¤ ............................... üþ¤î Ìä ü÷Úþ ............................ equivalent binary tree ................................. Fortran ................ encapsulation . . . . . . . . . . . . . . . . . . . . . . . formal (ý¤¬) üÞ¨¤ ö¥ üóþ âÏÖ ............................. elementary data strucutre forest ............ üóþ ýÀÝû ................. ...................... efficiency ñþ üóþ ýÃõÙ÷¤ ................... Óî formal method þ ýÃþ¤õ÷ .......... E ................................... formal language þ ý¥¨Ýû¤¢ ............... dynamic programming floor flow network þ þ ýþ¤ .................... üûµõ ýþ¤ê ÛþÀ± üø¡ ßóø ý¢ø¤ø ßóø ............ flow conservation öðø¢ ................................ üûµõ ýù¤î¢¡ üûµõ ´ó ýù¤î¢¡ ......... ...... Flavius Josephus .... ... ¨ø¢ Ó c ¬ .................................. ü÷±ê ¢Àä ............... ............. finite Fourier transform dual þ¨ø¢ ýÀ÷ ´Æó ............... (¢¤¡Å) ¤¡¥ ñþ ............ Fibonacci number doubly-ended queue dynamic âþ¨ ýþ¤ê ÛþÀ± .......... üÌþã ý¥¨°Âõ ..................... ý¤Ê½÷ ýþ ........................... ©ÂµÆð ........................... ............................ expression tree .................. üþÞ÷ ¤±ä ¤±ä ´¡¤¢ ü¨¤ê üÆÜÚ÷ ýõ÷ù¦ø 493 hybrid algorithm ........ (µ¿õ) ð¤ø¢ ݵþ¤Úó °ãØõÂd d . . . . . . . . . . . . . . . . . . . . . . . . . . . . ñþÂdd . . . . . . . . . . . . . . . . . . . . . . . . . éÂðÂdd hypercube ......................... hyperedge hypergraph in-place general tree ý¢ø¤ø ý¤¢ geometric in-place merging in-place sort .......... inclusion-exclusion principle inclusion-exclusoin inclusive or ¤¢ ôè¢ .................. ¤¢ ý¥¨°Âõ .................. inclusion exclusion incremental üÜî ´¡¤¢ golden ratio üÖÎõ ýþ ü÷ÀÈ÷ù¢ÂÈê Gray code üÈþÃê .............. ÂÖµ¨ ................... éÂð ݨ¤ ûéÂð üµ¿þ¤×þ .......... ........................... íµÈõ ¿õ ßþÂï¤Ã greatest common divisor (ôô) íµÈõ ÜäôÆÖõ ßþÂï¤Ã greedy .............................. ÂÖµ¨ ýþ greedy algorithm ÷Êþ ýÔªØõ ÂÖµ¨ Âê greedy heuristic ............. ÂÖµ¨ ôð growth function ..................... ............................... ýÀ÷øöõ induction step infix notation .............. ................... ýÀ÷øöõ ¢Þ÷ inorder .................... insertion °Âöõ ,°Âß insertion sort interactive interface ................ ü¤¢ ý¥¨°Âõ ýù¤ø½õ ......................... ͨø ,÷õ .......................... interleave öÀ Ýû¤¢ ......................... öø¤¢  üµ±õ interior-based ................... internal node ...................... internal path internal sort ..................... ................. üÜ¡¢ ùÂð üÜ¡¢ ÂÆõ üÜ¡¢ ý¥¨°Âõ íµª intersection . . . . . . . . . . . . . . . . . . . . . . . . . . interval ................................. intractable ......................... introspection sort ........... ........................... isomorphic ......................... iterated logarithm ù¥ ü÷ÀÈ÷ô¤ õ¥¢¡ ý¥¨°Âõ irreflexive iteration ¤¢ ............................... .............. ¥÷ ´¿þ¤×þ ý¤ÂØ Ýµþ¤Úó .............................. ¤ÂØ Àª¤ â H infix with complete paranthesis Ûõî ýõ÷ ýÀ÷øöõ ÷Êþ ÷Êþ ݵþ¤Úó ............. ...................... induction hypothesis ýÂð Àî greatest common denominator ÛÖµÆõ ýäÞ¹õ ............................. éÂð éÂð ýÃõÙ÷¤ ..................... graph isomorphism ü÷ÀÈ÷ù¢ÂÈê ýµª¤ ....... üþ Ï ´±Æ÷ ...................... ................................. graph drawing ñÞª ø ¢¤ ü¨Àû ý¨¨ ýú ................ ñÞª ø ¢a¤ Û¬ ... .......................... induction basis ....................... ............................ ................ ................... independent set üÜî ´Æó graph coloring ................ incompressible string ........................ global optimum graph üø¤ó¥ .................. ñÞª ôÀä ø ñÞª ........................ incompressible infix general list ý¢ø¤ø ãÈ÷ ¤¢ ý¥ ´¡¤¢ ........................ ................... ............................... induction G ...................... in-branching in-degree ôÃܵ¨ ý¥ê ñþ .......................... garbage collection ........................... Õì¢÷ ,ý¥ê ............................ fuzzy edge game tree I implication fuzzy halting problem ................. Hamiltonian cycle hash function hash table hashing head ............. Óì ýÜÿÆõ üµÜÞû ý¡Â .................... ¥¨Ýû¤¢ â ý¥¨Ýû¤¢ ñøÀ ................... ý¥¨Ýû¤¢ ........................... .................................... header, sentinel ............... üõÂû ý¥¨°Âõ heapsort ..................... heuristic ........................... hidden Markov model ....... ¨ ´Æó¨ ,Àþ¨ ýÔªØõ üÔ¿õ éî¤õ ñÀõ hierarchical ............... ü±ÂõÜÆܨ ,ü÷ð¢ hierarchical ............... ü÷Úþ ,ü±ÂõÜÆܨ homeomorphic . . . . . . . . . . . . . . . . . . . ´¿þ¤öÆÞû homogeneous recursive relation ßÚÞû üµÈð¥ ýΤ homomorphic . . . . . . . . . . . . . . . . . . . . . . . Horner’s rule ..................... Huffman tree .................... ´¿þ¤Ýû Â÷¤û ö÷ì ßÞêû ´¡¤¢ 4 ´¨ 494 M makespan J ................. ¤î ßþ¡ ôÞ öõ¥ Manhattan distance ............ many-one reduction ........... mapping ................ matched edge ................... µêþÕÎ ñþ µêþÕÎ §b¤ ................ matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . È ôÂû ......................... maximal ÕÎ ÅþÂõ .............................. max-heap ßÈ .............................. maximally connected component ÀÝûßÈ ýÔóõ b . . . . . . . . . . . . . . . . . . . . . . . . . . . . . È maximum ø K ´ªÚ÷ éî¤õ ýù¹÷¥ Markov chain matrix ................................... ×þÀ Çûî ............................. matched vertex Java üµúõ ýܬê ....................... ýÃõÙ÷¤ k ......................... ý¢üî ´¡¤¢ k-coloring k-d tree k-dimensional .................... û¤ k üõè¢ ý¥¨°Âõ k-way merge sort ...... kth shortest path ......... Karnaugh map key ýÀã k e û¤ k ôè¢ ....................... k-way merge ÂÆõ ßþÂùî ßõe k ÷¤î ýÈÖ÷ ................... .................................... Kruskal ÀÜî ñبøÂî ............................ maximum bipartite matching È üÈ¿ø¢ ÕÎ maximum independent set mean ßÚ÷õ ................................ median ÷õ ................................ memoization merge ý¤³¨ÂÏ¡ .................... ................................ merge sort .................. min-heap minimal ôè¢ üõè¢ ý¥¨°Âõ Þî ôÂû .......................... ............................... minimization ßÞî ý¥¨Þî ...................... minimum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Þî minimum bounding box ùÀ÷Â𤢠ÛεÆõ ßþÂ×î minimum cut minimum vertex cut mode Þî ©Â ...................... minimum spanning tree ..... Þî ÂðÂê ´¡¤¢ Þî ü¨b¤ ©Â ........... ................................... model checking ........... leaf least common multiple ........................ linear order linked list üþîÀ ¤ª .............. ................ ÷ðÀ éÂð û¤À ÝÞÊ û¤À ôè¢ list °Â¼Î¨ üþ±Ôó °Â ........... ................................. linear insertion sort üþ÷×þ ´¡Øþ üóøÃ÷ ¢Âð² ö¤ø¢ dd ...................... level-order linear ...................... üΡ °Â .................... üΡ ü¨¤ø ...... üΡ ü¨¤ø ý¥¨°Âõ üΡ ® .................... ....................... lower bound ................ üÞµþ¤Úó ÖÜ ¥ ÛÖµÆõ ýΤ ....................... lower triangular matrix ´Æó ×î ý c e ¢Þ÷ ......................... ............ À÷ ýÀ÷ ´Æó ................................... little-o notation loop invariant üΡ üΡ ü¤¢ ý¥¨°Âõ ...... ................................... logarithmic ï íµÈõ ÂÌõ ßþÂ×î left-rotate lexicographic Ordering رª ý¤Áðý ............................ .................................... link ÷ðÀ ýäÞ¹õ ..................... multiway merge layout üµÈú÷Ýû ´¡Øþ ý¢ã¬ ß âÂõ ùÀªþ éÂð ................... linear product .................... multiway decision layered graph ö¥ üø¡ ßóø ý¢ø¤ø ßþ¡ ........................ linear probing sort ....... ¤¢°Æ éÂð lattice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ýþ õ üþÞ÷ monotonically increasing . . . . . . multigraph latin square ..... Ç÷þ¤ ñÀõ monotonically decreasing multi-set last-in, first-out ............ .......................... multi-commodity flow ................ ............................... ............. ............................ monoticity language linear probing moderately exponential modular Àõe labeled graph ñÀõ ü¨¤Â ................... model of computation L È ÛÖµÆõ ýäÞ¹õ ....... ßþ öÂî ü·Ü·õßþ ÅþÂõ ü¨¤ê üÆÜÚ÷ ýõ÷ù¦ø 495 orthogonal drawing overflow ü÷¨÷ üõè¢ ý¥¨°Âõ ................. üø¡ ãÈ÷ .................... üø¡ ý¤¢ out-branching out-degree .. Ãþ¤Â¨ .............................. overlap N Àõãµõ ݨ .............. oscillating merge sort ............................ ü÷ªÝû nearest neighbor search þÆÞû ßþÂ×þ¢Ã÷ ýø´Æ nearly complete binary tree Ûõîf±þÂÖ üþø¢ø¢ ´¡¤¢ negation node parent-child µõ¤ ñÖµ÷ ...................... ýÀ÷¥Âê ¤À partial function partial order .................... partially decidable ýù¤ ÂþÁÝÞÊ þ üþà éÂð ....... °Âõüþà .................. partially ordered tree .............................. ¥Âê partition .............................. Ç¿ path ýÀÇ¿ ....................... .................................. path compression perfect hashing performance ratio permutation persistent ................ üþ¤î ´±Æ÷ .......................... ............................ pigeonhole ..... ........... ý±î÷ ý±î÷ Û¬ ................................. ................................ planar graph °Â ¤ðÀ÷õ ¤ðÀ÷õ ¤µ¡¨ù¢¢ ........................ pigeonhole principle planar Ûõî ÕÎ üþ¤î ´÷Þ® .......... persistent data structure pivot Ûõî ý¥¨Ýû¤¢ .................. performance guarantee ÂÆõ ÂÆõ ý¥¨ù¢ÂÈê ............. ................ perfect matching ..................... ¤½õ ¼ÎÆõ ¼ÎÆõ éÂð planar straight-line graph ÝÖµÆõ ¯Î¡ ¼ÎÆõ éÂð planarity pointer ö¢ ¼ÎÆõ ......................... planarization ý¥¨¼ÎÆõ ..................... .............................. polyhedron ........................ polylogarithmic .................. Âðù¤ª üúøÀ üÞµþ¤ÚóÀ polylogarithmically bounded üÞµþ¤Úó ýÜÞÀ öÂî polynomial üãÎìÂè .................... nondeterministic algorithm üãÎìÂè ݵþ¤Úó ... nondeterministic polynomial time üãÎìÂè ýÜÞÀ öõ¥ NP-complete . . . . . . . . . . . . . . . . . . . . . . . NP-hard nullary ôÞ üö ´¿¨ üö ......................... üþÂÔ¬ ............................. °ÂõÞ÷ ´¡¤¢ ......... partition partitioning ýÆþÖõ Âè ý¥¨°Âõ ßÚÞû÷ üµÈð¥ ýΤ nondeterministic üþà üµÈð¥ â ........... partially dynamic graph partially ordered .... üþà â üþà °Â ..................... partial recursive function .... non-homogeneous recursive relation ................ parameter passing ùÂð ................................... non-comparison sort P (üÔ÷) ËÖ÷ ......................... ....................... ýÜÞÀ polynomial approximation scheme ýÜÞÀ °þÂÖ ýÞª O O notation ...................... o notation ..................... object oriented ï¤Ã ý c e ¢Þ÷ ×î ý c e ¢Þ÷ Âðüª b éÀû â ....................... objective function .................. Í¡öø off-line ............................. omega ................................. omicron on-line on-to Í¡Â ................................ .................................. ª ýÀã ×þ e . . . . . . . . . . . . . . . . . . . . . . . . . . ×þ×þ one-dimensional one-to-one Úõe öøÂØõe ............................. ................... open interval ....................... open hashing ................... ¥ ýù¥ ¥ ý¥¨Ýû¤¢ operands ............................ À÷øÛÞä operation ............................ ÜÞä operations operator optimal ............................. ÂðÛÞä ................................ optimization optimum or ñÞäd ............................ ....................... ßú ý¥¨ú ............................... ú ....................................... oracle order ............................... ............................ order statistics .................. ordered linked list oriented graph .......... þ ðÇ ±Âõ ,°Â ý¤õ ý±Âõ °Âõ ýÀ÷ ´Æó ................. ¤¢´ú éÂð 4 ´¨ quicksort 496 âþ¨ ý¥¨°Âõ ..................... polynomial time ýÜÞÀ öõ¥ .............. polynomial-time algorithm ýÜÞÀ öõ¥ ݵþ¤Úó R polynomially bounded polyphase merge üþ±õ ý¥¨°Âõ radix sort .................... radix tree ......................... ragged matrix üê¢Ê ü¨¤´¨¢ ߪõ üê¢Ê ¢Àä Àócõ d . . . . . . . . . . . . . . . . . . . ý¥¨üê¢Ê random number generator randomized .... üê¢Ê .......................... randomized rounding range ¤Þû÷ ÅþÂõ ................. random access machine randomization ±õ ´¡¤¢ üê¢Ê ö¢Âî ¢Âð ......... ¢Â e ýù¥ ý¥¨°Âõ ................................... range sort ................... reachability reachable recognizer record ü¨¤´¨¢ ........................ üþ´¨¢ Ûì ....................... .............. (ùÀ¨ª) ùÀû¢É¿È ................................ rectangular matrix rectilinear recurrence relation recursion üÜεÆõ ÅþÂõ ............ ý¢Þä üÖê ...................... rectilinear distance ........ ý¢Þä üÖê ýܬê üµÈð¥ ýΤ ............. ............................ recursion termination recursion tree recursive ´È𥠴¡¤¢ ............................ ÂþÁ©¤ÞªüµÈð¥ ü¥ ................................ ± ................................ ÝÑõ relation ............................... Τ relational structure ýΤ ¤µ¡¨ ............. relaxation ............................. rescalable ....................... response time root postorder ...................... .................. Ýõ ÂþÁ§Öõ¥ ¾¨ öõ¥ ýÀ÷øÅ ýÀ÷øÅ ¢Þ÷ ................. °ÂÅ .......................... potential . . . . . . . . . . . . . . . . . . . . . . . . . . . . . potential function predecessor prefix Prim üܱì ............................ prefix notation preorder ÛÆ÷µ ÛÆ÷µ â ................. ýÀ÷øÇ ............................. ýÀ÷øÇ ¢Þ÷ ................. °Â Ç .......................... Ýþ .................................. priority .............................. ´þóø ................... ´þóø Ó¬ prisoner’s dilemma . . . . . . . . . . . . . . . ö¨ ýÞãõ priority queue probabilistic probe sequence probing üóÞµ ........................ probabilistic algorithm üóÞµ ݵþ¤Úó ........ ü¨¤ø ýó±÷¢ ................. ü¨¤ø .............................. procedure .............................. process algebra ................... program counter proper coloring ü¨¤¢ µõ¤ µÈ ¥ éÁ °Âõüþà ýäÞ¹õ ............................. postfix notation ý¥¨ù¢¨ ,Çûî regular right-rotate postfix .................... ............................. ù¥êÀ üõè¢ ý¥¨°Âõ .. .................... proper register return poset ù¨ ÃõÂì ´¡¤¢ reference parameter . . . . . . . . . . . . . . reflexive üµÈð¥ ýÜÂõÀ ôè¢ ............................. ................ red-black tree reduction ..... ´È𥠴Èð¥ ýÞ¡ ......... .................. recursively enumerable ¢¤î¤ ............ polyphase merge sort pop ýÜÞÀ öÂî ......... õ÷ ýùÀ÷¤Þª .............. ................................. proper subset ................ ................ þø¤ ûù¥¢Â ± ù¨ ¥¹õ ýÃõÙ÷¤ ù¨ ýäÞ¹õÂþ¥ ø´Æ ø §Âû dd pruning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . §Âûd d pseudo-code . . . . . . . . . . . . . . . . . . . . . . . . . . À prune and search pseudo-random ............ punched card push üê¢Ê±ª .................... psuedo poluynomial ýÜÞÀ ±ª ........... Úõ ¤î ..................... ............................ pushdown automaton ........ µÈ ¤¢ ¤¢ ýµÈ ýù¤î¢¡ ü÷¡Âê ×þ ¥ ´Èð¥ ................... ¢Â𴨤 ö¤ø d d¢ ................................... rotation .............................. run time ........................... Q Èþ¤ ö¤ø d d¢  öõ¥ quadratic .......................... quadratic probing ............. quantum computation .......... 2 ý¤¢ 2 ý¤¢ ü¨¤ø üÞµ÷î Ç÷þ¤ query . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . queue öި ................................. Ó¬ ü¨¤ê üÆÜÚ÷ ýõ÷ù¦ø 497 star-shaped polygon start state state áøª ´ó ................................. state machine static ´ó ´ó ߪõ .................... state transition .................... ´ó ¤Áð µÆþ .................................. Steiner tree Âþµª §b¤ .................... Stirling’s approximation Stirling’s formula stooge sort Âþµª ´¡¤¢ ..................... Steiner vertex Ùóµ¨ °þÂÖ ....... Ùóµ¨ ñõÂê .............. ÷óù¢¨ ý¥¨°Âõ ............... straight insertion sort .. ÝÖµÆõ ü¤¢ ý¥¨°Âõ strictly decreasing ................ strictly increasing ............... üóøÃ÷fÀî ý¢ã¬fÀî strictly lower triangular matrix ü·Ü·õ ßþfÀî ÅþÂõ strictly upper triangular matrix ü·Ü·õ fÀî ÅþÂõ string µª¤ ................................. strong induction ................. strongly connected strongly connected component structured subgraph ýì ýÂÖµ¨ ÀÝûfþì ................. strongly connected graph .. ÀÝûfþì DZà ÀÝûfþì éÂð ...... ........................ µêþ´¡¨ ........................... subgraph isomorphism ...... ûéÂðÂþ¥ üµ¿þÂØþ ............................ äÞ¹õÂþ¥ ........................... ´¡¤¢Âþ¥ succesor ............................... suffix automaton ........... äÞ¹õ Â¥ dc supersink . . . . . . . . . . . . . . . . . . . . . . . . . . ×ûÂdd supersource . . . . . . . . . . . . . . . . . . . . . . . . . . â±õÂdd symbol table . . . . . . . . . . . . . . . . . . . . . û¢Þ÷ ñøÀ ............................ symmetric inclusion-exclusoin symmetric set difference ... symmetrically linked list .... symmetry . scheduling selection sort self-loop ö¤Öµõ ö¤Öµõ ñÞª ø ¢¤ äÞ¹õ ö¤Öµõ Û®Ô ö¤Öµõ ýÀ÷ ´Æó ............................. ö¤Ö T ..................................... tail recursion temporal logic terminal text .................. ô¢ e ´Èð¥ ßþ¡ .................... ü÷õ¥ ÕÎõ ............................... .................................... ÷þ ßµõ ýÀöõ¥ ü¿µ÷ ý¥¨°Âõ ìÏ ............................... separation sequence ¥Þ÷ ýù¥ ................ ý¥¨À ......................... ó±÷¢ .............................. äÞ¹õ ................................. set complement set difference set union ................. äÞ¹õ áÞµ ..................... shell sort signature ü ýÑê ............... .................... shortest path äÞ¹õ ÛÞØõ äÞ¹õ Û®Ô .................. shared memory üêÀ¬ ý¥¨°Âõ .................. ÂÆõ ßþÂùî (öÈ÷) Ìõ ......................... simple data type simple path ............... ù¢¨ ý÷ðù¢¢ ù¢¨ ÂÆõ ........................ simple statement ù¢¨ ¤µ¨¢ .................. simple uniform hashing ´¡÷×þ ø ù¢¨ ý¥¨Ýû¤¢ simulation ý¥¨±ª ......................... single rotation üØ ö¤ø d ¢d ..................... single-destination shortest-path ÀÊÖõ ×þ ÂÆõ ßþÂùî single-pair shortest-path §b¤ø¥ ×þ ß ÂÆõ ßþÂùî single-source shortest-path bÀ±õ ×þ ¥ ÂÆõ ßþÂùî singly linked list singular sink °þ¤ ö¤Ö .................... ........... ý¥¨°Âõ ݵþ¤Úó bÀ±õ ,â±õ .............................. spanning tree ......... ª ´¡¤¢ ,ÂðÂê ´¡¤¢ ................................. ×ee ÅþÂõ .................... sparsification ...................... spell-checker ........................ ...................... square matrix ................... ×ee ×ee éÂð ...................... sparse matrix splay tree °ª ü÷ÀªÛ ............................ sorting algorithm sparse ßØ ×û .................................. solvable source þ¨×þ ýÀ÷ ´Æó ................................. skew symmetry slope .......... ............................... sparse graph tail ................ semi-open interval set ùÀªá±ª ñþ ................... ......................... ýÀã ýÀ÷øÅ ýù¤î¢¡ superset . . . . . . . . . . . . . . . . . . . . . . . . . . symmetric saturated edge éÂðÂþ¥ subtree subset S ýù¤µ¨ üãÜ®À ......... ....................... ý¥¨×ee þÍÜè üÜc³¨ ´¡¤¢ c üãÂõ ÅþÂõ stable ................................. stack .................................. ¤Àþ µÈ e 4 ´¨ 498 universal state universe unsolvable (âÂõ ýäÞ¹õ) öú ü÷ÀÈ÷Û ......................... unsorted list unstable âõ ´ó .................... ................ °Âõ÷ ´Æó .................... ¤Àþ÷ ............................. upper triangular matrix ........ ü·Ü·õ ÅþÂõ time/space complexity topological order topological sort total value parameter Venn diagram verification vertex üª¥¤ µõ¤ öø c ¤¢Þ÷ ...................... ü¹¨üµ¨¤¢ ................................. vertex cover vertices visible §b¤ ü¨b¤ ýÃõÙ÷¤ ................ ü¨b¤ ýÀÝû .............. ü¨b¤ Ǫ ..................... û§b¤ .............................. visibility map ..................... Àþ¢ ýÈÖ÷ .............................. Àþ¢ Ûì tour .................................... ....................... ¤Ñµ÷ öõ¥ .................................. ´Èð Óã® ýÂÖµ¨ ................ weighted graph .................. worst-case ....................... ....................... transition function transitive transitive reduction transpose ¤¢ö¥ø éÂð ´ó ßþÂÀ ´ó ßþÂÀ ý¤Ê½÷ ýþ Z üµ¡¤¢ ý¥¨°Âõ .................... ü·Ü·õ ýøÆõ÷ .............. ýÀ¶Ü·õ ....................... .................................... Turing machine turn ................. Ùþ¤ ߪõ ©¢Âð ................................. two-dimensional ýÀã ø¢ e þ¨ø¢ ýÀ÷ ´Æó ..................... two-way linked list two-way list ýÂc üþ¨ .............................. ........ ..................... two-way merge sort unary .... þ¨ø¢ ´Æó û¤ø¢ üõè¢ ý¥¨°Âõ ×þ ø ÂÔ¬ Û¬ ..................... unary operator .................. undecidable .............. uniform ×þ ø ÂÔ¬ üµÈóî .......................... ... 2-3 ´¡¤¢ ü±þÂÖ ρ ݵþ¤Úó unique ü÷Úþ ÂðÛÞä ö¥µõ÷ .................... ÂþÁ÷Ç÷þ¤ ...................... ÂþÁ÷ÝÞÊ ....... ÂþÁ÷ÝÞÊ ýÜÿÆõ ............. ¤¢´úÂè éÂð ........................... uniform matrix union ü÷Úþ â .......................... undirected graph others ü÷Úþ ................................ unary function unbalanced .............. ρ-approximation algorithm ÇþÞ üµ¡¤¢ ýù¤î¢¡ .............. undecidable problem 0-1 knapsack ù¢ú÷ ¢Âðù¤ø¢ ýùÀªøÂê .......... triangle inequality uncomputable 2-3 tree þ ý c ¥¨ù¢¨ ............................. tree automaton tree sort ............. (ý¤ÁðÂ) þ ............................ traveling salesman traversal ¤Áð â .................. ...................... U ............................. zero-one principle ü÷Àª¤úõ ñÀ c ±õ d (´ã®ø Âç) ¤Áð .................. X xor ý÷eû ýû ............................. transition trinary weak induction worst-case ................ ¤ ´Þ÷¤ ......................... transducer trie W walk ô ,Ûõî ô °Â ......................... triangulation waiting time üØþ¦ó °Â üØþ¦ó ý¥¨°Âõ tractable . . . . . . . . . . . . . . . . . . . . . . . . . . . ................. vertex connectivity .......... towers of Hanoi ...................... vertex coloring Ñê/öõ¥ üðÀ» ............................... total order tournament V ..... ............. .............. ´¡÷×þ ´¡÷×þ ÅþÂõ ............................... ................................ universal hashing ........... áÞµ ÷Úþ ý¨¨ ý¥¨Ýû¤¢
© Copyright 2026 Paperzz