Journal: J. Comput. Syst. Sci.

Volume 74, Issue 5

657 -- 661Tao Xiang, Kwok-Wo Wong, Xiaofeng Liao. Cryptanalysis of a password authentication scheme over insecure networks
662 -- 670Guy Kortsarz, Zeev Nutov. Tight approximation algorithm for connectivity augmentation problems
671 -- 696. On the Approximation of Correlation Clustering and Consensus Clustering
697 -- 720Tova Milo, Assaf Sagi, Elad Verbin. Compact samples for data dissemination
721 -- 743David A. Cohen, Peter Jeavons, Marc Gyssens. A unified theory of structural tractability for constraint satisfaction problems
744 -- 774Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan. Improved bounds on sorting by length-weighted reversals
775 -- 795. Compact roundtrip routing with topology-independent node names
796 -- 807Maxime Crochemore, Lucian Ilie. Maximal repetitions in strings
808 -- 822Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang. Fast periodic graph exploration with constant memory
823 -- 830Rachid Guerraoui, Petr Kuznetsov. The gap in circumventing the impossibility of consensus
831 -- 849François Nicolas, Eric Rivals. Hardness of optimal spaced seed design
850 -- 869Shlomo Moran, Sagi Snir. Convex recolorings of strings and trees: Definitions, hardness results and algorithms
870 -- 874Qiang Li, Huimin Xie. Finite automata for testing composition-based reconstructibility of sequences
875 -- 883Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. Approximation of satisfactory bisection problems
884 -- 897Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan. Simultaneous matchings: Hardness and approximation
898 -- 909Peter Jonsson, Andrei A. Krokhin. Computational complexity of auditing finite attributes in statistical databases
910 -- 918Mark McCann, Nicholas Pippenger. Fault tolerance in cellular automata at high fault rates
919 -- 937Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos. Efficient algorithms for counting parameterized list H-colorings