Found: 9
Select item for more details and to access through your institution.
A Solution to Wiehagen's Thesis.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 498, doi. 10.1007/s00224-016-9678-0
- By:
- Publication type:
- Article
Higher Randomness and Forcing with Closed Sets.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 421, doi. 10.1007/s00224-016-9681-5
- By:
- Publication type:
- Article
On Symmetric Circuits and Fixed-Point Logics.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 521, doi. 10.1007/s00224-016-9692-2
- By:
- Publication type:
- Article
On Boolean Closed Full Trios and Rational Kripke Frames.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 438, doi. 10.1007/s00224-016-9694-0
- By:
- Publication type:
- Article
Genericity of Weakly Computable Objects.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 396, doi. 10.1007/s00224-016-9737-6
- By:
- Publication type:
- Article
Partition Expanders.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 378, doi. 10.1007/s00224-016-9738-5
- By:
- Publication type:
- Article
2-Stack Sorting is Polynomial.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 552, doi. 10.1007/s00224-016-9743-8
- By:
- Publication type:
- Article
Editor's Note.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 377, doi. 10.1007/s00224-017-9750-4
- Publication type:
- Article
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 3, p. 473, doi. 10.1007/s00224-016-9668-2
- By:
- Publication type:
- Article