- Email: [email protected]
Author index volume 38 (1991)
Information Processing North-Holland
343-344
(The issue number is given in front of the page numbers.) Acketa, D.M. and J.D. %uni& On the number of
linear partitions of the
(m,
Floren, R., A note on “A faster approximation (3) 163-169 (1) 49- 55
n&rid
Akl, S.G., see Chen, Cf.-Y. Alvarez,
C. and J. Gabarr6. The parallel complexity of two problems on concurrency
Bandyopadhyay, A.K., see Pramanik, P. Basart, J.M.. Some upper bounds for minimal
(2)
61-
70
(3) 157-161 (4) 209-213
trees Bradford, J.H. and T.A. Jenkyns,
quacy of tournament SCS problem Cai,
J.-y. and LA.
On the inadealgorithms for the 1v-
Hemachandra,
(4) 177-178
forming
(5) 271-275
relational
join is NP-hard
Gabarr6, J., see Alvarez, C. Gasarch, W.I., On selecting the k largest with
(2) 61- 70
restricted quadratic queries A.V., Processor-efficient implementation of a maximum flow algorithm GoraEik, P., A. GoraEkovir and V. Koubek, Alternation with a pebble
(4) 193-195
Goldberg, (4) ‘169-171
GoralGkov&
A note on
A., see Coral&,
P.
(4) 179-185 (1) (1)
7- 13 7- 13
(4) 215-219
enumerative counting Chen, C.C.-Y., S.K. Das and S.G. Akl. A unified
approach to paraiiei depth-first general trees
algorithm for the Steiner problem in graphs” F. and S. Pramanik, Problem of optimizing the number of block accesses in per-
Fotouhi,
Hambrusch,
traversals of
Chen, W.-T., see Homg, S.-J.
Cheng, X., A graph transformation algorithm for concurrency control in a partitioned database Choe, K.-M., see Lee, M.-J. Chow, Y.-C., see Luo, K. Chrobak, M. and L.L. Larmore, A note on the server prubiem and a benevolent adversary
Croehemore, M. and W. Rytter, Efficient parallel algorithms to test square-freeness and factorize strings
(1) 49(1) 29-
55 37
(1)
48
43-
(5) 281 (6) 307-313 (4) 173-175
Das, SK., see Chen, C.C.-Y. Dielissen, V.J. alld A. Kaldewaij,
Rectangular partition is polynomial in two dimensions but NP-complete in three Du, W., see Elmagarmid, A.K. Elm%garmid, A.#. and W. Du. Integrity aspects of quasi serializability Fang
(2) 57- 60
.A. Williams, matroids and hierarchical graphs
(6) 283-289 (3) 157-161 (1) 49- 55
(1)
l-
(1)
23-
6 28
Irani, S., Two results on the list update problem S.
(6) 301-306 (3) 143-148
Jenkyns, T.A., see Bradford, J.H.
(4) 169-171
Kalamboukis, T.Z. and S.L. Mantzaris. Towards optimal distributed election on chordal rings ielissen, V.J. Tate, Online matching with
(5) 265-270 (1) l6 (3; 113-116
cardinality
stacks
and
an
(1) 23- 28
(3) 117-121
(5) 231-235
(1) 29- 37
local memory
blocked input Kennedy, R., Parallel
On
(5) 257-263 (4) 215-219 (6) 329-334
Problem Hershberger, J., A new data structure for shortest path queries in a simple polygon Homg, S.-J., W.-T. Chen and M.-Y. Fang, Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with
Iyengar, S.S., see Rajanarayanan,
(1) 29- 37 (3) 157-161
Fay,
Hemachandra, L.A., see Cai, J.-y. Herley, K.T., A note on the Token Distribution
restricted
Danzig,
P.B., A cooperative game with applications to computer networks Das, P.K., see Pramanik, P.
S. and M. Luby. Parallel asynchronous connected components in a mesh
(6) 295-299 manik. The FX distribu. allel processing of parltal (5) 243- 252 (6) 307-313 (1) 7- 13
Elsevier Science Publishers B.V. (North-Holland) 343
L., Circuits for computing the GCD of two polynomials over an algebraic number fie!?
Larmore, L.L., see Chrobak, M. Latifi, S., Distributed subcube identification
al-
Luby, M., see Hambrusch, S. Luo, K., W. Klostermeyer, Y.-C. Chow and R. Newman-Wolfe, Optimal deadlock resolu-
tions in edge-disjoint graphs
reducible
(3) 129-134 (4) 173-175
gorithms for reliable hypercubes Lee, M.-J. and K-M. Choe, SLR(k) covering for LR( k ) grammars (Corrigenda ) Leiss, E.L. and H.N. Reddy, Embedding complete binary trees into hypercubes Lingas, A., Bit complexity of matrix products
(4) 197-199
Reddy, H.N., see Leiss, Rote, G., G. Woeginge
Langemyr,
(6) 315-321
(5) 281 (4) 197-199 (5) 237-242
ang,
Counting k-subsets and convex k-gons in the plbne Rote, G., Computing the minimum Hausdorff distance between two point sets on a line under translation Rytter, W. and A. Saoudi, On the complexity of the recognition of parallel ZD-image languages Rytter, W., see Crochemore,
M.
(6) 307-313
Sakkinen, M., Selftype is a special case Saoudi, A., see Rytter, W. Shonkwilor, R., Computing the Hausdorff set distance in linear time for any L, point dis-
(5) 265-270
Shoup, V., Smoothness
(2) 77- 81 Martel, C.. Self-adjusting multi-way search trees (3) 135-141 Mato&&, J., Computing dominances in E” (5) 277-278 ( Short communicufivn ) MeidGnis, J.. Lower bounds for arithmetic prob(2) 83.- 87 lems Messeguer, X., Dynamic behaviour in updating process over BST of size two with probabilis(2) 89-100 tic deletion algorithms (2) 107-l 11 Minsker, S., The Towers of Antwerpen problem (2) 101-105 Misra, J., Phase synchronization Mhuk, M., A div(n) depth Boolean circuit for (3) 153-156 smooth modular inverse
Nawrocki, J.R., Conflict detection and resolution
(6) 323-328
in a lexical analyzer generator
(5) 225-229 (2) 57- 60
(6) 307-313
(4) 221-224 (5) 225-229
(4) 201-207
tance
Newman-Wolfe, R., see Luo, K.
(3) 123-127
(5) 257-263
wait-for
Mantzaris, S.L., see Kalamboukis, T.Z. Manzini, G., Radix sort on the hypercube
(4) 149-151
and factoring polynomi-
als over finite fields L. and E. Tulp, The Space Reduction Method: A method to reduce the size of search spaces Snyder, T.L., Lower bounds for rectilinear Steiner trees ( Corrigendum ) Stojmenovi&, I., Bisections and ham-sandwich cuts of convex polygons and polyhedra
(1)
39-
42
S&l&y,
(4) 187-191 (5) 279 (1)
1s
21
Tate, S.R., see Kao, M.-Y. Tulp, E., see SikGssy, L.
(3) 113-116 (4) 187-191
Wang, Z., see Rote, G. Williams, M.A., see FemBndez-Baca, D. Woeginger, G., On minimizing the sum of k
(4) 149-151 (3) 117-121
tardinesses
(5) 253-256 (4) 149-151
Pramanik, P., P.K. Das, A.K. Bandyopadhyay and D.Q.M. Fay, A deadlock-free communi-
cation kernel for loop architecture Pramanik, S., see Fotouhi, F. Pranranik, S., see Kim, M.H. Preparata, F.P.. Inverting a Vandermonde
Yen, H.-C.. A polynomial
(3) 157-161 (5) 271-275
time algorithm to decide pairwise concurrency of transitions for l-bounded conflict-free Petri nets
matrix
in minimum parallel time
(6) 291-294
Zhu, B., see Rote, G. Zivkovic,
71-
76
(4) 149-151
D., A fast algorithm
for finding the (6) 339-342
compact sets Ra.iarWayanan, S. and S.S. Iysngar, A new optimal distributed algorithm for the set intersection problem
344
(2)
(5) 243-252
Zuckerman, D., On the time to traverse all edges
of a graph (3) 143-148
%mi&. J.D.. see Acketa
(6) 335-337 D.M.
(?f 163-169
343-344
(The issue number is given in front of the page numbers.) Acketa, D.M. and J.D. %uni& On the number of
linear partitions of the
(m,
Floren, R., A note on “A faster approximation (3) 163-169 (1) 49- 55
n&rid
Akl, S.G., see Chen, Cf.-Y. Alvarez,
C. and J. Gabarr6. The parallel complexity of two problems on concurrency
Bandyopadhyay, A.K., see Pramanik, P. Basart, J.M.. Some upper bounds for minimal
(2)
61-
70
(3) 157-161 (4) 209-213
trees Bradford, J.H. and T.A. Jenkyns,
quacy of tournament SCS problem Cai,
J.-y. and LA.
On the inadealgorithms for the 1v-
Hemachandra,
(4) 177-178
forming
(5) 271-275
relational
join is NP-hard
Gabarr6, J., see Alvarez, C. Gasarch, W.I., On selecting the k largest with
(2) 61- 70
restricted quadratic queries A.V., Processor-efficient implementation of a maximum flow algorithm GoraEik, P., A. GoraEkovir and V. Koubek, Alternation with a pebble
(4) 193-195
Goldberg, (4) ‘169-171
GoralGkov&
A note on
A., see Coral&,
P.
(4) 179-185 (1) (1)
7- 13 7- 13
(4) 215-219
enumerative counting Chen, C.C.-Y., S.K. Das and S.G. Akl. A unified
approach to paraiiei depth-first general trees
algorithm for the Steiner problem in graphs” F. and S. Pramanik, Problem of optimizing the number of block accesses in per-
Fotouhi,
Hambrusch,
traversals of
Chen, W.-T., see Homg, S.-J.
Cheng, X., A graph transformation algorithm for concurrency control in a partitioned database Choe, K.-M., see Lee, M.-J. Chow, Y.-C., see Luo, K. Chrobak, M. and L.L. Larmore, A note on the server prubiem and a benevolent adversary
Croehemore, M. and W. Rytter, Efficient parallel algorithms to test square-freeness and factorize strings
(1) 49(1) 29-
55 37
(1)
48
43-
(5) 281 (6) 307-313 (4) 173-175
Das, SK., see Chen, C.C.-Y. Dielissen, V.J. alld A. Kaldewaij,
Rectangular partition is polynomial in two dimensions but NP-complete in three Du, W., see Elmagarmid, A.K. Elm%garmid, A.#. and W. Du. Integrity aspects of quasi serializability Fang
(2) 57- 60
.A. Williams, matroids and hierarchical graphs
(6) 283-289 (3) 157-161 (1) 49- 55
(1)
l-
(1)
23-
6 28
Irani, S., Two results on the list update problem S.
(6) 301-306 (3) 143-148
Jenkyns, T.A., see Bradford, J.H.
(4) 169-171
Kalamboukis, T.Z. and S.L. Mantzaris. Towards optimal distributed election on chordal rings ielissen, V.J. Tate, Online matching with
(5) 265-270 (1) l6 (3; 113-116
cardinality
stacks
and
an
(1) 23- 28
(3) 117-121
(5) 231-235
(1) 29- 37
local memory
blocked input Kennedy, R., Parallel
On
(5) 257-263 (4) 215-219 (6) 329-334
Problem Hershberger, J., A new data structure for shortest path queries in a simple polygon Homg, S.-J., W.-T. Chen and M.-Y. Fang, Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with
Iyengar, S.S., see Rajanarayanan,
(1) 29- 37 (3) 157-161
Fay,
Hemachandra, L.A., see Cai, J.-y. Herley, K.T., A note on the Token Distribution
restricted
Danzig,
P.B., A cooperative game with applications to computer networks Das, P.K., see Pramanik, P.
S. and M. Luby. Parallel asynchronous connected components in a mesh
(6) 295-299 manik. The FX distribu. allel processing of parltal (5) 243- 252 (6) 307-313 (1) 7- 13
Elsevier Science Publishers B.V. (North-Holland) 343
L., Circuits for computing the GCD of two polynomials over an algebraic number fie!?
Larmore, L.L., see Chrobak, M. Latifi, S., Distributed subcube identification
al-
Luby, M., see Hambrusch, S. Luo, K., W. Klostermeyer, Y.-C. Chow and R. Newman-Wolfe, Optimal deadlock resolu-
tions in edge-disjoint graphs
reducible
(3) 129-134 (4) 173-175
gorithms for reliable hypercubes Lee, M.-J. and K-M. Choe, SLR(k) covering for LR( k ) grammars (Corrigenda ) Leiss, E.L. and H.N. Reddy, Embedding complete binary trees into hypercubes Lingas, A., Bit complexity of matrix products
(4) 197-199
Reddy, H.N., see Leiss, Rote, G., G. Woeginge
Langemyr,
(6) 315-321
(5) 281 (4) 197-199 (5) 237-242
ang,
Counting k-subsets and convex k-gons in the plbne Rote, G., Computing the minimum Hausdorff distance between two point sets on a line under translation Rytter, W. and A. Saoudi, On the complexity of the recognition of parallel ZD-image languages Rytter, W., see Crochemore,
M.
(6) 307-313
Sakkinen, M., Selftype is a special case Saoudi, A., see Rytter, W. Shonkwilor, R., Computing the Hausdorff set distance in linear time for any L, point dis-
(5) 265-270
Shoup, V., Smoothness
(2) 77- 81 Martel, C.. Self-adjusting multi-way search trees (3) 135-141 Mato&&, J., Computing dominances in E” (5) 277-278 ( Short communicufivn ) MeidGnis, J.. Lower bounds for arithmetic prob(2) 83.- 87 lems Messeguer, X., Dynamic behaviour in updating process over BST of size two with probabilis(2) 89-100 tic deletion algorithms (2) 107-l 11 Minsker, S., The Towers of Antwerpen problem (2) 101-105 Misra, J., Phase synchronization Mhuk, M., A div(n) depth Boolean circuit for (3) 153-156 smooth modular inverse
Nawrocki, J.R., Conflict detection and resolution
(6) 323-328
in a lexical analyzer generator
(5) 225-229 (2) 57- 60
(6) 307-313
(4) 221-224 (5) 225-229
(4) 201-207
tance
Newman-Wolfe, R., see Luo, K.
(3) 123-127
(5) 257-263
wait-for
Mantzaris, S.L., see Kalamboukis, T.Z. Manzini, G., Radix sort on the hypercube
(4) 149-151
and factoring polynomi-
als over finite fields L. and E. Tulp, The Space Reduction Method: A method to reduce the size of search spaces Snyder, T.L., Lower bounds for rectilinear Steiner trees ( Corrigendum ) Stojmenovi&, I., Bisections and ham-sandwich cuts of convex polygons and polyhedra
(1)
39-
42
S&l&y,
(4) 187-191 (5) 279 (1)
1s
21
Tate, S.R., see Kao, M.-Y. Tulp, E., see SikGssy, L.
(3) 113-116 (4) 187-191
Wang, Z., see Rote, G. Williams, M.A., see FemBndez-Baca, D. Woeginger, G., On minimizing the sum of k
(4) 149-151 (3) 117-121
tardinesses
(5) 253-256 (4) 149-151
Pramanik, P., P.K. Das, A.K. Bandyopadhyay and D.Q.M. Fay, A deadlock-free communi-
cation kernel for loop architecture Pramanik, S., see Fotouhi, F. Pranranik, S., see Kim, M.H. Preparata, F.P.. Inverting a Vandermonde
Yen, H.-C.. A polynomial
(3) 157-161 (5) 271-275
time algorithm to decide pairwise concurrency of transitions for l-bounded conflict-free Petri nets
matrix
in minimum parallel time
(6) 291-294
Zhu, B., see Rote, G. Zivkovic,
71-
76
(4) 149-151
D., A fast algorithm
for finding the (6) 339-342
compact sets Ra.iarWayanan, S. and S.S. Iysngar, A new optimal distributed algorithm for the set intersection problem
344
(2)
(5) 243-252
Zuckerman, D., On the time to traverse all edges
of a graph (3) 143-148
%mi&. J.D.. see Acketa
(6) 335-337 D.M.
(?f 163-169