| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximating the Minimum Length of Synchronizing Words Is Hard
|
Berlinkov, Mikhail V.
|
|
2013
|
54 |
2 |
p. 211-223
|
article
|
| 2 |
Balancing Bounded Treewidth Circuits
|
Jansen, Maurice
|
|
2013
|
54 |
2 |
p. 318-336
|
article
|
| 3 |
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
|
Martyugin, Pavel
|
|
2013
|
54 |
2 |
p. 293-304
|
article
|
| 4 |
Editor’s Note
|
|
|
2014
|
54 |
2 |
p. 149
|
article
|
| 5 |
Encoding Invariance in Average Case Complexity
|
Vereshchagin, Nikolay
|
|
2013
|
54 |
2 |
p. 305-317
|
article
|
| 6 |
Growth of Power-Free Languages over Large Alphabets
|
Shur, Arseny M.
|
|
2013
|
54 |
2 |
p. 224-243
|
article
|
| 7 |
Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
|
Itsykson, Dmitry
|
|
2013
|
54 |
2 |
p. 261-276
|
article
|
| 8 |
Obtaining Online Ecological Colourings by Generalizing First-Fit
|
Johnson, Matthew
|
|
2013
|
54 |
2 |
p. 244-260
|
article
|
| 9 |
On Equilibria in Quantitative Games with Reachability/Safety Objectives
|
Brihaye, Thomas
|
|
2013
|
54 |
2 |
p. 150-189
|
article
|
| 10 |
Prehistoric Graph in Modal Derivations and Self-Referentiality
|
Yu, Junhua
|
|
2013
|
54 |
2 |
p. 190-210
|
article
|
| 11 |
Quotient Complexity of Closed Languages
|
Brzozowski, Janusz
|
|
2013
|
54 |
2 |
p. 277-292
|
article
|
| 12 |
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
|
Gawrychowski, Paweł
|
|
2013
|
54 |
2 |
p. 337-372
|
article
|
Journal description