Information Processing Letters, Volume 65

Volume 65, Number 1, 15 January 1998

• Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao:
  A Simplified NP-Complete MAXSAT Problem. 1-6
  Electronic Edition (link) BibTeX
• Peter Y. A. Ryan, Steve A. Schneider:
  An Attack on a Recursive Authentication Protocol. A Cautionary Tale. 7-10
  Electronic Edition (link) BibTeX
• Jamel Lakhal, Luc Litzler:
  A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs. 11-16
  Electronic Edition (link) BibTeX
• Paul E. Dunne, Michele Zito:
  An Inproved Upper Bound on the Non-3-Colourability Threshold. 17-23
  Electronic Edition (link) BibTeX
• Carlo Blundo, Alfredo De Santis, Ugo Vaccaro:
  On Secret Sharing Schemes. 25-32
  Electronic Edition (link) BibTeX
• Amos Israeli, Asaf Shirazi:
  The Time Complexity of Updating Snapshot Memories. 33-40
  Electronic Edition (link) BibTeX
• Hosam M. Mahmoud:
  On Rotations in Fringe-Balanced Binary Trees. 41-46
  Electronic Edition (link) BibTeX
• Refik Molva, Gene Tsudik:
  Secret Sets and Applications. 47-55
  Electronic Edition (link) BibTeX

Volume 65, Number 2, 29 January 1998

• Teodor Knapik, Étienne Payet:
  The Full Quotient and its Closure Property for Regular Languages. 57-62
  Electronic Edition (link) BibTeX
• Ahmed Ait-Bouziad, Helen Kassel:
  An Inproved Algorithm for Retrieving Fuzzy Information from Two Systems. 63-66
  Electronic Edition (link) BibTeX
• Michiel A. Odijk, Hans van Maaren:
  Improved Solutions to the Steiner Triple Covering Problem. 67-69
  Electronic Edition (link) BibTeX
• Gwoboa Horng:
  An Active Attack on Protocols for Server-Aided RSA Signature Computation. 71-73
  Electronic Edition (link) BibTeX
• T. C. Edwin Cheng, Qing Ding:
  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times. 75-79
  Electronic Edition (link) BibTeX
• Jou-Ming Chang, Chin-Wen Ho:
  The Recognition of Geodetically Connected Graphs. 81-88
  Electronic Edition (link) BibTeX
• Peter J. Grabner, Helmut Prodinger:
  An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication. 89-93
  Electronic Edition (link) BibTeX
• Michael Segal, Klara Kedem:
  Enclosing k Points in the Smallest Axis Parallel Rectangle. 95-99
  Electronic Edition (link) BibTeX
• Dimitrios Dervos, Yannis Manolopoulos, P. Linardis:
  Comparison of Signature File Models with Superimposed Coding. 101-106
  Electronic Edition (link) BibTeX
• Anders Dessmark, Oscar Garrido, Andrzej Lingas:
  A Note on Parallel Complexity of Maximum f-Matching. 107-109
  Electronic Edition (link) BibTeX
• Therese C. Biedl:
  Relating Bends and Size in Orthogonal Graph Drawings. 111-115
  Electronic Edition (link) BibTeX

Volume 65, Number 3, 13 February 1998

• Sunil Arya, H. Ramesh:
  A 2.5-Factor Approximation Algorithm for the k-MST Problem. 117-118
  Electronic Edition (link) BibTeX
• Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee:
  The NPO-Completeness of the Longest Hamiltonian Cycle Problem. 119-123
  Electronic Edition (link) BibTeX
• Pallab Dasgupta:
  Agreement under Faulty Interfaces. 125-129
  Electronic Edition (link) BibTeX
• Shiva Chaudhuri, Naveen Garg, R. Ravi:
  The p-Neighbor k-Center Problem. 131-134
  Electronic Edition (link) BibTeX
• Limin Xiang, Kazuo Ushijima:
  ANSV Problem on BSRs. 135-138
  Electronic Edition (link) BibTeX
• Jung Je Son, Jong In Lim, Seongtaek Chee, Soo Hak Sung:
  Global Avalanche Characteristics and Nonlinearity of Balanced Boolean Functions. 139-144
  Electronic Edition (link) BibTeX
• Viggo Kann, Jens Lagergren, Alessandro Panconesi:
  Approximate Max k-Cut with Subgraph Guarantee. 145-150
  Electronic Edition (link) BibTeX
