Information Processing Letters 2000: Vol 74 Index

4 Pages·2000·0.84 MB·English

Information
Processing
Letters
ELSEVIER
Information Processing Letters 74 (2000) 265-266
www.elsevier.com/locate/ipl
Subject Index Volume 74 (2000)
Admissible orders 15 Force-directed method
Algebraic degree 191 Formal languages
Algorithmic invariant theory 15 Formal methods
Algorithms 7, 19, 41, 81, 97, 103, 107, Formal semantics
125, 1357, 215, 229 Formal specifications
Alternating groups 15 Fuzzy logic
Analysis of algorithms 1, 81
Approximation algorithms 1,19 Graph
ATM delay analysis 163 Graph algorithms
Automatic theorem proving 35, 147 Graph drawing
Graph partition
Biconnected component 107 Ground term rewriting
Boolean functions 91, 191
BSP model 141 Information retrieval 209, 235
Information theory 235
Claw-free graph 115 Integer programming 19
Cographs 129 Interval narrowing 141
Combinatorial optimization 123 Isomorphism 97
Combinatorial problems 81, 191
Competitive analysis 73 k-median problem 81
Complexity 97, 129 k-server problem 73
Computational complexity 1, 41, 91, 123, 157, 197
Computational geometry 103, 183, 253 Linear complexity profile
Constraint Logic Programming 147 Lower bounds
Constraint propagation 141
Correlation immunity 19]
Manhattan metric
Cryptography 175, 191, 243
Matrix
Maximal model generation
Data types 65 Medians
Depth-first search 107, 215 Min-transitivity
Design of algorithms 73, 221, 229 Minimum weight matching
Determinant 197 Minimum-weight triangulation
Diamond-free graph 115 Modularization property
Distributed computing 203 Mutual exclusion
Distributed systems 257
Dynamic programming 81 Negation
Network flow
Edge classification Numerical algorithms
Error propagation
Expressions Online algorithms
Ordered binary decision diagrams
Fault tolerance Output-polynomial
Elsevier Science B.V.
266 Subject Index Volume 74 (2000)
Packing 19 Software design
Paging 73 Software engineering
Parallel algorithms 129, 141 Specification
Parallel database 235 Stable storage
Performance evaluation 163 Stack
Programming languages 47, 147 State preservation
Pseudorandom sequence 175 Statistical delay bound
String
Query evaluation 209 Strongly connected component
Submodular function
Random walks 203 Subsequence
Randomized algorithms 73 Symmetric encryption schemes
Real-time systems 163
Reciprocals of power series 41 Temporal logic 55
Recognition 129 Theory of computation 27, 35, 65
Rely—guarantee discipline 55 Threshold graphs 129
Rewrite constraints 35 Transversal hypergraph 157
Routing 19 Tree 229
SAGBI bases 15 Unification 35
Second-order unification 47
Secret sets 243 Variable ordering 91
Self-stabilization 203 Verification 55
Set constraints 27
Signature file 235 Weighted discrete set 103
Similarity relation 215 Weighted graph 215
Simplicial vertex 115
|
Information
Processing
Letters
ELSEVIER Information Processing Letters 74 (2000) 267-268
www.elsevier.com/locate/ipl
Author Index Volume 74 (2000)
Baveja, A. and A. Srinivasan, Approximating Golin, M.J., see Vigneron, A. 74 (2000)
low-congestion routing and column-restricted Granvilliers, L. and G. Hains, A conservative
packing problems 74 (2000) 19 scheme for parallel interval narrowing 74 (2000)
Bein, W.W. and L.L. Larmore, Trackless on-
line algorithms for the server problem 74 (2000) 73 Hains, G., see Granvilliers, L. 74 (2000)
Bertault, F., A force-directed algorithm that Hastad, J., On bounded occurrence constraint
preserves edge-crossing properties 74 (2000) satisfaction 74 (2000)
Bouajjani, A., J. Esparza, A. Finkel, O. Ma-
ler, P. Rossmanith, B. Willems and P. Wol- Im, B.-M., M.H. Kim, H.-I. Kang and J.S.
per, An efficient automata approach to some Yoo, Declustering signature files based on a
problems on context-free grammars 74 (2000) dynamic measure 74 (2000)
Italiano, G.F., see Vigneron, A. 74 (2000)
Chen, W., Multi-subsequence searching 74 (2000) 229 Iwata, S., S.T. McCormick and M. Shigeno,
Chin, F.Y., see Wang, C.A. 74 (2000) 183 A fast cost scaling algorithm for submodular
Chung, K.-L., On finding medians of weighted flow 74 (2000)
discrete points 74 (2000)
Kang, H.-I., see Im, B.-M. 74 (2000) 235
Das, G. and M. Smid, A lower bound for ap- Kavvadias, D.J., M. Sideri and E.C. Stavro-
proximating the geometric minimum weight poulos, Generating all maximal models of a
matching 74 (2000) Boolean expression 74 (2000) 157
Khuller, S., Addendum to “An O(|V|?) al-
De Santis, A. and B. Masucci, On secret set
schemes 74 (2000) gorithm for single connectedness” [Infor-
Dimitrakos, T. and T. Maibaum, On a gener- mation Processing Letters 72 (3-4) (1999)
alized modularization theorem 74 (2000) 105—107] (Erratum) 74 (2000) 263
Dovier, A., E. Pontelli and G. Rossi, A neces- Kim, M.H.., see Im, B.-M. 74 (2000) 235
sary condition for Constructive Negation in Kloks, T., D. Kratsch and H. Miiller, Finding
Constraint Logic Programming 74 (2000) 147 and counting small induced subgraphs effi-
Duarte, C.H.C. and T. Maibaum, A rely— ciently 74 (2000) 115
guarantee discipline for open distributed Kratsch, D., see Kloks, T. 74 (2000) 115
systems design 74 (2000) 55 Kundu, S., An optimal O(N 2) algorithm for
Durand-Lose, J., Randomized uniform self- computing the min-transitive closure of a
stabilizing mutual exclusion 74 (2000) 203 weighted graph 74 (2000) 215
Kuo, S.-Y., see Lin, J.-W. 74 (2000) 257
Esparza, J., see Bouajjani, A. 74 (2000) 221
Larmore, L.L., see Bein, W.W. 74 (2000) 73
Finkel, A., see Bouajjani, A. 74 (2000) 221 Li, B., see Vigneron, A. 74 (2000) 81
Lin, J.-W. and S.-Y. Kuo, Resolving error
Gabow, H.N., Path-based depth-first search for propagation in distributed systems 74 (2000) 257
strong and biconnected components 74 (2000) 107
Gao, L., see Vigneron, A. 74 (2000) 81 Maibaum, T., see Dimitrakos, T. 74 (2000) 65
Gobel, M., Rings of polynomial invariants of Maibaum, T., see Duarte, C.H.C. 74 (2000) 55
the alternating group have no finite SAGBI Maler, O., see Bouajjani, A. 74 (2000) 221
bases with respect to any admissible order 74 (2000) 15 Masucci, B., see De Santis, A. 74 (2000) 243
Elsevier Science B.V.
268 Author Index Volume 74 (2000)
McCormick, S.T., see Iwata, S. 74 (2000) 123 Shigeno, M., see Iwata, S. 74 (2000) 123
Miiller, H., see Kloks, T. 74 (2000) 115 Sideri, M., see Kavvadias, D.J. 74 (2000) 157
Smid, M., see Das, G. 74 (2000) 253
Ng, J.K.-Y., S. Song and W. Zhao, Statistical Song, S., see Ng, J.K.-Y. 74 (2000) 163
delay analysis on an ATM switch with self- Srinivasan, A., see Baveja, A. 74 (2000) 19
similar input traffic 74 (2000) 163 Stavropoulos, E.C., see Kavvadias, D.J. 74 (2000) 157
Niehren, J., S. Tison and R. Treinen, On
rewrite constraints and context unification 74 (2000) 35
Talbot, J.-M., The 3¥” fragment of the first-
Nikolopoulos, S.D., Recognizing cographs and
order theory of atomic set constraints is n)-
threshold graphs through a classification of
hard 74 (2000) 27
their edges 74 (2000) 129 Tison, S., see Niehren, J. 74 (2000) 35
Treinen, R., see Niehren, J. 74 (2000) 35
Pontelli, E., see Dovier, A. 74 (2000) 147
Pudlak, P., A note on the use of determinant for
Veanes, M., Farmer’s Theorem revisited 74 (2000) 47
proving lower bounds on the size of linear
Vigneron, A., L. Gao, M.J. Golin, G.F. Ital-
circuits 74 (2000) 197
iano and B. Li, An algorithm for finding a
k-median in a directed tree 74 (2000) 81
Ramnath, S. and P. Zhao, On the isomorphism
of expressions 74 (2000) 97
Rao, R.P.N., J. Rothe and O. Watanabe, Cor- Wang, C.A., F.Y. Chin and B. Yang, Triangu-
rigendum to “Upward separation for FewP lations without minimum-weight drawing 74 (2000) 183
and related classes” [Information Processing Watanabe, O., see Rao, R.P.N. 74 (2000) 89
Letters 52 (1994) 175-180] (Erratum) 74 (2000) 89 Wegener, I., Worst case examples for opera-
Rossi, G., see Dovier, A. 74 (2000) 147 tions on OBDDs 74 (2000) 91
Rossmanith, P., see Bouajjani, A. 74 (2000) 221 Willems, B., see Bouajjani, A. 74 (2000) 221
Rothe, J., see Rao, R.P.N. 74 (2000) 89 Wolper, P., see Bouajjani, A. 74 (2000) 221
Sarkar, P., A note on the spectral characteri-
Yang, B., see Wang, C.A. 74 (2000) 183
zation of correlation immune Boolean func-
Yang, J.D., A concept-based query evaluation
tions 74 (2000) 191
with indefinite fuzzy triples 74 (2000) 209
Schneider, M., On distribution properties of
Yoo, J.S., see Im, B.-M. 74 (2000) 235
sequences with perfect linear complexity
profile 74 (2000) 175
Schénhage, A., Variations on computing recip- Zhao, P., see Ramnath, S. 74 (2000) 97
rocals of power series 74 (2000) 41 Zhao, W., see Ng, J.K.-Y. 74 (2000) 163