| 77 | -- | 81 | Chien-Yuan Chen, Chin-Chen Chang. A fast modular multiplication algorithm for calculating the product AB modulo N |
| 83 | -- | 90 | Martín Matamala, Klaus Meer. On the computational structure of the connected components of a hard problem |
| 91 | -- | 97 | Michel Raynal, Frederic Tronel. Restricted failure detectors: Definition and reduction protocols |
| 99 | -- | 103 | Graham M. Megson, Xiaofan Yang, Xiaoping Liu. Honeycomb tori are Hamiltonian |
| 105 | -- | 107 | Samir Khuller. An O(|V|2) algorithm for single connectedness |
| 109 | -- | 111 | Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang. The correct diameter of trivalent Cayley graphs |
| 113 | -- | 118 | Ioan I. Macarie, Joel I. Seiferas. Amplification of slight probabilistic advantage at absolutely no cost in space |
| 119 | -- | 123 | Yann Verhoeven. Random 2-SAT and unsatisfiability |
| 125 | -- | 130 | Christian Lavault, Sidi Mohamed Sedjelmaci. Worst-case analysis of Weber s GCD algorithm |
| 131 | -- | 135 | Shien-Ching Hwang, Gen-Huey Chen. A note on cyclic-cubes |
| 137 | -- | 141 | Tiziana Calamoneri, Annalisa Massini. An optimal layout of multigrid networks |
| 143 | -- | 148 | K. Sridharan. Computing two penetration measures for curved 2D objects |