| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Generalized Characterization of Algorithmic Probability
|
Sterkenburg, Tom F.
|
|
2017
|
61 |
4 |
p. 1337-1352
|
artikel
|
| 2 |
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata
|
Delacourt, Martin
|
|
2017
|
61 |
4 |
p. 1178-1213
|
artikel
|
| 3 |
Conditional Probabilities and van Lambalgen’s Theorem Revisited
|
Bauwens, Bruno
|
|
2017
|
61 |
4 |
p. 1315-1336
|
artikel
|
| 4 |
Dynamic Planar Embeddings of Dynamic Graphs
|
Holm, Jacob
|
|
2017
|
61 |
4 |
p. 1054-1083
|
artikel
|
| 5 |
Editorial: Special Issue on “Theoretical Aspects of Computer Science” (STACS 2015)
|
Mayr, Ernst W.
|
|
2017
|
61 |
4 |
p. 945-947
|
artikel
|
| 6 |
Exact Constructive and Computable Dimensions
|
Staiger, Ludwig
|
|
2017
|
61 |
4 |
p. 1288-1314
|
artikel
|
| 7 |
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015)
|
Lewis-Pye, Andrew
|
|
2017
|
61 |
4 |
p. 1252-1253
|
artikel
|
| 8 |
Layerwise Computability and Image Randomness
|
Bienvenu, Laurent
|
|
2017
|
61 |
4 |
p. 1353-1375
|
artikel
|
| 9 |
Minimum-Cost Flows in Unit-Capacity Networks
|
Goldberg, Andrew V.
|
|
2017
|
61 |
4 |
p. 987-1010
|
artikel
|
| 10 |
Multi-k-ic Depth Three Circuit Lower Bound
|
Kayal, Neeraj
|
|
2016
|
61 |
4 |
p. 1237-1251
|
artikel
|
| 11 |
New Pairwise Spanners
|
Kavitha, Telikepalli
|
|
2016
|
61 |
4 |
p. 1011-1036
|
artikel
|
| 12 |
On the Complexity of Automatic Complexity
|
Kjos-Hanssen, Bjørn
|
|
2017
|
61 |
4 |
p. 1427-1439
|
artikel
|
| 13 |
On the Information Carried by Programs About the Objects they Compute
|
Hoyrup, Mathieu
|
|
2016
|
61 |
4 |
p. 1214-1236
|
artikel
|
| 14 |
On the Uniform Computational Content of Computability Theory
|
Brattka, Vasco
|
|
2017
|
61 |
4 |
p. 1376-1426
|
artikel
|
| 15 |
Optimal Decremental Connectivity in Planar Graphs
|
Łącki, Jakub
|
|
2016
|
61 |
4 |
p. 1037-1053
|
artikel
|
| 16 |
Semiautomatic Structures
|
Jain, Sanjay
|
|
2017
|
61 |
4 |
p. 1254-1287
|
artikel
|
| 17 |
Short lists with short programs from programs of functions and strings
|
Vereshchagin, Nikolay
|
|
2017
|
61 |
4 |
p. 1440-1450
|
artikel
|
| 18 |
The Advice Complexity of a Class of Hard Online Problems
|
Boyar, Joan
|
|
2016
|
61 |
4 |
p. 1128-1177
|
artikel
|
| 19 |
Towards an Isomorphism Dichotomy for Hereditary Graph Classes
|
Schweitzer, Pascal
|
|
2017
|
61 |
4 |
p. 1084-1127
|
artikel
|
| 20 |
Welfare Maximization with Friends-of-Friends Network Externalities
|
Bhattacharya, Sayan
|
|
2017
|
61 |
4 |
p. 948-986
|
artikel
|
Tijdschrift beschrijving