Works matching IS 14324350 AND DT 2013 AND VI 53 AND IP 3
Results: 7
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series.
- Published in:
- 2013
- By:
- Publication type:
- Editorial
The Complexity of Computing Minimal Unidirectional Covering Sets.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 467, doi. 10.1007/s00224-012-9437-9
- By:
- Publication type:
- Article
Nonpreemptive Coordination Mechanisms for Identical Machines.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 424, doi. 10.1007/s00224-012-9429-9
- By:
- Publication type:
- Article
Global Strong Defensive Alliances of Sierpiński-Like Graphs.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 365, doi. 10.1007/s00224-012-9423-2
- By:
- Publication type:
- Article
Unbalanced Graph Partitioning.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 454, doi. 10.1007/s00224-012-9436-x
- By:
- Publication type:
- Article
On the Complexity of Pareto-Optimal Nash and Strong Equilibria.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 441, doi. 10.1007/s00224-012-9433-0
- By:
- Publication type:
- Article
Static Strategies for Worksharing with Unrecoverable Interruptions.
- Published in:
- Theory of Computing Systems, 2013, v. 53, n. 3, p. 386, doi. 10.1007/s00224-012-9426-z
- By:
- Publication type:
- Article