Results: 12
A Unifying Approach to Algebraic Systems Over Semirings.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 615, doi. 10.1007/s00224-018-9895-9
- By:
- Publication type:
- Article
On the Parameterized Complexity of Contraction to Generalization of Trees.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 587, doi. 10.1007/s00224-018-9892-z
- By:
- Publication type:
- Article
Algorithmic Randomness and Fourier Analysis.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 567, doi. 10.1007/s00224-018-9888-8
- By:
- Publication type:
- Article
Capturing Points with a Rotating Polygon (and a 3D Extension).
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 543, doi. 10.1007/s00224-018-9885-y
- By:
- Publication type:
- Article
Motivating Time-Inconsistent Agents: A Computational Approach.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 466, doi. 10.1007/s00224-018-9883-0
- By:
- Publication type:
- Article
On Tradeoffs Between Width- and Fill-like Graph Parameters.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 450, doi. 10.1007/s00224-018-9882-1
- By:
- Publication type:
- Article
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 506, doi. 10.1007/s00224-018-9881-2
- By:
- Publication type:
- Article
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 418, doi. 10.1007/s00224-018-9880-3
- By:
- Publication type:
- Article
Nondeterminisic Sublinear Time Has Measure 0 in P.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 386, doi. 10.1007/s00224-018-9875-0
- By:
- Publication type:
- Article
Process Algebra with Strategic Interleaving.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 488, doi. 10.1007/s00224-018-9873-2
- By:
- Publication type:
- Article
Better Complexity Bounds for Cost Register Automata.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 367, doi. 10.1007/s00224-018-9871-4
- By:
- Publication type:
- Article
Computing Parameters of Sequence-Based Dynamic Graphs.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 3, p. 394, doi. 10.1007/s00224-018-9876-z
- By:
- Publication type:
- Article