Editorial Board
On list update with locality of reference
Implementing set objects in dynamic distributed systems
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Cloud-based automatic test data generation framework
Tractability frontiers of the partner units configuration problem
Comment on “A strong provably secure IBE scheme without bilinear map” by M. Zheng, Y. Xiang and H. Zhou [J. Comput. Syst. Sci. 81 (2015) 125–131]
On polynomial kernels for sparse integer linear programs
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
Efficient algorithms for the round-trip 1-center and 1-median problems
Separating OR, SUM, and XOR circuits
Bounds on the cover time of parallel rotor walks
On approximating tree spanners that are breadth first search trees
Satisfiability of ECTL⁎ with constraints
On the finite and general implication problems of independence atoms and keys
What is decidable about partially observable Markov decision processes with ω-regular objectives
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
HEX: Scaling honeycombs is easier than scaling clock trees
Corrigendum to “Evaluating rail transit timetable using big passengers' data” [J. Comput. Syst. Sci. 82 (1, Part B) (2016) 144–155]
Contents