nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximating the Minimum Length of Synchronizing Words Is Hard
|
Berlinkov, Mikhail V. |
|
2013 |
54 |
2 |
p. 211-223 |
artikel |
2 |
Balancing Bounded Treewidth Circuits
|
Jansen, Maurice |
|
2013 |
54 |
2 |
p. 318-336 |
artikel |
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 |
artikel |
4 |
Editor’s Note
|
|
|
2014 |
54 |
2 |
p. 149 |
artikel |
5 |
Encoding Invariance in Average Case Complexity
|
Vereshchagin, Nikolay |
|
2013 |
54 |
2 |
p. 305-317 |
artikel |
6 |
Growth of Power-Free Languages over Large Alphabets
|
Shur, Arseny M. |
|
2013 |
54 |
2 |
p. 224-243 |
artikel |
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 |
artikel |
8 |
Obtaining Online Ecological Colourings by Generalizing First-Fit
|
Johnson, Matthew |
|
2013 |
54 |
2 |
p. 244-260 |
artikel |
9 |
On Equilibria in Quantitative Games with Reachability/Safety Objectives
|
Brihaye, Thomas |
|
2013 |
54 |
2 |
p. 150-189 |
artikel |
10 |
Prehistoric Graph in Modal Derivations and Self-Referentiality
|
Yu, Junhua |
|
2013 |
54 |
2 |
p. 190-210 |
artikel |
11 |
Quotient Complexity of Closed Languages
|
Brzozowski, Janusz |
|
2013 |
54 |
2 |
p. 277-292 |
artikel |
12 |
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
|
Gawrychowski, Paweł |
|
2013 |
54 |
2 |
p. 337-372 |
artikel |