Editor's Note.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 149, doi. 10.1007/s00224-014-9532-1
- Publication type:
- Article
Works matching IS 14324350 AND DT 2014 AND VI 54 AND IP 2
Results: 12
1
2
Prehistoric Graph in Modal Derivations and Self-Referentiality.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 190, doi. 10.1007/s00224-013-9510-z
- By:
- Publication type:
- Article
3
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 261, doi. 10.1007/s00224-013-9514-8
- By:
- Publication type:
- Article
4
Quotient Complexity of Closed Languages.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 277, doi. 10.1007/s00224-013-9515-7
- By:
- Publication type:
- Article
5
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 337, doi. 10.1007/s00224-013-9522-8
- By:
- Publication type:
- Article
6
On Equilibria in Quantitative Games with Reachability/Safety Objectives.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 150, doi. 10.1007/s00224-013-9495-7
- By:
- Publication type:
- Article
7
Obtaining Online Ecological Colourings by Generalizing First-Fit.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 244, doi. 10.1007/s00224-013-9513-9
- By:
- Publication type:
- Article
8
Balancing Bounded Treewidth Circuits.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 318, doi. 10.1007/s00224-013-9519-3
- By:
- Publication type:
- Article
9
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 293, doi. 10.1007/s00224-013-9516-6
- By:
- Publication type:
- Article
10
Growth of Power-Free Languages over Large Alphabets.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 224, doi. 10.1007/s00224-013-9512-x
- By:
- Publication type:
- Article
11
Encoding Invariance in Average Case Complexity.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 305, doi. 10.1007/s00224-013-9517-5
- By:
- Publication type:
- Article
12
Approximating the Minimum Length of Synchronizing Words Is Hard.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 211, doi. 10.1007/s00224-013-9511-y
- By:
- Publication type:
- Article