External Links

    Journal: Theory Comput. Syst.

    Volume 65, Issue 7

    1033 -- 1068Friedrich Otto. On the Expressive Power of Stateless Ordered Restart-Delete Automata
    1069 -- 1093Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong. The Price of Fairness for Indivisible Goods
    1094 -- 1109Julian Nickerl. The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
    1110 -- 1116Matthieu Rosenfeld. Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets
    1117 -- 1140Mikhail Selianinau. Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System
    1141 -- 1142Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein. Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity
    runs on