Journal: Comput. J.

Volume 61, Issue 5

629 -- 644Shuanglong Kan, Zhiqiu Huang. Partial Order Reduction for the full Class of State/Event Linear Temporal Logic
645 -- 657Lalit Mohan Goyal, M. M. Sufyan Beg, Tanvir Ahmad. An Efficient Framework for Mining Association Rules in the Distributed Databases
658 -- 671Liangze Yin, Wei Dong, Fei He, Ji Wang. A True-Concurrency Encoding for BMC of Compositional Systems
672 -- 686Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Ai-Mei Yu. The 3-extra Connectivity and Faulty Diagnosability
687 -- 713Edans Flavius de Oliveira Sandes, George Luiz Medeiros Teodoro, Maria Emilia M. T. Walter, Xavier Martorell, Eduard Ayguadé, Alba Cristina Magalhaes Alves de Melo. Formalization of Block Pruning: Reducing the Number of Cells Computed in Exact Biological Sequence Comparison Algorithms
714 -- 721Liqiong Xu, Shuming Zhou, Guanqin Lian, Zuwen Luo. A Kind of Conditional Connectivity of Cayley Graphs Generated by 2-trees
722 -- 744Mosong Zhou, Xiaoshe Dong, Heng Chen, Xingjun Zhang. A Runtime Available Resource Capacity Evaluation Model Based on the Concept of Similar Tasks
745 -- 760Yi Qi, Huan Li 0002, Zhongzhi Zhang. Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks
761 -- 772Shiying Wang, Guozhen Zhang, Kai-Feng. Edge Fault Tolerance of Cartesian Product Graphs on Super Restricted Edge Connectivity
773 -- 788Andrea Farruggia, Travis Gagie, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén. Relative Suffix Trees