Table Of Content

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