| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An efficient time-free solution to QSAT problem using P systems with proteins on membranes
|
Song, Bosheng
|
|
2017
|
256 |
C |
p. 287-299
13 p.
|
artikel
|
| 2 |
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
|
Glaßer, Christian
|
|
2017
|
256 |
C |
p. 93-107
15 p.
|
artikel
|
| 3 |
Classification based on prototypes with spheres of influence
|
Anthony, Martin
|
|
2017
|
256 |
C |
p. 372-380
9 p.
|
artikel
|
| 4 |
Classifying recognizable infinitary trace languages using word automata
|
Chaturvedi, Namit
|
|
2017
|
256 |
C |
p. 23-34
12 p.
|
artikel
|
| 5 |
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
|
Ogihara, Mitsunori
|
|
2017
|
256 |
C |
p. 226-236
11 p.
|
artikel
|
| 6 |
Deletion operations on deterministic families of automata
|
Eremondi, Joey
|
|
2017
|
256 |
C |
p. 237-252
16 p.
|
artikel
|
| 7 |
Distinguishing pattern languages with membership examples
|
Gao, Ziyuan
|
|
2017
|
256 |
C |
p. 348-371
24 p.
|
artikel
|
| 8 |
Editing to a connected graph of given degrees
|
Golovach, Petr A.
|
|
2017
|
256 |
C |
p. 131-147
17 p.
|
artikel
|
| 9 |
Editorial Board
|
|
|
2017
|
256 |
C |
p. IFC-
1 p.
|
artikel
|
| 10 |
Exact algorithms for Maximum Induced Matching
|
Xiao, Mingyu
|
|
2017
|
256 |
C |
p. 196-211
16 p.
|
artikel
|
| 11 |
Finding connected k-subgraphs with high density
|
Chen, Xujin
|
|
2017
|
256 |
C |
p. 160-173
14 p.
|
artikel
|
| 12 |
Hitting forbidden subgraphs in graphs of bounded treewidth
|
Cygan, Marek
|
|
2017
|
256 |
C |
p. 62-82
21 p.
|
artikel
|
| 13 |
Information rate of some classes of non-regular languages: An automata-theoretic approach
|
Cui, Cewei
|
|
2017
|
256 |
C |
p. 45-61
17 p.
|
artikel
|
| 14 |
Measure properties of regular sets of trees
|
Gogacz, Tomasz
|
|
2017
|
256 |
C |
p. 108-130
23 p.
|
artikel
|
| 15 |
Minimum bisection is NP-hard on unit disk graphs
|
Díaz, Josep
|
|
2017
|
256 |
C |
p. 83-92
10 p.
|
artikel
|
| 16 |
On finding the Adams consensus tree
|
Jansson, Jesper
|
|
2017
|
256 |
C |
p. 334-347
14 p.
|
artikel
|
| 17 |
On the limits of depth reduction at depth 3 over small finite fields
|
Chillara, Suryajith
|
|
2017
|
256 |
C |
p. 35-44
10 p.
|
artikel
|
| 18 |
Quantum game players can have advantage without discord
|
Wei, Zhaohui
|
|
2017
|
256 |
C |
p. 174-184
11 p.
|
artikel
|
| 19 |
Robust simulations and significant separations
|
Fortnow, Lance
|
|
2017
|
256 |
C |
p. 149-159
11 p.
|
artikel
|
| 20 |
Session types revisited
|
Dardha, Ornela
|
|
2017
|
256 |
C |
p. 253-286
34 p.
|
artikel
|
| 21 |
Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary
|
Dietzfelbinger, Martin
|
|
2017
|
256 |
C |
p. 1-
1 p.
|
artikel
|
| 22 |
Special issue on the conference Theory and Applications of Models of Computation
|
Jain, Rahul
|
|
2017
|
256 |
C |
p. 148-
1 p.
|
artikel
|
| 23 |
The complexity of degree anonymization by graph contractions
|
Talmon, Nimrod
|
|
2017
|
256 |
C |
p. 212-225
14 p.
|
artikel
|
| 24 |
The dynamic descriptive complexity of k-clique
|
Zeume, Thomas
|
|
2017
|
256 |
C |
p. 9-22
14 p.
|
artikel
|
| 25 |
Undecidability of asynchronous session subtyping
|
Bravetti, Mario
|
|
2017
|
256 |
C |
p. 300-320
21 p.
|
artikel
|
| 26 |
Where join preservation fails in the bounded Turing degrees of c.e. sets
|
Losert, Nadine
|
|
2017
|
256 |
C |
p. 185-195
11 p.
|
artikel
|
| 27 |
WQO is decidable for factorial languages
|
Atminas, Aistis
|
|
2017
|
256 |
C |
p. 321-333
13 p.
|
artikel
|
| 28 |
Zero knowledge and circuit minimization
|
Allender, Eric
|
|
2017
|
256 |
C |
p. 2-8
7 p.
|
artikel
|
Tijdschrift beschrijving