Works matching IS 14324350 AND DT 2012 AND VI 51 AND IP 3
Results: 8
How Powerful Are Integer-Valued Martingales?
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 330, doi. 10.1007/s00224-011-9362-3
- By:
- Publication type:
- Article
Computability of Countable Subshifts in One Dimension.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 352, doi. 10.1007/s00224-011-9358-z
- By:
- Publication type:
- Article
The Complexity of Explicit Constructions.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 297, doi. 10.1007/s00224-011-9368-x
- By:
- Publication type:
- Article
Programs, Proofs, Processes.
- Published in:
- 2012
- By:
- Publication type:
- Editorial
Proofs, Programs, Processes.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 313, doi. 10.1007/s00224-011-9325-8
- By:
- Publication type:
- Article
Avoiding Simplicity is Complex.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 282, doi. 10.1007/s00224-011-9334-7
- By:
- Publication type:
- Article
Approximate Self-Assembly of the Sierpinski Triangle.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 372, doi. 10.1007/s00224-011-9345-4
- By:
- Publication type:
- Article
A Faster Algorithm for Finding Minimum Tucker Submatrices.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 3, p. 270, doi. 10.1007/s00224-012-9388-1
- By:
- Publication type:
- Article