| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Alignment-free sequence comparison using absent words
|
Charalampopoulos, Panagiotis
|
|
2018
|
262 |
P1 |
p. 57-68
|
article
|
| 2 |
Best of two local models: Centralized local and distributed local algorithms
|
Even, Guy
|
|
2018
|
262 |
P1 |
p. 69-89
|
article
|
| 3 |
Classes of languages generated by the Kleene star of a word
|
Daviaud, Laure
|
|
2018
|
262 |
P1 |
p. 90-109
|
article
|
| 4 |
CTL* with graded path modalities
|
Aminof, Benjamin
|
|
2018
|
262 |
P1 |
p. 1-21
|
article
|
| 5 |
Editorial Board
|
|
|
2018
|
262 |
P1 |
p. ii
|
article
|
| 6 |
Equivalences between learning of data and probability distributions, and their applications
|
Barmpalias, George
|
|
2018
|
262 |
P1 |
p. 123-140
|
article
|
| 7 |
Inapproximability results for constrained approximate Nash equilibria
|
Deligkas, Argyrios
|
|
2018
|
262 |
P1 |
p. 40-56
|
article
|
| 8 |
Non computable Mandelbrot-like sets for a one-parameter complex family
|
Coronel, Daniel
|
|
2018
|
262 |
P1 |
p. 110-122
|
article
|
| 9 |
On the complexity of noncommutative polynomial factorization
|
Arvind, V.
|
|
2018
|
262 |
P1 |
p. 22-39
|
article
|
| 10 |
The quest for minimal quotients for probabilistic and Markov automata
|
Eisentraut, Christian
|
|
2018
|
262 |
P1 |
p. 162-186
|
article
|
| 11 |
Understanding cutting planes for QBFs
|
Beyersdorff, Olaf
|
|
2018
|
262 |
P1 |
p. 141-161
|
article
|
Journal description