Table Of Content

Information Processing Letters ELSEVIER Information Processing Letters 78 (2001) 5—336 www.elsevier.com/locate/ipl Subject Index to Volumes 1-75 The numbers mentioned in this Subject Index refer to the Reference List of Indexed Articles (pp. 337-448 of this issue). 0,1 semaphore, 470 INPDA, 894 0,1 sequence, 768 1T-NPDA, 1065 (0, 1)-CVP, 2395 1T-NPDA(1), 1065 (O, 1)-matrix, 2395, 2462, 2588, 3550 1T-NPDA(k), 1065 (0, 2)-graph, 583 l-approximation algorithm, 3109 0/1 knapsack problem, 2404, 2529 1-bounded conflict free Petri net, 2154, 2369 OL l-center, 3000 language, 47, 2665 l1-colourable, 2299 scheme, 940 1-conservative Petri net, 2253 system, 47, 940 1-copy serializability, 3001 systems, 297 1-dimensional space, 281 OL-DOL equivalence problem, 456 1-DNF consistent with a positive sample, 3856 0-1 l-edge fault tolerant, 3467 integer programming, 3597 1-EFT graph, 3467 law, 3232, 3276 1-EFT(G), 3467 linear programming, 1533 graph, 3467 matrix, see (0, 1)-matrix l-enabled, 67 polynomial, 436 1-factor, 234 programming, 216 1-fault tolerant design, 3997 resource, 648 for token rings, 3997 0-capacity channel, 2055 1-Hamiltonian, 3997 0-dimensional object, 281 graph, 3675, 3997 0.5-bounded, 2404 1-inkdot Turing machine, 2473, 2752 greedy algorithm, 2404, 2529 1-MFA, 2063 (1,0)/(1, 1) ms precedence form, 955 1-neighborhood chordal, 3703 (1, 1)-disjoint Boolean sums, 3711 1-persistent protocol, 2487 (1, 1)-method, 26 1-resilient symmetric function, 2677 1ACMP-(k,i), 1139 1-restricted ETOL system, 778 IDFA, 663 1-SDR, 510 IDFA(3), 1371 problem, 510 IDFA(k), 1371 1-sided error logspace polynomial expected time, IDPDA, 1103 2616 IGDSAFA, 2038 1-spiral polygon, 2939 INFA, 663, 1065 l-vertex ranking, 3217 INFA(2), 1065 l-way checking stack automaton language, 144 INFA(k), 1065 1-width, 3658 0020-0190/2001 Published by Elsevier Science B.V. PII: S0020-0190(01)00175-2 Subject Index / Information Processing Letters 78 (2001) 5-336 l-writer multireader Boolean atomic variable, 2138 subgraph problem, 3456 1-writer multireader multivalued atomic 2-colors graph partition, 2597 register, 1721 problem, 2597 variable, 2138 2-competitive l-writer 2-server algorithm, 2216 multireader multivalued regular variable, 2138 algorithm, 3038 register, 1721 2-connected planar graph, 2010 2x2 algorithm, 351 2-D, see also 2D 2” class of moduli sets, 4107 array grammar, 1244 2” -ary tree, 1126 binary image, 2873, 3089 2ACMP(k,i), 1139 convolution, 2592 2AFA(1) = 1P2NFA(1) = Reg, 2145 grammar, 1244 2AFA(1), 2145 image transposition encryption, 3428 2CNF, 4055 language, 1244 formula, 3829 mesh of processors, 2673 2D, see also 2-D orthogonal wavelet transform, 2592 curved object, 2690 2-D string, 2242 C-string, 3614 matching problem, 2242 linear, 271 representation of a picture, 2242 linearity problem, 271 2-D string, 3614 torus, 2354 wormhole-routed mesh multicomputers, 4038 wavelet transform, 2592 2DFA, 663 2-DA, 395 2DFA(k), 1371 2-dimensional, 1699 2DPDA, 182, 547, 836, 909, 2930 checkboard, 857 with output, 182 convex hull problem, 363 without output, 182 mesh connected computer, 1810 2DPDA(1), 1022 space, 1014 2DPDA(k), 909 2-edge connected 2D-dimensional ECDF searching problem, 1583 graph, 3584 2D-matching spanning subgraph, 3737 algorithm, 2633 2-evader problem, 3261 problem, 2633 2-independent set, 2474 2LG, 1059 problem, 3456 specification, 1059 2-modular tree transformation, 2078 2N — k-closure problem, 3268 2-node connected, 3737 2NFA, 663 2-permutation, 175 2NPDA, 740, 894 2-process consensus, 1808 language, 894 2-processor 2NPDA(k), 814 simulation strategies, 3044 2PFA, 2488 tasks scheduling, 1027 2PP, 2058 2-QBF, 3237 2SAT, 3683 truth, 2597, 3237 2-3 tree, 206, 268, 365, 427, 475, 921, 2762, 3817 2-recipient 2-acyclic family of subtrees, 3703 1-buffer problem, 2192 2-APMPOTA, 571 problem, 2192 2-cache problem, 3558 2-REF, 3242 2-CGP, 2597 2-register machine, 4062 2-chain edge packing, 1842 2-restricted ETOL system, 778 2-CNF, 419, 1540, 2467, 3237 2-SAT formula, 2716 formula, 1540, 2467, 4003 2-satisfiability, 419, 630, 3079 satisfiability, 2597 2-SDR problem, 510 2-CNFSAT, 2597 2-sep chordal graph, 2499 2-colorable, 2299 2-server algorithm, 4066 Subject Index / Information Processing Letters 78 (2001) 5-336 2-server problem, 2216, 3558 3-spanner problem, 3347 2-state RCA, 2430 3-square free morphism, 915 2-tabled ETOL system, 778 3-Steiner distance, 3129 2-terminal problem, 1975 3-valued 2-treshold graph, 3073, 3173 shared variable, 3119 2-tree, 3620 wakeup protocol, 3119 2-way 3-way tree, 2718 deterministic pushdown automaton, 2930 4NF, 3533 infinite automaton with a pebble, 2262 relation scheme, 3533 2.5-factor approximation algorithm, 3667 4-canonical decomposition, 3542 2.5-times optimal algorithm, 530 4-colorable graph, 3561 3 symbol alphabet, 3 4-coloring, 353 3/2-approximation algorithm, 4117 4-connected 3D, see also 3-D array, 1244 drawing, 3561 planar graph, 1127, 1926, 3542 straight line grid drawing, 3561 plane triangulation, 1926 3n probe algorithm, 1236 set, 3696 3NF, 798, 2449, 2751, 3533 4-connectivity, 1926 3SAT, 561, 2067 test, 1926 3-approximation algorithm, 4016, 4023 4-star graph, 2583 3-colorable, 1395 5-coloring, 353, 1395 graph, 2534, 3446 5-connectivity, 1926 3-coloring, 2340, 2808 5-pebble automaton, 857 a graph, 1001 (6, 2)-chordal bipartite graph, 2643 of a planar graph, 353 6-competitive, 3315 3-colourable, 3651 6-head deterministic two-way finite automation, 3-colouring, 3651 1371 3-competitive, 4100 6-queens solution, 1767 3-connected, 2058 6-restricted ETOL system, 778 graph, 441, 2058 7-colored, 353 3-connectivity, 1926 7-coloring of planar graphs, 2340 3-D, see also 3D 7-multiplication method, 377 depth information, 3554 8-connectivity, 3127 torus of processors, 2390 8-puzzle problem, 1690 3-dimensional 8-restricted ETOL system, 778 dominance searching problem, 3746 9DLT matrices, 3614 information, 3554 15-puzzle, 2314, 3167 matching, 2088 80-20 rule, 449 3-element subset, 478 360° visibility, 3710 3-free DOL language, 948 802.4, 3501 3-layer network, 1762 network, 3501 3-matroid intersection problem, 130 1108 Lisp, 496 3-move identification scheme, 2997 3990 control unit, 1591 3-net wiring, 2508 3-partition, 1044, 1393 A 3-recipient 1-buffer problem, 2192 a posteriori methods, 229 3-regular planar a priori 1-Hamiltonian, 3997 Statistic, 49 graph, 2652 weight, 179 Hamiltonian graph, 3675 (a, b)-tree, 1261 3-restricted ETOL system, 778 A/D converter, 3898 3-SAT, 1802, 2731, 3087 A60D, 501 3-SAT = SAT, 3087 An, 13, 330, 1279 3-SATISFIABILITY, 561 A*, 1690, 1973, 2090, 2382, 2502, 2511 3-space, 746, 1057, 3599 A* x b*, 2502 Subject Index / Information Processing Letters 78 (2001) 5-336 A*-algorithm, 3592 abstract program, 412 Aanderaa-Rosenberg conjecture, 344 fragment, 1941 Aaron, Eric, 3616 abstract Aarts, 3527 programming language, 151 Abadi, 2282 relational algebra, 1881 Abadi, Lamport, and Plotkin, 2817 abstract semantics, 1035, 3920 Abadi, M. et al., 2282 of programs, 2707 Abbasi, Sarmad, 3513 abstract specification, 2282 abduction, 3386 of data structures, 620 Abdulla and Jonsson, 4021 abstract Abd-Alla, 609 structure, 284 Abelian syntax, 544 group, 30, 259, 1129, 2938, 3019 tape, 261 monoid, 3760 type, 412, 945 Ablow, Yoeli, and Turner, 162 Voronoi diagram, 3599 abnegation incident, 1811 abstracting numeric constraints, 4111 abort, 1422 abstraction, 1934, 3418, 3920, 3921 absence of algorithm, 1343 dead values, 1456 in linear space, 1343 deadlock, 962 process, 1343 forwards conflicts, 129 AC, 2252, 3644 live lock, 962 compatible, 3760 useless values, 1456 AC®, 2225, 2847, 3518 absolute reduction, 2349 l-center, 3000 AC? £NC!, 2847 entropy, 2112 AC®-reducible, 2349 error, 3422, 3993 ACAC® function, 3939 liveness, 1173 ACC®, 2600 privacy, 957 accelerated integer GCD algorithm, 3443 value, 138, 564, 2377, 3098, 3483, 4088 acceptable abstract identity, 4042 architecture, 3163 in the strong sense, 1550 basis, 1662 acceptance, 59 behavioral characteristics of windows, 1755 in the strong sense, 1550 computation model, 120 of an array, 71 abstract data test, 1713 structure, 105 testing, 3022 type, 261, 412, 620, 674, 1399, 1506, 1520, acceptation 2263, 3633 by multitape automata, 752 abstract in the weak sense, 1550 datatype, 316, 2068 of nonregular languages, 1550 design, 3649 accepted domain, 2348 by a finite automaton, 497 filter, 2679 in deterministic polynomial time, 2112 formalism, 172 string, 2549 formulation, 307 for-loop, 443 word, 1550 graph, 1652 accepting and generating rewriting systems, 3074 abstract interpretation, 2348, 2679, 2707, 3920, accepting computation, 814 4111 tree, 1550 framework, 3303 accepting abstract configuration, 666 machine, 1767, 2431, 3163, 3198 DPDA computations, 539 model, 63, 370, 1066, 1130 only regular languages, 2145 operation, 1520 state, 112, 201 production system, 3630 acceptor, 395, 571, 722, 749, 1981, 3139 Subject Index / Information Processing Letters 78 (2001) 5—336 9 acceptor for dependencies, 3360 a language, 1576 system, 3397 an sometric parallel context free array language, activation, 868, 1535 749 of actions, 1535 access control, 237, 1062, 1532, 1688, 1831, 2298 tree, 579 mechanism, 237, 654 active method, 654 attack, 3659 access node, 1512 cost, 224 processes, 1126, 1716 distribution, 1527 actual efficiency, 895 edge, 4071 frequency, 2114, 2373 parameter, 1817 function, 105 termination problem, 501 mechanism movement, 756 ACU compatible, 3760 methods for image databases, 3614 reduction ordering, 3760 modality, 333 acyclic, 2007, 3703 of data, 1855, 2996 c-e structure, 1788 operation, 2950 database schema, 1026 path, 1037, 1048, 1063, 1663, 2041 digraph, 997, 2007 pattern, 2557 acyclic directed probability, 224, 449, 756, 919 graph, 128, 865, 1347 request, 3732 hypercube, 1834 access rights, 2298 network, 1275 to global variables, 190 acyclic access structure, 3434, 3551, 3821, 3948 flow network, 375 access time, 203, 920, 1421, 1663 fraternal orientation, 2361 distribution, 4138 f-graph, 187 ses oni pe graph, 15, 335, 374, 636, 1652, 1745, 2041, a tree, 2243, 3523 an array element, 1297 hypergraph, 1672 local data base, 553 instruction stream, 470 shared information, 1023 accessibility, 1704, 1935 Omer, 123 join dependency, 3825 accessible region, 654 molecule, 123 set, 1837 network, 1780 orientation, 3995, 4054 accessing rules for descriptive information, 152 relational database, 3703 Acciaro, Vincenzo, 3241 subgraph problem, 2892 accumulation, 3423 theorem, 2150 accumulator, 27 acyclically oriented, 1834, 2034 accuracy, 2846 property, 4008 acyclicity, 1026, 1672, 2842, 3703 Aceto, Luca, 3618 in hypergraphs, 1672 achromatic number, 1758 AC-6, 3937 problem, 1758 AC-7, 3937 Ackermann, 3276 AC-8, 3937 function, 407, 471, 1441, 1882, 3425, 4127 ad absurdum reasoning, 1411 type, 1441 Ada, 548, 653, 753, 1012, 1383 acoustic scattering, 140 capabilities, 548 ACP process algebra, 3770 design, 548 acquire lock, 2742 overloading rules, 548 | acquisition, 103 ADABAS, 652 | of stochastic data, 52 Adém action conjecture, 3727 conflict, 2883 property, 3727 10 Subject Index / Information Processing Letters 78 (2001) 5-336 adaptative ordering, 114 architecture, 326 space, 708, 817, 2610 multiprogramming, 326 address translation, 708 adaptive scheme, 708 algorithm, 1273, 1854 address valued variable, 100 branching, 2654 addressing control, 1611 language, 370 controller, 1611 scheme, 21 Huffman code, 1009 Adelson-Velskii and Landis, 1216 learning, 1854 ADJ group, 620, 775 adaptive parallel sorting, 1885 adjacency algorithm, 2234 condition, 2176 adaptive procedure, 326 graph, 2092 adaptive routing, 2861 list, 309, 1132, 1994, 2108, 3275, 3457 method, 2861 adjacency matrix, 136, 252, 781, 2540, 3275 adaptive sorting algorithm, 2236 based algorithm, 759 adaptiveness, 326 of a graph, 20 adder, 1352, 2770 adjacency preserving embedding, 2176 adding adjacent, 170 a stack, 28 centroid, 164 arcs, 67 edges, 459, 2534, 2663, 3068 correctly, 2770 elements, 1465 mostly correctly, 2770 nodes, 69, 244 two n-bit numbers, 2770 vertices, 136, 299, 371, 2385, 2534, 2815, 3543, addition, 199, 215, 436, 694, 1164, 2526, 2620, 4048 2770, 2835, 3517 adjoint, 1006 and subtraction, 131 Adleman, 1948 addition chain, 1118, 1462, 1959 Adleman, DeMarrais, and Huang, 3962 method, 1529 administration of privileges, 1249 addition of real numbers, 257 admissibility, 1690, 1995 addition/subtraction, 3517 admissible chain, 1118 closure, 4076 additional lie pattern, 2105 constraint, 984, 1094, 2082 operator, 859 information, 1891, 1913, 2584, 2827 order, 4063 storage, 103, 511 predicate, 1995 additive, 2988, 3090, 3430 searching algorithm, 1450 clock constraint, 4105 admission control, 3841 additive complexity, 171, 436, 719, 1190, 3218 ADT, 2489, 2863 of bilinear problems, 719 function, 2489 additive GRAPH, 2489 metric, 3874 queries, 2489 number theory, 2798 adult string, 279 operation, 38, 171, 479, 3218 advance reservation, 3849 pseudorandom number generator, 38 adversarial noise model, 4035 weight, 2386 adversary, 503, 715, 2171, 2471, 3315, 4035, 4042 address calculation, 974, 1162 argument, 715 algorithm, 974 based lower bound, 715 address CRCW PRAM, 3573 field, 35 advice, 3144 generation, 2045, 2610 language, 1, 364 label, 52 aerial image, 509 lookup, 1717 AESA, 3210 mapping, 817, 933 metric space, 3210 order preserving, 114 aesthetic graph drawing, 2208 Subject Index / Information Processing Letters 78 (2001) 5-336 Afek, Y., 3563 Ait-Bouziad, Ahmed, 3657 affine Ajtai, 2847 approximation, 3606 Ajtai and Ben-Or, 1467, 2225 nonconditional recurrent system, 3905 Ajtai and Fagin, 1935 transformation, 336, 467, 1888, 2691 Ajtai et al., 1903, 2856, 3311 affinity, 4055 Ajtai, Komlés, and Szemerédi, 1095, 1814 AFL, 94, 680, 712, 1681 ak clustering, 3458 like operation, 982 Akers, S.B., D. Harel, and B. Krishnamurthy, 2222 operation, 2665 Akinar, Nakagawa, 2928 after Akl, 515, 2979, 3077, 3365, 3414, 3420 image, 652 Ak] and Toussaint, 467 images storage cost, 652 Akl, S.G., 3037, 3091, 3209, 3346, 3361, 3383, AG, 2938 3393, 3399, 3400, 3415, 3427, 3445, 3457, semi-unifier, 2938 3459, 3463, 3464, 3472, 3473, 3487, 3490, AGn, 3738 3491, 3514, 3522, 3524, 3529, 3530, 3544, Agarwal, Pankaj K., 3507 3549, 3573, 3574, 3587, 3604, 3606, 3607, age information, 2607 3615, 3634, 3671, 3672, 3679, 3680, 3688, agent 3702, 3719, 3751, 3752, 3785, 3799, 3817, calculus, 2294 3822, 3832, 3835, 3836, 3850, 3859, 3871, search, 3327 3877, 3878, 3879, 3881, 3883, 3900, 3905, valuation, 4103 3906, 3966 Aggarwal and Hawrylycz, 2454 Akman, 1673 Aggarwal et al., 1739 AKS Aggarwal, A., 2274 network, 1095 Aggarwal, A., M.M. Klawe, S. Moran, P. Shor, and sorting network, 1095, 1903 R. Wilber, 1739 Al Jabri, A.Kh., 3393 Aggarwal, Chandra, and Snir, 2562 AL operation, 251 aggregate, 443, 3984 ALI function, 2342, 2803 assertional language, 364 query, 4019 program system, 364 Agrawal, 4110 system, 364 Agrawal, Divyakant, 3602 Alam, Shamsul, 3528 Agrawal, Klein, and Ravi, 2843 Albers, Susanne, 3622 agreement, 3274, 3669, 4035 Albert and Lawrence, 1644 of many trees, 3153 Albert and E.C. Allan, 45 subtree, 2719 Alberts, 1550 Agui and Jimenez, 3702 Aleliunas et al., 1613 Ahmadian, Ahmad, 3416 Alexopoulos, Bourbakis, and Ioannou, 3428 Aho, 747 algebra, 78, 155, 412, 945, 1205, 1481, 1642, 1849, Aho and Corasick, 1179 2072, 2116, 2334, 2563, 3008, 3316, 3384, Aho and Ullman, 82, 289, 1526, 1837 3424 Aho et al., 2160 of two-level cause effect structures, 3384 Aho, A.V. and J.D. Ullman, 2318 Aho, Hirschberg, and Ullman, 295 system, 78 Aho, Hopcroft, and Ullman, 766, 1216, 2930 algebraic, 620, 952, 1006, 1159, 1450, 2563, 3196 Aho, Sagiv, and Ullman, 771 algorithm, 2690, 3846 Aho, Steiglitz, and Ullman, 283 approach, 256, 399, 412, 719, 1010 Aho-Corasick algorithm, 3970 calculus, 448, 1188, 3002 Ahuja, Mohan, 3329 algebraic characterization of AI, 2314, 2510 semantic independence, 2250 application, 2737 sets of processes, 275 problem, 1690 the behaviour of nonsequential systems, 322 Aichholzer, Oswin, 3892 algebraic air traffic control, 908 circuit, 3520 airline seat reservation, 1326 coefficient, 2240 12 Subject Index / Information Processing Letters 78 (2001) 5-336 algebraic complexity, 155, 171, 399, 591, 657, 674, algebraic rewrite 692, 936, 1164, 1188 rule, 2366 measure, 674 system, 2366 theory, 1271, 3767 algebraic algebraic computation, 2043 semantics, 1642, 2046, 2563 algebraic computation tree, 1159 specification, 412, 775, 1101 model, 1791, 2221, 2952, 3693, 4092 structure, 316, 399, 454, 775, 2068, 2753, 3990 algebraic structures with equal expressiveness, 775 computational complexity, 719 surface, 2043 curve, 2690 system, 1259, 1481, 1603, 2018 data type, 775 test, 355 algebraic decision tree, 1355, 1505, 1599, 1791, algebraic theory, 794, 2259 2274, 3525, 3535 of concurrency, 1639 lower bound, 1863 algebraic type, 620 algebraic decision tree model, 1355, 2274, 2384 algebraically, 275, 4006 of computation, 1501, 3642 equivalent expression, 145 algebraic decoding, 3846 specified abstract type, 448 algorithm, 3846 Algol, 2, 4, 17, 34, 58, 60, 68, 82, 152, 156, 230, algebraic definition, 454 237, 238, 262, 343, 465, 501, 544, 548 algebraic degree, 4093 implementation problem, 17, 68 of a Boolean function, 4093 language, 58, 68 algebraic Algol like differentiation, 334 array, 443 equation, 561, 976, 2563 FOR-loop, 443 expression, 1259, 2653 language, 5, 500, 763, 1408 algebraic formal power series, 1931 Algol in noncommuting variables, 1931 machine, 199 algebraic mode, 55, 68 formula, 1870 multiple values, 230 function, 3448 program, 501 geometric code, 3641 scope rules, 975 geometry, 2927 style identifier, 244 grammar, 720 WHILE-loop, 443 group, 357 algorithm, 9, 14, 15, 17, 18, 27, 32, 35, 37, 40, 42, identity, 145 47, 49, 54, 64, 69, 70, 76, 82, 87, 96, 99, 101, interpretation, 3196 102, 108, 110, 112, 115, 122, 128, 136, 138, language, 94, 795, 3078 152, 155, 156, 165, 166, 167, 168, 170, 176, law, 2563, 2590 178, 181, 184, 192, 194, 205, 206, 215, 216, machinery, 2040 217, 219, 220, 222, 223, 226, 231, 240, 247, manipulation, 780, 1286 249, 251, 252, 255, 263, 265, 266, 281, 282, method, 399, 463, 2043, 2549 283, 285, 288, 290, 295, 299, 301, 306, 308, algebraic number, 1667, 2163, 3962 field, 2163 309, 312, 315, 319, 320, 324, 326, 328, 329, algebraic 331, 335, 336, 338, 341, 342, 346, 350, 353, operation, 399, 608, 2072, 3572 354, 358, 363, 365, 366, 367, 368, 371, 372, operator, 795, 1870 374, 375, 378, 380, 381, 385, 391, 392, 393, polynomial, 2240 398, 399, 405, 406, 407, 414, 415, 416, 417, process, 3293 422, 423, 427, 428, 429, 431, 432, 433, 437, algebraic program, 294 439, 441, 444, 448, 449, 450, 451, 453, 454, level style, 2867 458, 467, 468, 471, 490, 492, 494, 498, 499, testing, 355 505, 509, 510, 511, 512, 515, 517, 518, 522, algebraic 523, 526, 530, 534, 536, 538, 540, 541, 545, properties, 814, 2867, 3097 547, 548, 552, 558, 559, 560, 565, 567, 568, quantities, 719 569, 570, 573, 577, 580, 582, 583, 588, 589, reasoning, 2563 593, 594, 598, 600, 602, 615, 616, 618, 626, Subject Index/ Information Processing Letters 78 (2001) 5-336 13 algorithm (cont.), 630, 631, 634, 636, 638, 641, 645, 1908, 1911, 1913, 1915, 1916, 1922, 1924, 656, 673, 674, 677, 678, 684, 689, 699, 701, 1925, 1926, 1928, 1930, 1932, 1933, 1937, 702, 705, 707, 714, 726, 728, 729, oaks 736, 1939, 1943, 1946, 1947, 1949, 1954, 1955, 737, 741, 743, 746, 748, 750, 759, 761, 766, 1956, 1958, 1961, 1965, 1969, 1970, 1972, 767, 781, 784, 788, 789, 793, 794, 797, 805, 1978, 1980, 1981, 1982, 1983, 1984, 1989, 807, 808, 813, 814, 818, 819, 823, 824, 825, 1990, 1992, 1994, 1997, 2003, 2005, 2006, 833, 836, 840, 841, 842, 850, 856, 858, 859, 2009, 2011, 2013, 2020, 2022, 2023, 2028, 865, 868, 873, 881, 887, 892, 893, 894, 901, 2030, 2032, 2035, 2036, 2049, 2050, 2051, 903, 905, 908, 909, 912, 913, 916, 918, 923, 2061, 2062, 2067. 2069, 2071, 2074, 2075, 925, 929, 935, 937, 942, 947, 950, 952, 955, 2090, 2093, 2098, 2102, 2103, 2104, 2106, 956, 960, 961, 963, 965, 968, 969, 970, 971, 2108, 2111, 2112, 2115, 2117, 2119, ei ee, 976, 981, 991, 992, 994, 998, 1001, 1002, 2123, 2142, 2148, 2150, 2151, 2132, 2155, 1003, 1005, 1009, 1010, 1014, 1016, 1020, 2157, 2160, 2162, 2164, 2165, 2166, 2169, 1024, 1030, 1033, 1042, 1043, 1044, 1046, 2170, 2171, 2172, 2173, 2185, 2187, 2193, 1050, 1052, 1058, 1065, 1079, 1082, 1084, 2194, 2197, 2201, aaah, heh, 2216, eeit, 1087, 1090, 1100, 1112, 1115, 1116, 1119, 2221, 2226, biel y 2228, 2229, 2232, 2233, 1123, 1125, 1126, 1128, 1129, 1135, 1136, 2235, 2236, 2239, 2241, 2246, 2247, 2256, 1137, 1140, 1141, 1142, 1144, 1149, 1154, 2257, 2260, 2263, 2264, on Fo, 2276, 2278, 1159, 1162, 1163, 1172, 1174, 1177, 1179, 2280, 2283, 2287, 2289, meh, 2292, 2293, 1182, 1184, 1186, 1187, 1188, 1190, 1192, 2300, 2301, 2302, 2305, 2308, 2o8k, 2314, 1193, 1197, 1199, 1201, 1203, 1204, 1206, 2315, 2318, 2319, 2322, 2323, 2331, ya 5 9m 1218, 1220, 1221, 1223, 1224, 1225, 1228, eos, 2338, 2340, 2345, 2347, eaaks pin 1230, 1231, 1243, 1245, 1247, 1248, 1250, 2356, 2357, 2359, 2360, 2361, 2371, 2374, 1251, 1253, 1257, 1260, 1261, 1262, 1264, 2375, 2377, bat, 2382, 2385, 2388, 2390, 1265, 1266, 1267, 1268, 1271, 1272, 1273, 2392, 2394, 2399, 2404, 2407, 2410, 2411, 1275, 1276, 1281, 1287, 1290, 1293, 1296, 2412, 2413, 2415, 2416, 2417, 2423, 2426, 1300, 1303, 1307, 1308, 1314, 1315, 1318, 2427, 2438, 2440, 2446, 2449, 2450, 2455, 1322, 1328, 1330, 1331, 1338, 1339, 1343, 2457, 2460, 2464, 2465, 2467, 2468, 2469, 1344, 1345, 1346, 1347, 1349, 1350, 1353, 2471, 2474, 2475, 2476, 2477, 2478, 2480, 1356, 1357, 1360, 1361, 1362, 1365, 1368, 2483, 2484, 2486, 2494, 2498, 2512, 2515, 1369, 1373, 1376, 1380, 1385, 1386, 1389, 2517, 2518, 2524, 2527, 2528, 2529, 2530, 1392, 1395, 1396, 1398, 1399, 1400, 1401, 2531, 2532, 2533, 2534, 2535, 2537, 2538, 1403, 1404, 1405, 1411, 1413, 1414, 1421, 2540, 2546, 2547, 2550, yaF M 2553, 2554, 1428, 1430, 1431, 1436, 1443, 1444, 1446, 2556, 2509, 2561, 2568, 2569, 2570, 2572, 1447, 1450, 1453, 1455, 1485, 1488, 1493, a1, 2575, 2581, 2588, 2591, 2592, 2594, 1501, 1502, 1509, 1514, 1518, 1519, 1525, 2595, 2596, 2599, 2604, 2610, 2627, 2628, 1530, 1533, 1536, 1537, 1538, 1539, 1543, 2631, 2636, 2637, 2640, 2642, 2643, 2646, 1544, 1546, 1551, 1552, 1558, 1562, 1565, 2648, 2649, 2652, 2654, 2655, 2659, 2660, 1566, 1569, 1573, 1575, 1576, 1578, 1580, 2661, 2662, 2663, 2664, 2670, 2671, 2673, 1582, 1583, 1590, 1592, 1594, 1599, 1601, 2674, 2678, 2680, 2681, 2682, 2683, 2686, 1603, 1605, 1609, 1610, 1619, 1623, 1624, 2687, 2688, 2689, 2691, 2695, 2697, 2698, 1631, 1634, 1637, 1638, 1640, 1641, 1646, 2699, 2705, 2708, 2711, 2715, 2716, 2719, 1648, 1653, 1664, 1666, 1668, 1669, 1670, Zizi, 2725, 2726, 2728, 2735, 2740, 2741, 1671, 1673, 1680, 1683, 1684, 1685, 1690, 2742, 2745, 2746, 2747, 2748, YS dn 2755, 1699, 1700, 1701, 1703, 1706, 1712, 1713, 2756, aio, 2758, 2759, 2761, 2762, 2763, 1715, 1718, 1720, 1725, 1726, 1729, 1733, 2764, 2765, 2766, 2770, 2771, at tks 2774, 1735, 1736, 1738, 1739, 1740, 1741, 1742, 2775, Siti, 2782, 2783, 2784, 2786, 2790, 1743, 1752, 1754, 1756, 1757, 1763, 1765, 2791, 2792, 2798, 2799, 2804, 2805, 2807, 1766, 1767, 1768, 1770, 1772, 1773, 1775, 2808, 2810, 2813, 2814, 2818, 2819, 2820, 1777, 1780, 1795, 1797, 1801, 1804, 1805, 2822, 2823, 2824, 2825, 2826, 2827, 2829, 1806, 1810, 1813, 1816, 1818, 1819, 1821, 2831, 2834, 2836, 2838, 2840, 2843, 2844, 1826, 1829, 1835, 1837, 1840, 1850, 1854, 2850, 2851, 2855, 2857, 2863, 2864, 2865, 1857, 1859, 1862, 1865, 1869, 1872, 1873, 2866, 2871, 2872, 2873, 2874, 2878, 2889, 1876, 1879, 1883, 1884, 1885, 1888, 1890, 2891, 2892, 2893, 2894, 2895, 2904, 2908, 1895, 1896, 1898, 1899, 1900, 1903, 1907, 2909, 2911, 2914, 2915, 2916, 2918, 2919, 14 Subject Index / Information Processing Letters 78 (2001) 5-336 algorithm (cont.), 2920, 2930, 2931, 2932, 2933, 3985, 3986, 3992, 3994, 3995, 3996, 4003, 2934, 2938, 2939, 2940, 2945, 2947, 2952, 4006, 4007, 4009, 4011, 4013, 4015, 4016, 2959, 2961, 2965, 2966, 2967, 2968, 2971, 4017, 4020, 4024, 4030, 4037, 4039, 4040, 2975, 2976, 2977, 2987, 2989, 2990, 2997, 4041, 4043, 4045, 4054, 4055, 4056, 4057, 3000, 3001, 3011, 3013, 3016, 3022, 3024, 4058, 4064, 4065, 4066, 4072, 4074, 4077, 3034, 3038, 3039, 3044, 3045, 3048, 3054, 4079, 4080, 4081, 4082, 4083, 4084, 4087, 3055, 3056, 3057, 3059, 3060, 3062, 3063, 4092, 4094, 4098, 4 102, 4103, 4117, 4120, 3064, 3070, 3073, 3078, 3079, 3080, 3083, 4122, 4125, 4128, 4129, 4130, 4133, 4136, 3085, 3089, 3090, 3098, 3104, 3105, 3109, 4139, 4140, 4141 SLEZ; SET; 3120, 3121, 3122, 3123, 3124, analysis, 215, 285, 998, 1406, 2122, 2606 3129, 3133, 3139, 3143, 3147, 3148, 3152, algorithm animation, 3371 3153, 3154, S190, 3157, 3159; 3162, 3167, system, 3371 3168, 3169, 3170, 3171, 3174, 3176, 3177, algorithm 3179, 3181, 3185, 3187, 3191, 3192, 3193, BE, 1243 3200, 3205, 3212, 3217, 3218, 3219, 3227, complexity, 1092, 2901 322m, 3650, 3239, S405, SAI%, 3256, 3262, algorithm design, 306, 813, 861, 1387, 2503, 2579 3264, 3266, 3267, 3269, 3272, 3273, 3275, and analysis, 1765, 2182 3277, 3278, 3284, 3286, 3287, 3289, 3293, algorithm E, 54, 437 3294, 3295, 3297, 3298, 3299, 3301, 3305, algorithm for, 15, 255 5500, Jia, 3313, 3314, 3315, 3320, 3322, 2-satisfiability, 630 3327, 3330, 3331, 3334, 3337, 3338, 3339, a dictionary instruction, 206 3340, 3342, 3344, 3345, 3348, 3350, 3351, adaptive Huffman codes, 1009 3354, 3363, 3368, 3369, 3370, SSF1, 328, BFS, 1582 3376, 3378, 3379, 3380, 3382, 3383, 3386, binary search, 1004 3388, 3389, 3391, 3398, 3401, 3405, 3410, calculating addresses, 974 3411, 3412, 3413, 3415, 3416, 3419, 3421, cliques, 69 colouring perfect planar graphs, 1752 3423, 3425, 3426, 3429, 3431, 3433, 3436, algorithm for computing a 3440, 3443, 3445, 3452, 3455, 3456, 3457, basis, 1129 3460, 3461, 3462, 3471, 3474, 3476, 3477, complete basis, 1129 3482, 3485, 3486, 3487, 3489, 3491, 3494, algorithm for computing 3503, 3507, 3508, 3510, 3511, 3513, 3516, all derivatives, 283 3524, 3527, 3528, 3531, 3536, S557, 3339, products of quaternions, 155 3542, 3544, 3545, 3546, 3547, 3548, 3550, algorithm for convex hull 3552, 3553, 3554, 3560, 3562, S512, 3319, computation, 3211 3576, 3577, 3578, 3579, 3584, 3585, 3590, determination, 569 3595, 3596, 3597, 3607, 3612, 3615, 3617, algorithm for 3619, 3621, 3622, 3623, 3624, 3625, 3628, convex hulls, 64, 363 3629, 3632, 3637, 3642, 3645, 3646, 3648, copying binary trees, 176 3650, 3656, 3657, 3661, 3662, 3663, 3666, deciding the containment of polygons, 3375 3667, 3669, 3673, 3676, 3685, 3688, 3691, decryption, 437 3693, 3694, 3698, 3700, 3702, 3703, 3707, algorithm for determining 3708, 3712, 3713, 3715, 3716, 3719, 3720, isomorphism of planar graphs, 9 3721, 3722, 3724, 3725, 3726, 3728, 3729, the bridges of a graph, 14 3733, 3734, 3737, 3748, 3749, 3756, 3758, algorithm for 3763, 3766, 3769, 3772, 3776, 3777, 3781, diagnosing faulty processors, 1668 3783, 3784, 3786, 3790, 3791, 3792, 3794, difference equations, 4147 3795, 3796, 3799, 3802, 3803, 3805, 3807, discrete simulation, 269 3808, 3809, 3816, 3817, 3822, 3826, 3828, distributing nonsequential application programs, 3834, 3836, 3844, 3846, 3849, 3854, 3856, 883 3857, 3860, 3864, 3866, 3870, 3877, 3878, division, 1680 3881, 3888, 3892, 3896, 3899, 3902, 3903, drawing general undirected graphs, 1738 3904, 3913, 3917, 3918, 3919, 3924, 3926, ECP, 3808 3927, 3928, 3930, 3931, 3932, 3937, 3941, algorithm for edge 3942, 3943, 3947, 3949, 3950, 3954, 3955, detection, 963 3960, 3961, 3965, 3967, 3970, 3972, 3982, disjoint branching, 121