- Md. Mozammel Huq Azad Khan, Md. Shamsul Alam:
Algorithms for Conversion of Minterms to Positive Polarity Reed-Muller Coefficients and Vice Versa. Inf. Process. Lett. 62(5): 223-230 (1997) - Ekkart Kindler, Rolf Walter:
Mutex Needs Fairness. Inf. Process. Lett. 62(1): 31-39 (1997) - Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha:
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. Inf. Process. Lett. 62(3): 153-159 (1997) - Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram:
A Note on Optical Routing on Trees. Inf. Process. Lett. 62(6): 295-300 (1997) - Timothy Lambert:
An Optimal Algorithm for Realizing a Delaunay Triangulation. Inf. Process. Lett. 62(5): 245-250 (1997) - Yuan Ma, Serge A. Plotkin:
An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. Inf. Process. Lett. 62(6): 301-303 (1997) - Erkki Mäkinen:
Inferring Uniquely Terminating Regular Languages from Positive Data. Inf. Process. Lett. 62(2): 57-60 (1997) - Wai Yin Mok:
On Keys and Normal Forms. Inf. Process. Lett. 62(5): 255-258 (1997) - Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Inf. Process. Lett. 62(6): 315-322 (1997) - Shin-ichi Nakayama, Shigeru Masuyama:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. Inf. Process. Lett. 62(6): 323-327 (1997) - Ariel Orda, Michael Merritt:
Efficient Test & Set Constructions for Faulty Shared Memory. Inf. Process. Lett. 62(1): 41-46 (1997) - Javier Orozco, Ricardo Cayssials, Jorge Santos, Edgardo Ferro:
802.4 Rate Monotonic Scheduling in Hard Real-Time Environments: Setting the Medium Access Control Parameters. Inf. Process. Lett. 62(1): 47-55 (1997) - Paul Pritchard:
An Old Sub-Quadratic Algorithm for Finding Extremal Sets. Inf. Process. Lett. 62(6): 329-334 (1997) - Masataka Sassa, Takuya Ookubo:
Systematic Debugging Method for Attribute Grammar Description. Inf. Process. Lett. 62(6): 305-313 (1997) - Rimli Sengupta:
Cancellation is Exponentially Powerful for Computing the Determinant. Inf. Process. Lett. 62(4): 177-181 (1997) - Kasturi R. Varadarajan, Pankaj K. Agarwal:
Linear Approximation of Simple Objects. Inf. Process. Lett. 62(2): 89-94 (1997) - V. A. Vassiliev:
On Decision Trees for Orthants. Inf. Process. Lett. 62(5): 265-268 (1997) - Wim F. J. Verhaegh, Emile H. L. Aarts:
A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes. Inf. Process. Lett. 62(4): 217-221 (1997) - Ching-Nung Yang, Chi-Sung Laih:
A Note on Error-Correcting Codes for Authentication and Subliminal Channels. Inf. Process. Lett. 62(3): 141-143 (1997) - Sung-Ming Yen, Kuo-Hong Liao:
Shared Authentication Token Secure Against Replay and Weak Key Attacks. Inf. Process. Lett. 62(2): 77-80 (1997) - Marius Zimand:
Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity. Inf. Process. Lett. 62(3): 165-170 (1997)