Topological Automata.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 397, doi. 10.1007/s00224-006-1314-y
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2007 AND VI 41 AND IP 1
Results: 14
1
2
Dynamic Complexity Theory Revisited.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 355, doi. 10.1007/s00224-006-1312-0
- By:
- Publication type:
- Article
3
Robust Polynomials and Quantum Algorithms.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 379, doi. 10.1007/s00224-006-1313-z
- By:
- Publication type:
- Article
4
The Variable Hierarchy of the μ-Calculus Is Strict.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 437, doi. 10.1007/s00224-006-1317-8
- By:
- Publication type:
- Article
5
Roundings Respecting Hard Constraints.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 467, doi. 10.1007/s00224-006-1318-7
- By:
- Publication type:
- Article
6
Algorithms to Compute Minimum Cycle Basis in Directed Graphs.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 485, doi. 10.1007/s00224-006-1319-6
- By:
- Publication type:
- Article
7
Varieties of Codes and Kraft Inequality.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 507, doi. 10.1007/s00224-006-1320-0
- By:
- Publication type:
- Article
8
The Power of Commuting with Finite Sets of Words.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 521, doi. 10.1007/s00224-006-1321-z
- By:
- Publication type:
- Article
9
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 553, doi. 10.1007/s00224-006-1322-y
- By:
- Publication type:
- Article
10
Foreword.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 301, doi. 10.1007/s00224-006-3905-z
- Publication type:
- Article
11
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 409, doi. 10.1007/s00224-006-1315-x
- By:
- Publication type:
- Article
12
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 423, doi. 10.1007/s00224-006-1316-9
- By:
- Publication type:
- Article
13
Characterizing TC<sup>0</sup> in Terms of Infinite Groups.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 303, doi. 10.1007/s00224-006-1310-2
- By:
- Publication type:
- Article
14
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 327, doi. 10.1007/s00224-006-1311-1
- By:
- Publication type:
- Article