• Edith Hemaspaandra, Jörg Rothe:
  Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. 151-156
  Electronic Edition (link) BibTeX
• Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu:
  Optimal 1-Hamiltonian Graphs. 157-161
  Electronic Edition (link) BibTeX
• R. Balasubramanian, Michael R. Fellows, Venkatesh Raman:
  An Improved Fixed-Parameter Algorithm for Vertex Cover. 163-168
  Electronic Edition (link) BibTeX

Volume 65, Number 4, 27 February 1998

• Kim S. Larsen:
  Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. 169-172
  Electronic Edition (link) BibTeX
• Jerzy R. Nawrocki, Adam Czajka, Wojciech Complak:
  Scheduling Cyclic Tasks with Binary Periods. 173-178
  Electronic Edition (link) BibTeX
• Sundarajan Vedantham, S. Sitharama Iyengar:
  The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete. 179-182
  Electronic Edition (link) BibTeX
• Stavros D. Nikolopoulos, Panos Rondogiannis:
  On the Number of Spanning Trees of Multi-Star Related Graphs. 183-188
  Electronic Edition (link) BibTeX
• Tzonelih Hwang, Chih-Hung Wang:
  Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders. 189-193
  Electronic Edition (link) BibTeX
• Luc Devroye:
  On the Richness of the Collection of Subtrees in Random Binary Search Trees. 195-199
  Electronic Edition (link) BibTeX
• Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin:
  A Polynomial Time Solution for Labeling a Rectlinear Map. 201-207
  Electronic Edition (link) BibTeX
• Oded Shmueli, Kurt A. Shoens:
  Data Sufficiency for Queries on Cache. 209-216
  Electronic Edition (link) BibTeX
• Nader H. Bshouty, Christino Tamon, David K. Wilson:
  On Learning width Two Branching Programs. 217-222
  Electronic Edition (link) BibTeX

Volume 65, Number 5, 13 March 1998

• Yair Amir, Avishai Wool:
  Optimal Availability Quorum Systems: Theory and Practice. 223-228
  Electronic Edition (link) BibTeX
• Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza:
  A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. 229-233
  Electronic Edition (link) BibTeX
• James F. Korsh, Seymour Lipschutz:
  Shifts and Loopless Generation of k-Ary Trees. 235-240
  Electronic Edition (link) BibTeX
• Jeremy Frank, Ian P. Gent, Toby Walsh:
  Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study. 241-245
  Electronic Edition (link) BibTeX
• Heung-Taek Kim, Myoung-Ho Kim:
  Starvation-Free Secure Multiversion Concurrency Control. 247-253
  Electronic Edition (link) BibTeX
• D. J. Guan:
  An Optimal Message Routing Algorithm for Double-Loop Networks. 255-260
  Electronic Edition (link) BibTeX
• Wen-Huei Chen:
  Test Sequence Generation from the Protocol Data Portion Based on the Selecting Chinese Postman Algorithm. 261-268
  Electronic Edition (link) BibTeX
• Danny Z. Chen, Ovidiu Daescu:
  Maintaining Visibility of a Polygon with a Moving Point of View. 269-275
  Electronic Edition (link) BibTeX
• Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
  Pattern Matching for Permutations. 277-283
  Electronic Edition (link) BibTeX

Volume 65, Number 6, 27 March 1998

• William McCune:
  Automatic Proofs and Counterexamples for Some Ortholattice Identities. 285-291
  Electronic Edition (link) BibTeX
• Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri:
  The Medians of Discrete Sets. 293-299
  Electronic Edition (link) BibTeX
• Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
  Maximum h-Colourable Subgraph Problem in Balanced Graphs. 301-303
  Electronic Edition (link) BibTeX
• Gunnar Andersson, Lars Engebretsen:
  Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. 305-311
  Electronic Edition (link) BibTeX
• Philippe Herrmann:
  Timed Automata and Recognizability. 313-318
  Electronic Edition (link) BibTeX
• Kaijung Chang, Yan Huat Tan, Yaakov L. Varol, Jiang-Hsing Chu:
  A Study on Interleaving Versus Segmentation. 319-324
  Electronic Edition (link) BibTeX
• Shing-Tsaan Huang, Tzong-Jye Liu:
  Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd Size. 325-329
  Electronic Edition (link) BibTeX
• Yaw-Wen Chang, Chang-Biau Yang:
  A Parallel Algorithm for Circulant Tridiagonal Linear Systems. 331-337
  Electronic Edition (link) BibTeX