Table Of Content

Information Processing Letters ELSEVIER Information Processing Letters 76 (2000) 183-184 mnV/locat Subject Index — Volume 76 (2000) Algebraic specifications Graph colouring Algorithms 7, 45, 101, 141, 149, Graph connectivity Analysis of algorithms 5 Graphs Anomaly Gray codes Approximation algorithms Area skew Hypercube Arithmetic Automatic theorem proving i-triangulated graph Image coding Breadth-first search Information retrieval Interconnection networks Clnmesion Interpolation property Codes Intrusion detection Co, llapPs e k, -ary trees Combinatorial problems , 39, SI, , 169 Common-multiplicand multiplication 105 Lattice Communication networks 83 Lattice points enumeration Competitive ratio 149 Lattice vector quantization Computational complexity 61, 75, 91 Linear complexity Computational geometry 163 Longest increasing subsequence Concurrency 131 Loopless generation Counting 113 Lower bounds Cryptography 67, 95, 101, 105, 135 LPGS partition Cycle Maximization Databases Maximum weighted matching Davis—Putnam procedure Memory consistency Design of algorithms Memory management Diameter Minimum cut Discrete optimization Modular multiplier Distributed systems Montgomery algorithm ‘ Multi-way spatial join Elliptic curve Mutual exclusion Naor-Reingold pseudo-random function Fast exponentiation Neswask Gawe Feedback vertex set No: nlinear filtering Formal languages Formal semantics Online algorithms Furthest-site Voronoi diagrams Operating systems General Cook reduction Paging Graph algorithms Parallel algorithms Elsevier Science B.V. PII: $0020-0190(00)00190-3 Randomized Real-time syster Spanning tre Spatial databases Information Processing Letters ELSEVIER Author Index — Volume 76 (2000) Aerts, J., J. Korst and S. Egner, Random du Higuchi, A. and N. Takagi fast addition plicate storage strategies for load balancing algorithm for elliptic curve arithmeti in multimedia servers » (2000) 5 GF(2") using projective coordinates Bein, W.W., R. Fleischer and L.L. Larmore Kim, H.-S., S.-W. Lee and K.-Y. Yoo, Parti Limited bookmark randomized online algo tioned systolic architecture for modular 1 rithms for the paging problem » (2000) 5 tiplication in GF(2”) » (2000) Bespamyatnikh, S. and M. Segal, Enumerat Korst,J .. see Aerts, J. 76 (2000) ing longest increasing subsequences and pa tience sorting (2000) 7 Lamport, L., S. Perl and W. Weihl, When Borzyszkowski, T., Generalized interpolation does a correct mutual exclusion algorithn in CASI 2000) guarantee mutual exclusion Larmore, L.L., see Bein, W.W. Cai, J.-Y. and A. Nerurkar, A note on the non Lee, K.-J. and K.-Y. Yoo. Linear systolic NP-hardness of approximate lattice prob multiplier/squarer for fast exponentiation lems under general Cook reductions 76 (2000) Lee. S.-W.. see Kim. H.-S. Chen, Z.-Z.. see Uehara, R. (2000) 3 Li. CM. Equivalency reasoning to solve Chung, C.-W., see Park, H.-H. 2000) class of hard SAT problems (2000) Chung, K.-L. and W.-M. Yan, On the number Liu, J., see Xue, J. 2000) of spanning trees of a multi-complete/star Lopriore, L., Protection in a single-address related graph (2000) space environment 76 (2000 Comellas, F., J. Ozén and J.G. Peters, De- Luccio, F.L., see Focardi, R. 76 (2000) terministic small-world communication net- ‘ works 2000) Nerurkar, A., see Cai, J.-Y. 2000) Dobrev, S.. H. Schréder, O. Sykora Oz6n, J., see Comellas, F. (2000) I. Vrt’o, Evolutionary graph colouring 2000) Park, H.-H. and C.-W. Chung, Complexity Egner, S., see Aerts, J. 2000) Epstein, L., A note on on-line scheduling of estumating multi-way join result sizes for : ‘i area skewed spatial data (2000 with precedence constraints on identical ma Peleg, D., see Focardi, R. (2000) chines 2000) Perl, S., see Lamport, L. 76 (2000) Fleischer, R., see Bein, W.W. 76 (2000) 155 Peters, J.G., see Comellas, F. 76 (2000) Focardi, R., F.L. Luccio and D. Peleg, Feed- back vertex set in hypercubes (2000) Roussel, F. and I. Rusu, Recognizing /-trians Ss . ‘ graphs in O(mn) time Fuster-Sabater, A., see Garcia- Villalba, L.J. (2000) graphs in O(mn) time Rusu, I., see Roussel, F. Garcia-Villalba, L.J. and A. Fuster-Sabater, On the linear complexity of the sequences Schonlau, M. and M. Theus, Detecting mas generated by nonlinear filterings 7 querades in intrusion detection based on un : : popular commands » (2000) Hartuy, E. and R. Shamir, A clustering algo- Schroder, H., see Dobrev, S. » (2000) rithm based on graph connectivity 7 Segal, M., see Bespamvatnikh, S. (2000) Elsevier Science B.V PIL: $0020-0190(00)00191-5 Serra-Sagrista, J.. Enumeration of latt points Ushijima, K. Xiang, orm Shamir, R., see Hartuvy, E. ne Vrt’o, L. Dobrev, S. Shparlinski, LE., Line Naor—Reingold pseudo-randon nctior 5 Weihl, W., see Lamport, L. (2000) Sykora, O., see Dobrev, S. Xiang, L., K. Ushijima and C. Tang, Efficient Takagi, N., see Higuchi, A. . i op! I n of I Tan, X., On optimal bridge etween tw tree » (2000) mvex regions 76 (2000 3 Xue, J. : J. network-flow Tang, C., see Xiang, L. 200 | lower bou r the minimum weight Theus, M., see Schonlau, M. » (2000 3 nteger oring problem » (2000) Uehara, R. and Z.-Z. Chen, Parallel approx Yan, W.-M., see Chung, K.-L. » (2000) imation algorithms for maximum weighted Yoo, K.-Y.. see Kim, H.-S. 76 (2000) il graphs ) l Yoo, K.-Y., see Lee, K.-J. 76 (2000)