| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
|
Cai, Jin-Yi
|
|
2016
|
82 |
5 |
p. 690-711
22 p.
|
article
|
| 2 |
Bounds on the cover time of parallel rotor walks
|
Dereniowski, Dariusz
|
|
2016
|
82 |
5 |
p. 802-816
15 p.
|
article
|
| 3 |
Cloud-based automatic test data generation framework
|
Chawla, Priyanka
|
|
2016
|
82 |
5 |
p. 712-738
27 p.
|
article
|
| 4 |
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]
|
Vergnaud, Damien
|
|
2016
|
82 |
5 |
p. 756-757
2 p.
|
article
|
| 5 |
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
|
Jonsson, Peter
|
|
2016
|
82 |
5 |
p. 912-928
17 p.
|
article
|
| 6 |
Contents
|
|
|
2016
|
82 |
5 |
p. OBC-
1 p.
|
article
|
| 7 |
Corrigendum to “Evaluating rail transit timetable using big passengers' data” [J. Comput. Syst. Sci. 82 (1, Part B) (2016) 144–155]
|
Jiang, Zhibin
|
|
2016
|
82 |
5 |
p. 957-
1 p.
|
article
|
| 8 |
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
|
Cheng, Chia-Wen
|
|
2016
|
82 |
5 |
p. 767-781
15 p.
|
article
|
| 9 |
Editorial Board
|
|
|
2016
|
82 |
5 |
p. IFC-
1 p.
|
article
|
| 10 |
Efficient algorithms for the round-trip 1-center and 1-median problems
|
Wang, Biing-Feng
|
|
2016
|
82 |
5 |
p. 782-792
11 p.
|
article
|
| 11 |
HEX: Scaling honeycombs is easier than scaling clock trees
|
Dolev, Danny
|
|
2016
|
82 |
5 |
p. 929-956
28 p.
|
article
|
| 12 |
Implementing set objects in dynamic distributed systems
|
Baldoni, Roberto
|
|
2016
|
82 |
5 |
p. 654-689
36 p.
|
article
|
| 13 |
On approximating tree spanners that are breadth first search trees
|
Papoutsakis, Ioannis
|
|
2016
|
82 |
5 |
p. 817-825
9 p.
|
article
|
| 14 |
On list update with locality of reference
|
Albers, Susanne
|
|
2016
|
82 |
5 |
p. 627-653
27 p.
|
article
|
| 15 |
On polynomial kernels for sparse integer linear programs
|
Kratsch, Stefan
|
|
2016
|
82 |
5 |
p. 758-766
9 p.
|
article
|
| 16 |
On the finite and general implication problems of independence atoms and keys
|
Hannula, Miika
|
|
2016
|
82 |
5 |
p. 856-877
22 p.
|
article
|
| 17 |
Satisfiability of ECTL⁎ with constraints
|
Carapelle, Claudia
|
|
2016
|
82 |
5 |
p. 826-855
30 p.
|
article
|
| 18 |
Separating OR, SUM, and XOR circuits
|
Find, Magnus
|
|
2016
|
82 |
5 |
p. 793-801
9 p.
|
article
|
| 19 |
Tractability frontiers of the partner units configuration problem
|
Teppan, Erich Christian
|
|
2016
|
82 |
5 |
p. 739-755
17 p.
|
article
|
| 20 |
What is decidable about partially observable Markov decision processes with ω-regular objectives
|
Chatterjee, Krishnendu
|
|
2016
|
82 |
5 |
p. 878-911
34 p.
|
article
|
Journal description