Skip to main content

Theory of Computing Systems

Ausgabe 3/2019

Inhalt (12 Artikel)

Better Complexity Bounds for Cost Register Automata

Eric Allender, Andreas Krebs, Pierre McKenzie

Nondeterminisic Sublinear Time Has Measure 0 in P

John M. Hitchcock, Adewale Sekoni

Computing Parameters of Sequence-Based Dynamic Graphs

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters

Open Access

On Tradeoffs Between Width- and Fill-like Graph Parameters

Dariusz Dereniowski, Adam Stański

Open Access

Motivating Time-Inconsistent Agents: A Computational Approach

Susanne Albers, Dennis Kraft

Open Access

Process Algebra with Strategic Interleaving

J. A. Bergstra, C. A. Middelburg

Open Access

Pattern Matching and Consensus Problems on Weighted Sequences and Profiles

Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski

Capturing Points with a Rotating Polygon (and a 3D Extension)

Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia

Algorithmic Randomness and Fourier Analysis

Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute

On the Parameterized Complexity of Contraction to Generalization of Trees

Akanksha Agarwal, Saket Saurabh, Prafullkumar Tale

Premium Partner