Information Processing Letters, Volume 71

Volume 71, Number 1, 16 July 1999

• Yuh-Min Tseng, Jinn-ke Jan:
  Attacks on Threshold Signature Schemes with Traceable Signers. 1-4
  Electronic Edition (link) BibTeX
• Andris Ambainis:
  A Note on Quantum Black-Box Complexity of Almost all Boolean Functions. 5-7
  Electronic Edition (link) BibTeX
• Alak Kumar Datta, Ranjan K. Sen:
  An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs. 9-15
  Electronic Edition (link) BibTeX
• Eric Torng, Patchrawat Uthaisombut:
  A Tight Lower Bound for the Best-alpha Algorithm. 17-22
  Electronic Edition (link) BibTeX
• Qing Hu, Yixin Zhang, Xiaojun Shen:
  Rearrangeable Graphs. 23-27
  Electronic Edition (link) BibTeX
• P. C. Chu:
  Verbs are not Cases: Applying Case Grammar to Document Retrieval. 29-34
  Electronic Edition (link) BibTeX
• Tatsuhiro Tsuchiya, Nobuhiko Ido, Tohru Kikuno:
  Constructing Byzantine Quorum Systems from Combinatorial Designs. 35-42
  Electronic Edition (link) BibTeX
• Limin Xiang, Kazuo Ushijima:
  Rearranging Scattered Information on BSR. 43-47
  Electronic Edition (link) BibTeX

Volume 71, Number 2, 30 July 1999

• T. C. Edwin Cheng, Guoqing Wang:
  Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. 49-54
  Electronic Edition (link) BibTeX
• Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert:
  Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. 55-61
  Electronic Edition (link) BibTeX
• Tomoyuki Yamakami, Andrew Chi-Chih Yao:
  NQP_C = co-C₌P. 63-69
  Electronic Edition (link) BibTeX
• Limin Xiang, Kazuo Ushijima:
  A Theorem on the Relation Between BSR_k and BSR⁺. 71-73
  Electronic Edition (link) BibTeX
• Chu Min Li:
  A Constraint-Based Approach to Narrow Search Trees for Satisfiability. 75-80
  Electronic Edition (link) BibTeX
• Stefan Dobrev, Imrich Vrto:
  Optimal Broadcasting in Hypercubes with Dynamic Faults. 81-85
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Jack H. Koolen, Henry Martyn Mulder:
  Graphs which Locally Mirror the Hypercube Structure. 87-90
  Electronic Edition (link) BibTeX
• Yen-Chun Lin, Ching-Sung Yeh:
  Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. 91-95
  Electronic Edition (link) BibTeX

Volume 71, Numbers 3-4, 27 August 1999

• Rainer Kemp:
  A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. 97-105
  Electronic Edition (link) BibTeX
• Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
  Fast Practical Multi-Pattern Matching. 107-113
  Electronic Edition (link) BibTeX
• Mark Levene, George Loizou:
  How to Prevent Interaction of Functional and Inclusion Dependencies. 115-125
  Electronic Edition (link) BibTeX
• Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung:
  Tree Precedence in Scheduling: The Strong-Weak Distinction. 127-134
  Electronic Edition (link) BibTeX
• Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz:
  A Matched Approximation Bound for the Sum of a Greedy Coloring. 135-140
  Electronic Edition (link) BibTeX
• P. C. P. Bhatt:
  An Interesting Way to Partition a Number. 141-148
  Electronic Edition (link) BibTeX
• Subhamoy Maitra, Palash Sarkar:
  Hamming Weights of Correlation Immune Boolean Functions. 149-153
  Electronic Edition (link) BibTeX
• Marcos Kawazoe Aguilera, Sam Toueg:
  A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds. 155-158
  Electronic Edition (link) BibTeX
• David A. Plaisted, Gregory Kucherov:
  The Complexity of Some Complementation Problems. 159-165
  Electronic Edition (link) BibTeX
• Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg:
  The Cost of Graceful Degradation for Omission Failures. 167-172
  Electronic Edition (link) BibTeX

Volume 71, Numbers 5-6, 30 September 1999

• Jürgen Dassow, Gheorghe Paun:
  Min of Mat is not Necessarily Mat. 175-177
  Electronic Edition (link) BibTeX
• Jorge L. Ramírez Alfonsín:
  Cyclic Arrangements and Roudneff's Conjecture in the Space. 179-182
  Electronic Edition (link) BibTeX
• Sarnath Ramnath, Venkatesh Raman:
  Selecting Small Ranks in EREW PRAM. 183-186
  Electronic Edition (link) BibTeX
• Zvi Lotker, Boaz Patt-Shamir:
  A Note on Randomized Mutual Search. 187-191
  Electronic Edition (link) BibTeX
• Arkadiusz Wojna:
  Counter Machines. 193-197
  Electronic Edition (link) BibTeX
• Lhouari Nourine, Olivier Raynaud:
  A Fast Algorithm for Building Lattices. 199-204
  Electronic Edition (link) BibTeX
• Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki:
  A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. 205-212
  Electronic Edition (link) BibTeX
• Jong Soo Kim, Sung Tak Kang, Myoung-Ho Kim:
  On Temporal Aggregate Processing Based on Time Points. 213-220
  Electronic Edition (link) BibTeX
• Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos:
  Structural Tolerance and Delaunay Triangulation. 221-227
  Electronic Edition (link) BibTeX
• Vasco Thudichum Vasconcelos, António Ravara:
  Communication Errors in the pi-Calculus are Undecidable. 229-233
  Electronic Edition (link) BibTeX
• Antonios Symvonis:
  A Note on Deflection Worm Routing on Meshes. 235-239
  Electronic Edition (link) BibTeX