Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.
- Published in:
- 2021
- By:
- Publication type:
- Correction Notice
Works matching IS 14324350 AND DT 2021 AND VI 65 AND IP 7
Results: 6
1
2
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 7, p. 1110, doi. 10.1007/s00224-021-10040-1
- By:
- Publication type:
- Article
3
The Price of Fairness for Indivisible Goods.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 7, p. 1069, doi. 10.1007/s00224-021-10039-8
- By:
- Publication type:
- Article
4
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 7, p. 1094, doi. 10.1007/s00224-021-10038-9
- By:
- Publication type:
- Article
5
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 7, p. 1117, doi. 10.1007/s00224-021-10035-y
- By:
- Publication type:
- Article
6
On the Expressive Power of Stateless Ordered Restart-Delete Automata.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 7, p. 1033, doi. 10.1007/s00224-020-10028-3
- By:
- Publication type:
- Article