Theory of Computing Systems
Collection
Collection
- ISSN: 1432-4350
Published by Springer Nature
-
The Strong Price of Anarchy of Linear Bottleneck Congestion Games Article
Theory of Computing SystemsB. de Keijzer (Bart), G. Schäfer (Guido) and O. Telelis (Orestis)
January 2014
-
Hardness of Approximation for Knapsack Problems Article
Theory of Computing Systems, 56(2), 372-393.H.M. Buhrman (Harry), B. S. Loff Barreto (Bruno Serra) and L. Torenvliet (Leen)
January 2015
-
Inefficiency of Games with Social Context Article
Theory of Computing Systems, 57(3), 782-804.A. Anagnostopoulos (Aris), L. Becchetti, B. de Keijzer (Bart) and G. Schäfer (Guido)
January 2015
-
The Strong Price of Anarchy of Linear Bottleneck Congestion Games Article
Theory of Computing Systems, 57(2), 377-396.B. de Keijzer (Bart), G. Schäfer (Guido) and O. Telelis (Orestis)
January 2015
-
Distinguishing two probability ensembles with one sample from each ensemble Article
Theory of Computing Systems, 59(3), 517-531.L.F. Antunes (Luis), H.M. Buhrman (Harry), A. Matos, A. Souto (André) and A. Teixeira
October 2016 -
A generalized characterization of algorithmic probability Article
Theory of Computing Systems, 61(4), 1337-1352.November 2017
-
The impact of worst-case deviations in non-atomic network routing games Article
Theory of Computing Systems, 54-89.December 2017 -
Tight bounds for Double Coverage against weak adversaries Article
Theory of Computing Systems, 62(2), 349-365.N. Bansal (Nikhil), M. Eliáš (Marek), Ł. Jeż (Łukasz), G. Koumoutsos (Grigorios) and K. Pruhs (Kirk)
February 2018