| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Addendum to ‘Exponential time improvement for min-wise based algorithms’ [Information and Computation 209 (2011) 737–747]
|
Feigenblat, Guy
|
|
2016
|
251 |
C |
p. 361-
1 p.
|
article
|
| 2 |
A generalization of Spira's theorem and circuits with small segregators or separators
|
Gál, Anna
|
|
2016
|
251 |
C |
p. 252-262
11 p.
|
article
|
| 3 |
Approximation of smallest linear tree grammar
|
Jeż, Artur
|
|
2016
|
251 |
C |
p. 215-251
37 p.
|
article
|
| 4 |
Better abstractions for timed automata
|
Herbreteau, Frédéric
|
|
2016
|
251 |
C |
p. 67-90
24 p.
|
article
|
| 5 |
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
|
Hsieh, Sun-Yuan
|
|
2016
|
251 |
C |
p. 314-334
21 p.
|
article
|
| 6 |
Editorial Board
|
|
|
2016
|
251 |
C |
p. IFC-
1 p.
|
article
|
| 7 |
Editorial Board
|
|
|
2016
|
251 |
C |
p. i-
1 p.
|
article
|
| 8 |
Enlarging learnable classes
|
Jain, Sanjay
|
|
2016
|
251 |
C |
p. 194-207
14 p.
|
article
|
| 9 |
Finding all solutions of equations in free groups and monoids with involution
|
Diekert, Volker
|
|
2016
|
251 |
C |
p. 263-286
24 p.
|
article
|
| 10 |
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
|
Barmpalias, George
|
|
2016
|
251 |
C |
p. 287-300
14 p.
|
article
|
| 11 |
Name-passing calculi: From fusions to preorders and types
|
Hirschkoff, Daniel
|
|
2016
|
251 |
C |
p. 335-360
26 p.
|
article
|
| 12 |
Network-formation games with regular objectives
|
Avni, Guy
|
|
2016
|
251 |
C |
p. 165-178
14 p.
|
article
|
| 13 |
On teaching sets of k-threshold functions
|
Zamaraeva, Elena
|
|
2016
|
251 |
C |
p. 301-313
13 p.
|
article
|
| 14 |
On temporal logics with data variable quantifications: Decidability and complexity
|
Song, Fu
|
|
2016
|
251 |
C |
p. 104-139
36 p.
|
article
|
| 15 |
Parameterized algorithms for the Module Motif problem
|
Zehavi, Meirav
|
|
2016
|
251 |
C |
p. 179-193
15 p.
|
article
|
| 16 |
Prices matter for the parameterized complexity of shift bribery
|
Bredereck, Robert
|
|
2016
|
251 |
C |
p. 140-164
25 p.
|
article
|
| 17 |
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O ( log n ) bit rounds
|
Métivier, Y.
|
|
2016
|
251 |
C |
p. 208-214
7 p.
|
article
|
| 18 |
Regressive computations characterize logarithmic space
|
Mazzanti, Stefano
|
|
2016
|
251 |
C |
p. 16-35
20 p.
|
article
|
| 19 |
Strongly non-U-shaped language learning results by general techniques
|
Case, John
|
|
2016
|
251 |
C |
p. 1-15
15 p.
|
article
|
| 20 |
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
|
Galanis, Andreas
|
|
2016
|
251 |
C |
p. 36-66
31 p.
|
article
|
| 21 |
The parameterised complexity of list problems on graphs of bounded treewidth
|
Meeks, Kitty
|
|
2016
|
251 |
C |
p. 91-103
13 p.
|
article
|
Journal description