- Tzonelih Hwang, Chih-Hung Wang:
Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders. Inf. Process. Lett. 65(4): 189-193 (1998) - Amos Israeli, Asaf Shirazi:
The Time Complexity of Updating Snapshot Memories. Inf. Process. Lett. 65(1): 33-40 (1998) - Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee. Inf. Process. Lett. 65(3): 145-150 (1998) - Heung-Taek Kim, Myoung-Ho Kim:
Starvation-Free Secure Multiversion Concurrency Control. Inf. Process. Lett. 65(5): 247-253 (1998) - Teodor Knapik, Étienne Payet:
The Full Quotient and its Closure Property for Regular Languages. Inf. Process. Lett. 65(2): 57-62 (1998) - James F. Korsh, Seymour Lipschutz:
Shifts and Loopless Generation of k-Ary Trees. Inf. Process. Lett. 65(5): 235-240 (1998) - Jamel Lakhal, Luc Litzler:
A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs. Inf. Process. Lett. 65(1): 11-16 (1998) - Kim S. Larsen:
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. Inf. Process. Lett. 65(4): 169-172 (1998) - Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri:
The Medians of Discrete Sets. Inf. Process. Lett. 65(6): 293-299 (1998) - Hosam M. Mahmoud:
On Rotations in Fringe-Balanced Binary Trees. Inf. Process. Lett. 65(1): 41-46 (1998) - William McCune:
Automatic Proofs and Counterexamples for Some Ortholattice Identities. Inf. Process. Lett. 65(6): 285-291 (1998) - Refik Molva, Gene Tsudik:
Secret Sets and Applications. Inf. Process. Lett. 65(1): 47-55 (1998) - Jerzy R. Nawrocki, Adam Czajka, Wojciech Complak:
Scheduling Cyclic Tasks with Binary Periods. Inf. Process. Lett. 65(4): 173-178 (1998) - Stavros D. Nikolopoulos, Panos Rondogiannis:
On the Number of Spanning Trees of Multi-Star Related Graphs. Inf. Process. Lett. 65(4): 183-188 (1998) - Michiel A. Odijk, Hans van Maaren:
Improved Solutions to the Steiner Triple Covering Problem. Inf. Process. Lett. 65(2): 67-69 (1998) - Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin:
A Polynomial Time Solution for Labeling a Rectlinear Map. Inf. Process. Lett. 65(4): 201-207 (1998) - Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao:
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998) - Peter Y. A. Ryan, Steve A. Schneider:
An Attack on a Recursive Authentication Protocol. A Cautionary Tale. Inf. Process. Lett. 65(1): 7-10 (1998) - Michael Segal, Klara Kedem:
Enclosing k Points in the Smallest Axis Parallel Rectangle. Inf. Process. Lett. 65(2): 95-99 (1998) - Oded Shmueli, Kurt A. Shoens:
Data Sufficiency for Queries on Cache. Inf. Process. Lett. 65(4): 209-216 (1998) - Jung Je Son, Jong In Lim, Seongtaek Chee, Soo Hak Sung:
Global Avalanche Characteristics and Nonlinearity of Balanced Boolean Functions. Inf. Process. Lett. 65(3): 139-144 (1998) - Sundarajan Vedantham, S. Sitharama Iyengar:
The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete. Inf. Process. Lett. 65(4): 179-182 (1998) - Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu:
Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998) - Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee:
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998) - Limin Xiang, Kazuo Ushijima:
ANSV Problem on BSRs. Inf. Process. Lett. 65(3): 135-138 (1998)