nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('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. |
artikel |
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. |
artikel |
3 |
Approximation of smallest linear tree grammar
|
Jeż, Artur |
|
2016 |
251 |
C |
p. 215-251 37 p. |
artikel |
4 |
Better abstractions for timed automata
|
Herbreteau, Frédéric |
|
2016 |
251 |
C |
p. 67-90 24 p. |
artikel |
5 |
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
|
Hsieh, Sun-Yuan |
|
2016 |
251 |
C |
p. 314-334 21 p. |
artikel |
6 |
Editorial Board
|
|
|
2016 |
251 |
C |
p. IFC- 1 p. |
artikel |
7 |
Editorial Board
|
|
|
2016 |
251 |
C |
p. i- 1 p. |
artikel |
8 |
Enlarging learnable classes
|
Jain, Sanjay |
|
2016 |
251 |
C |
p. 194-207 14 p. |
artikel |
9 |
Finding all solutions of equations in free groups and monoids with involution
|
Diekert, Volker |
|
2016 |
251 |
C |
p. 263-286 24 p. |
artikel |
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. |
artikel |
11 |
Name-passing calculi: From fusions to preorders and types
|
Hirschkoff, Daniel |
|
2016 |
251 |
C |
p. 335-360 26 p. |
artikel |
12 |
Network-formation games with regular objectives
|
Avni, Guy |
|
2016 |
251 |
C |
p. 165-178 14 p. |
artikel |
13 |
On teaching sets of k-threshold functions
|
Zamaraeva, Elena |
|
2016 |
251 |
C |
p. 301-313 13 p. |
artikel |
14 |
On temporal logics with data variable quantifications: Decidability and complexity
|
Song, Fu |
|
2016 |
251 |
C |
p. 104-139 36 p. |
artikel |
15 |
Parameterized algorithms for the Module Motif problem
|
Zehavi, Meirav |
|
2016 |
251 |
C |
p. 179-193 15 p. |
artikel |
16 |
Prices matter for the parameterized complexity of shift bribery
|
Bredereck, Robert |
|
2016 |
251 |
C |
p. 140-164 25 p. |
artikel |
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. |
artikel |
18 |
Regressive computations characterize logarithmic space
|
Mazzanti, Stefano |
|
2016 |
251 |
C |
p. 16-35 20 p. |
artikel |
19 |
Strongly non-U-shaped language learning results by general techniques
|
Case, John |
|
2016 |
251 |
C |
p. 1-15 15 p. |
artikel |
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. |
artikel |
21 |
The parameterised complexity of list problems on graphs of bounded treewidth
|
Meeks, Kitty |
|
2016 |
251 |
C |
p. 91-103 13 p. |
artikel |