- George Christodoulou 0001, Stefano Leonardi, Alkmini Sgouritsa. Designing Cost-Sharing Methods for Bayesian Games. Theory Comput. Syst., 63(1):4-25, 2019.
- Simone Bova, Hubie Chen. How Many Variables are Needed to Express an Existential Positive Query?. Theory Comput. Syst., 63(7):1573-1594, 2019.
- Eric Allender, Andreas Krebs, Pierre McKenzie. Better Complexity Bounds for Cost Register Automata. Theory Comput. Syst., 63(3):367-385, 2019.
- Alon Eden, Michal Feldman, Adi Vardi. Online Random Sampling for Budgeted Settings. Theory Comput. Syst., 63(7):1470-1498, 2019.
- A Message from the Springer Editorial Team. Theory Comput. Syst., 63(1):1, 2019.
- Dominik D. Freydenberger. A Logic for Document Spanners. Theory Comput. Syst., 63(7):1679-1754, 2019.
- Piotr Sankowski, Karol Wegrzycki. Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst., 63(5):1049-1067, 2019.
- Spyros Angelopoulos 0001. Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems. Theory Comput. Syst., 63(6):1413-1447, 2019.
- Peter Kostolányi. A Unifying Approach to Algebraic Systems Over Semirings. Theory Comput. Syst., 63(3):615-633, 2019.
- Vittorio Bilò, Michele Flammini. Guest Editorial: Special Issue on Algorithmic Game Theory. Theory Comput. Syst., 63(7):1449-1450, 2019.