Works matching IS 14324350 AND DT 2012 AND VI 51 AND IP 3

Results: 8

Proofs, Programs, Processes.

Published in:

Theory of Computing Systems, 2012, v. 51, n. 3, p. 313, doi. 10.1007/s00224-011-9325-8

By:

Berger, Ulrich;
Seisenberger, Monika

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:

Allender, Eric;
Spakowski, Holger

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:

Lutz, Jack;
Shutters, Brad

Publication type:

Article

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:

Bienvenu, Laurent;
Stephan, Frank;
Teutsch, Jason

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:

Cenzer, Douglas;
Dashti, Ali;
Toska, Ferit;
Wyman, Sebastian

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:

Santhanam, Rahul

Publication type:

Article

Programs, Proofs, Processes.

Published in:

2012

By:

Ferreira, Fernando;
Löwe, Benedikt;
Mayordomo, Elvira

Publication type:

Editorial

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:

Blin, Guillaume;
Rizzi, Romeo;
Vialette, Stéphane

Publication type:

Article