| 627 | -- | 653 | Susanne Albers, Sonja Lauer. On list update with locality of reference |
| 654 | -- | 689 | Roberto Baldoni, Silvia Bonomi, Michel Raynal. Implementing set objects in dynamic distributed systems |
| 690 | -- | 711 | Jin-yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region |
| 712 | -- | 738 | Priyanka Chawla, Inderveer Chana, Ajay Rana. Cloud-based automatic test data generation framework |
| 739 | -- | 755 | Erich Christian Teppan, Gerhard Friedrich, Georg Gottlob. Tractability frontiers of the partner units configuration problem |
| 756 | -- | 757 | Damien Vergnaud. 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] |
| 758 | -- | 766 | Stefan Kratsch. On polynomial kernels for sparse integer linear programs |
| 767 | -- | 781 | Chia-Wen Cheng, Sun-Yuan Hsieh. Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges |
| 782 | -- | 792 | Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen. Efficient algorithms for the round-trip 1-center and 1-median problems |
| 793 | -- | 801 | Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen. Separating OR, SUM, and XOR circuits |
| 802 | -- | 816 | Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski. Bounds on the cover time of parallel rotor walks |
| 817 | -- | 825 | Ioannis Papoutsakis. On approximating tree spanners that are breadth first search trees |
| 826 | -- | 855 | Claudia Carapelle, Alexander Kartzow, Markus Lohrey. ⁎ with constraints |
| 856 | -- | 877 | Miika Hannula, Juha Kontinen, Sebastian Link. On the finite and general implication problems of independence atoms and keys |
| 878 | -- | 911 | Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol. What is decidable about partially observable Markov decision processes with ω-regular objectives |
| 912 | -- | 928 | Peter Jonsson, Johan Thapper. Constraint satisfaction and semilinear expansions of addition over the rationals and the reals |
| 929 | -- | 956 | Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid. HEX: Scaling honeycombs is easier than scaling clock trees |
| 957 | -- | 0 | Zhibin Jiang, Ching-Hsien Hsu, Daqiang Zhang, Xiaolei Zou. Corrigendum to "Evaluating rail transit timetable using big passengers' data" [J. Comput. Syst. Sci. 82 (1, Part B) (2016) 144-155] |