Journal: J. Comput. Syst. Sci.

Volume 81, Issue 4

615 -- 631Qi Shi, Ning Zhang, Madjid Merabti. Fair signature exchange via delegation on ubiquitous networks
632 -- 660Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend. Control complexity in Bucklin and fallback voting: A theoretical analysis
661 -- 670Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend. Control complexity in Bucklin and fallback voting: An experimental analysis
671 -- 691Eric J. Schwabe, Ian M. Sutherland. Optimizing large data transfers in parity-declustered data layouts
692 -- 701Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil. Practically stabilizing SWMR atomic memory in message-passing systems
702 -- 716Mark Jerrum, Kitty Meeks. The parameterised complexity of counting connected subgraphs and graph motifs
717 -- 733Xun Zhou, Jing He, Guangyan Huang, Yanchun Zhang. SVD-based incremental approaches for recommender systems
734 -- 746Lijuan Wang, Jun Shen, Junzhou Luo. Facilitating an ant colony algorithm for multi-objective data-intensive service provision
747 -- 765Henning Fernau, Pinar Heggernes, Yngve Villanger. A multi-parameter analysis of hard problems on deterministic finite automata
766 -- 782Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý. On explaining integer vectors by few homogeneous segments
783 -- 796Jianghua Zhong, Dongdai Lin. A new linearization method for nonlinear feedback shift registers