- Email: [email protected]
Author Index Volume 50 (1994)
ELSEVIER
Information
Processing
Letters
50 (1994) 343-345
Information Processing Letters
Author Index Volume 50 (1994) (The issue number
Alagar, S. and S. Venkatesan, An optimal algorithm for distributed snapshots with causal message ordering Athithan, G., see Sony Roy, T. Atkinson, M.D. and J.-R. Sack Uniform generation of forests of restricted height Azar, Y., A.Z. Broder and A.M. Frieze, On the problem of approximating the number of bases of a matroid Babu, G.P., see Kumar, G.P. Baldoni, R. and B. Ciciani, Distributed algorithms for multiple entries to a critical section with priority Barsi, F. and M.C. Pinotti, A fully parallel algorithm for residue to binary conversion Bartal, Y., H. Karloff and Y. Rabani, A better lower bound for on-line scheduling Berkovich, S.Y., Multiprocessor interconnection network using pairwise balanced combinatorial designs Bertoni, A., C. Mereghetti and G. Pighizzini, An optimal lower bound for nonregular languages Broder, A.Z., see Azar, Y. Chang, H.-K. and S.-M. Yuan, Message complexity of hierarchical quorum consensus algorithm Chen, Y.L., Finding the k quickest simple paths in a network Ciciani, B., see Baldoni, R. Collette, P., An explanatory presentation of composition rules for assumption-commitment specifications Dare, V.R., see Siromoney, R. Demange, M., P. Grisoni and V.Th. Paschos, Approximation results for the minimum graph coloring problem
Elsevier
Science
Publishers
B.V.
is given in front of the page numbers.)
(6) 311-316 (2) 75- 79 (6) 323-327
(1)
9-
11
(3) 145-149
Deo, N., A. Jain and M. Medidi, An optimal parallel algorithm for merging using multiselection Dhamdhere, D.M. and S.S. Kulkarni, A token based k-resilient mutual exclusion algorithm for distributed systems Di Crescenzo, G. and G. Persiano, Round-optimal perfect zero-knowledge proofs Dietz, P.F., 1.1. Macarie and J.I. Seiferas, Bits and relative order from residues, space efficiently Ding, Y. and M.A. Weiss, On the complexity of building an interval heap
(2)
Sl-
87
(3) 151-157 (2)
93-
99
(3) 123-127 (3) 143-144
(3) 165-172 El Abbadi, A., see Resende, R.F. (1)
l-
(3) 113-116
(4) 217-222
(6) 2899292 (1) 9- 11
(2)
69-
73
(2) 89- 92 (3) 165-172
(1)
31-
(4) 177-183
8
35
Ferragina, P., Static and dynamic parallel computation of connected components Fortes Gblvez, J., A note on a proposed LALR parser for extended context-free grammars Fraenkel, A.S., E.M. Reingold and P. Saxena, Efficient management of dynamic tables Frieze, A.M., see Azar, Y. Fuchs, W.K., see Wang, Y.-M. Ganagi, M.S., see Sony Roy, T. Gergov, J. and C. Meinel, On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs Grisoni, P., see Demange, M. Gurla, H., Leftmost one computation on meshes with row broadcasting (Corrigendum) Istrail, S. and D. Zivkovic, Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC”
(2)
63-
68
(6) 303-305 (1) 25- 30 (1) 9- 11 (4) 223-230 (2)
75-
79
(6) 317-322 (1) 19- 23 (2)
111
(4) 211-216
(2) 101-104
(1)
19-
23
Jain, A., see Deo, N. Jimbo, S. and A. Maruoka, On the relationship between the diameter and the size of a boundary of a directed graph
(2)
Sl-
87
(5) 277-282
344
Author Index /Information Processing Letters 50 (1994) 343-345
Karloff, H., see Bartal, Y. Khuller, S., B. Raghavachari and N. Young, Designing multi-commodity flow trees Kim, D. and S.-H. Kim, Otlog n) numerical algorithms on a mesh with wormhole routing Kim, S.-H., see Kim, D. Kim, Y.-S., An optimal scheduling algorithm for preemptable real-time tasks Kulkami, S.S., see Dhamdhere, D.M. Kumar, G.P. and G.P. Babu, Optimal network partitioning for fault-tolerant network management using evolutionary programming Li, H., Trajectory planning in H-space Lin, C.-C. and F.-C. Lin, Minimal fully adaptive wormhole routing on hypercubes Lin, F.-C., see Lin, C.-C. Lin, Y.-B., Determining the global progress of parallel simulation with FIFO communication property Lowry, A., see Wang, Y.-M. Luken, W., see Narayanaswami, C. Macarie, I.I., see Die@ P.F. Maire, F., Polyominos and perfect graphs Mqjumdar, A., see Simha, R. Manber, U. and S. Wu, An algorithm for approximate membership checking with application to password security Manzini, G., Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results Maruoka, A., see Jimbo, S. Mathew, L., see Siromoney, R. Medidi, M., see Deo, N. Meinel, C., see Gergov, J. Mereghetti, C., see Bertoni, A. Mizuno, M., see Neilsen, M.L. Moore, D. and W.F. Smyth, An optimal algorithm to compute all the covers of a string Moriya, E., On two-way tree automata Nair, K.P.K., see Punnen, A.P. Narayanaswami, C. and W. Luken, Approximating x” efficiently Naumann, D.A., A recursion theorem for predicate transformers on inductive data types Neilsen, M.L. and M. Mizuno, Nondominated k-coteries for multiple mutual exclusion Nykanen, M. and E. Ukkonen, Finding lowest common ancestors in arbitrarily directed trees Ozsoyoglu,
Z.M., see Zhang,
X.
Pagli, L. and G. Pucci, Counting the number fault patterns in redundant VLSI arrays
(3) 113-116 (1)
49-
55
(3) 129-136 (3) 129-136 (11 43- 48 (3) 151-157
(3) 145-149 (51253-258 (6) 297-301 (6) 297-301
(1) 13- 17 (4) 223-230 (4) 205-210 (3) 123-127 (2) 57- 61 (2) 105-110
(4) 191-197
(5) 231-238 (51277-282 (2) 101-104 (2) 81- 87 (6) 317-322 (6) 289-292 (5) 247-252 (5) 239-246 (3) 117-121 (5) 283-286
Paschos, V.Th., see Demange, M. Perleberg, C.H., Single character searching methods and the shift-or pattern-matching algorithm Persiano, G., see Di Crescenzo, G. Pighizzini, G., see Bertoni, A. Pinotti, M.C., see Barsi, F. Pirillo, G., Infinite words and biprefix codes Pucci, G., see Pagli, L. Punnen, A.P. and K.P.K. Nair, A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem Rabani, Y., see Bartal, Y. Radhakrishnan, J. and K.V. Subrahmanyam, Directed monotone contact networks for threshold functions Raghavachari, B., see Khuller, S. Ravi, R., A primal-dual approximation algorithm for the Steiner forest problem Reingold, E.M., see Fraenkel, A.S. Resende, R.F. and A. El Abbadi, On the serializability theorem for nested transactions
(1)
(5) (2) (6) (11 (6) (6)
19-
23
269-275 93- 99 289-292 l8 293-295 337-342
(5) 283-286 (3) 113-116
(4) 199-203 (1) 49- 55 (4) 185-190 (1) 25- 30 (4) 177-183
Sack, J.-R., see Atkinson, M.D. Saxena, P., see Fraenkel, A.S. Seberry, J., X.-M. Zhang and Y. Zheug, Improving the strict avalanche characteristics of cryptographic functions Seiferas, J.I., see Dietz, P.F. Simha, R. and A. Majumdar, On lookahead in the list update problem Siromoney, R., L. Mathew, V.R. Dare and K.G. Subramanian, Infinite Lyndon words Sivasankara Reddy, A., see Sony Roy, T. Smyth, W.F., see Moore, D. Sony Roy, T., G. Athithan, M.S. Ganagi and A. Sivasankara Reddy, A new method to solve non-linear equations Subrahmanyam, K.V., see Radhakrishnan, J. Subramanian, K.G., see Siromoney, R. Sugihara, K., Simpler proof of a realizability theorem on Delaunay triangulations Swayze, L.C., see Weems, B.P.
(6) 323-327 (1) 25- 30
(4) 173-176 (3) 137-142
Ukkonen,
(1) 37- 41 (3) 123-127 (2) 105-110 (2) 101-104 (2) 75- 79 (5) 239-246
(2) 75- 79 (4) 199-203 (2) 101-104
(4) 205-210 E., see Nykiinen,
M.
(6) 307-310
S., see Alagar,
S.
(6) 311-316
(6) 329-336 Venkatesan, (51247-252
(6) 307-310 (5) 259-267
of (61337-342
Wang, Y.-M., A. Lowry and W.K. Fuchs, Consistent global checkpoints based on direct dependency tracking Weems, B.P. and L.C. Swayze, Allocation techniques for distributed reduction data elements Weiss, M.A., see Ding, Y. Wu, S., see Manber, U.
(4) 223-230
(3) 137-142 (3) 143-144 (4) 191-197
Author
Index /Information
Young, N., see Khuller, S. Yuan, L.Y., Logic program semantics and cumscription of autoepistemic theories Yuan, S.-M., see Chang, H.-K.
(1)
49-
Processing Letters 50 (1994) 343-345 55
cir(3) 159-164 (2) 69- 73
Zhang, X. and Z.M. Ozsoyoglu, Some results on the containment and minimization of (injequality queries Zhang, X.-M., see Seberry, J. Zheng, Y., see Seberry, J. Zivkovic, D., see Istrail, S.
345
(5) 259-267 (1) 37- 41 (1) 37- 41 (4) 211-216
Information
Processing
Letters
50 (1994) 343-345
Information Processing Letters
Author Index Volume 50 (1994) (The issue number
Alagar, S. and S. Venkatesan, An optimal algorithm for distributed snapshots with causal message ordering Athithan, G., see Sony Roy, T. Atkinson, M.D. and J.-R. Sack Uniform generation of forests of restricted height Azar, Y., A.Z. Broder and A.M. Frieze, On the problem of approximating the number of bases of a matroid Babu, G.P., see Kumar, G.P. Baldoni, R. and B. Ciciani, Distributed algorithms for multiple entries to a critical section with priority Barsi, F. and M.C. Pinotti, A fully parallel algorithm for residue to binary conversion Bartal, Y., H. Karloff and Y. Rabani, A better lower bound for on-line scheduling Berkovich, S.Y., Multiprocessor interconnection network using pairwise balanced combinatorial designs Bertoni, A., C. Mereghetti and G. Pighizzini, An optimal lower bound for nonregular languages Broder, A.Z., see Azar, Y. Chang, H.-K. and S.-M. Yuan, Message complexity of hierarchical quorum consensus algorithm Chen, Y.L., Finding the k quickest simple paths in a network Ciciani, B., see Baldoni, R. Collette, P., An explanatory presentation of composition rules for assumption-commitment specifications Dare, V.R., see Siromoney, R. Demange, M., P. Grisoni and V.Th. Paschos, Approximation results for the minimum graph coloring problem
Elsevier
Science
Publishers
B.V.
is given in front of the page numbers.)
(6) 311-316 (2) 75- 79 (6) 323-327
(1)
9-
11
(3) 145-149
Deo, N., A. Jain and M. Medidi, An optimal parallel algorithm for merging using multiselection Dhamdhere, D.M. and S.S. Kulkarni, A token based k-resilient mutual exclusion algorithm for distributed systems Di Crescenzo, G. and G. Persiano, Round-optimal perfect zero-knowledge proofs Dietz, P.F., 1.1. Macarie and J.I. Seiferas, Bits and relative order from residues, space efficiently Ding, Y. and M.A. Weiss, On the complexity of building an interval heap
(2)
Sl-
87
(3) 151-157 (2)
93-
99
(3) 123-127 (3) 143-144
(3) 165-172 El Abbadi, A., see Resende, R.F. (1)
l-
(3) 113-116
(4) 217-222
(6) 2899292 (1) 9- 11
(2)
69-
73
(2) 89- 92 (3) 165-172
(1)
31-
(4) 177-183
8
35
Ferragina, P., Static and dynamic parallel computation of connected components Fortes Gblvez, J., A note on a proposed LALR parser for extended context-free grammars Fraenkel, A.S., E.M. Reingold and P. Saxena, Efficient management of dynamic tables Frieze, A.M., see Azar, Y. Fuchs, W.K., see Wang, Y.-M. Ganagi, M.S., see Sony Roy, T. Gergov, J. and C. Meinel, On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs Grisoni, P., see Demange, M. Gurla, H., Leftmost one computation on meshes with row broadcasting (Corrigendum) Istrail, S. and D. Zivkovic, Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC”
(2)
63-
68
(6) 303-305 (1) 25- 30 (1) 9- 11 (4) 223-230 (2)
75-
79
(6) 317-322 (1) 19- 23 (2)
111
(4) 211-216
(2) 101-104
(1)
19-
23
Jain, A., see Deo, N. Jimbo, S. and A. Maruoka, On the relationship between the diameter and the size of a boundary of a directed graph
(2)
Sl-
87
(5) 277-282
344
Author Index /Information Processing Letters 50 (1994) 343-345
Karloff, H., see Bartal, Y. Khuller, S., B. Raghavachari and N. Young, Designing multi-commodity flow trees Kim, D. and S.-H. Kim, Otlog n) numerical algorithms on a mesh with wormhole routing Kim, S.-H., see Kim, D. Kim, Y.-S., An optimal scheduling algorithm for preemptable real-time tasks Kulkami, S.S., see Dhamdhere, D.M. Kumar, G.P. and G.P. Babu, Optimal network partitioning for fault-tolerant network management using evolutionary programming Li, H., Trajectory planning in H-space Lin, C.-C. and F.-C. Lin, Minimal fully adaptive wormhole routing on hypercubes Lin, F.-C., see Lin, C.-C. Lin, Y.-B., Determining the global progress of parallel simulation with FIFO communication property Lowry, A., see Wang, Y.-M. Luken, W., see Narayanaswami, C. Macarie, I.I., see Die@ P.F. Maire, F., Polyominos and perfect graphs Mqjumdar, A., see Simha, R. Manber, U. and S. Wu, An algorithm for approximate membership checking with application to password security Manzini, G., Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results Maruoka, A., see Jimbo, S. Mathew, L., see Siromoney, R. Medidi, M., see Deo, N. Meinel, C., see Gergov, J. Mereghetti, C., see Bertoni, A. Mizuno, M., see Neilsen, M.L. Moore, D. and W.F. Smyth, An optimal algorithm to compute all the covers of a string Moriya, E., On two-way tree automata Nair, K.P.K., see Punnen, A.P. Narayanaswami, C. and W. Luken, Approximating x” efficiently Naumann, D.A., A recursion theorem for predicate transformers on inductive data types Neilsen, M.L. and M. Mizuno, Nondominated k-coteries for multiple mutual exclusion Nykanen, M. and E. Ukkonen, Finding lowest common ancestors in arbitrarily directed trees Ozsoyoglu,
Z.M., see Zhang,
X.
Pagli, L. and G. Pucci, Counting the number fault patterns in redundant VLSI arrays
(3) 113-116 (1)
49-
55
(3) 129-136 (3) 129-136 (11 43- 48 (3) 151-157
(3) 145-149 (51253-258 (6) 297-301 (6) 297-301
(1) 13- 17 (4) 223-230 (4) 205-210 (3) 123-127 (2) 57- 61 (2) 105-110
(4) 191-197
(5) 231-238 (51277-282 (2) 101-104 (2) 81- 87 (6) 317-322 (6) 289-292 (5) 247-252 (5) 239-246 (3) 117-121 (5) 283-286
Paschos, V.Th., see Demange, M. Perleberg, C.H., Single character searching methods and the shift-or pattern-matching algorithm Persiano, G., see Di Crescenzo, G. Pighizzini, G., see Bertoni, A. Pinotti, M.C., see Barsi, F. Pirillo, G., Infinite words and biprefix codes Pucci, G., see Pagli, L. Punnen, A.P. and K.P.K. Nair, A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem Rabani, Y., see Bartal, Y. Radhakrishnan, J. and K.V. Subrahmanyam, Directed monotone contact networks for threshold functions Raghavachari, B., see Khuller, S. Ravi, R., A primal-dual approximation algorithm for the Steiner forest problem Reingold, E.M., see Fraenkel, A.S. Resende, R.F. and A. El Abbadi, On the serializability theorem for nested transactions
(1)
(5) (2) (6) (11 (6) (6)
19-
23
269-275 93- 99 289-292 l8 293-295 337-342
(5) 283-286 (3) 113-116
(4) 199-203 (1) 49- 55 (4) 185-190 (1) 25- 30 (4) 177-183
Sack, J.-R., see Atkinson, M.D. Saxena, P., see Fraenkel, A.S. Seberry, J., X.-M. Zhang and Y. Zheug, Improving the strict avalanche characteristics of cryptographic functions Seiferas, J.I., see Dietz, P.F. Simha, R. and A. Majumdar, On lookahead in the list update problem Siromoney, R., L. Mathew, V.R. Dare and K.G. Subramanian, Infinite Lyndon words Sivasankara Reddy, A., see Sony Roy, T. Smyth, W.F., see Moore, D. Sony Roy, T., G. Athithan, M.S. Ganagi and A. Sivasankara Reddy, A new method to solve non-linear equations Subrahmanyam, K.V., see Radhakrishnan, J. Subramanian, K.G., see Siromoney, R. Sugihara, K., Simpler proof of a realizability theorem on Delaunay triangulations Swayze, L.C., see Weems, B.P.
(6) 323-327 (1) 25- 30
(4) 173-176 (3) 137-142
Ukkonen,
(1) 37- 41 (3) 123-127 (2) 105-110 (2) 101-104 (2) 75- 79 (5) 239-246
(2) 75- 79 (4) 199-203 (2) 101-104
(4) 205-210 E., see Nykiinen,
M.
(6) 307-310
S., see Alagar,
S.
(6) 311-316
(6) 329-336 Venkatesan, (51247-252
(6) 307-310 (5) 259-267
of (61337-342
Wang, Y.-M., A. Lowry and W.K. Fuchs, Consistent global checkpoints based on direct dependency tracking Weems, B.P. and L.C. Swayze, Allocation techniques for distributed reduction data elements Weiss, M.A., see Ding, Y. Wu, S., see Manber, U.
(4) 223-230
(3) 137-142 (3) 143-144 (4) 191-197
Author
Index /Information
Young, N., see Khuller, S. Yuan, L.Y., Logic program semantics and cumscription of autoepistemic theories Yuan, S.-M., see Chang, H.-K.
(1)
49-
Processing Letters 50 (1994) 343-345 55
cir(3) 159-164 (2) 69- 73
Zhang, X. and Z.M. Ozsoyoglu, Some results on the containment and minimization of (injequality queries Zhang, X.-M., see Seberry, J. Zheng, Y., see Seberry, J. Zivkovic, D., see Istrail, S.
345
(5) 259-267 (1) 37- 41 (1) 37- 41 (4) 211-216