Homonym Population Protocols.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1318, doi. 10.1007/s00224-017-9833-2
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2018 AND VI 62 AND IP 5
Results: 15
1
2
Publisher Correction: Editor’s Note.
- Published in:
- 2018
- By:
- Publication type:
- Correction Notice
3
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1288, doi. 10.1007/s00224-017-9826-1
- By:
- Publication type:
- Article
4
On Effective Birkhoff’s Ergodic Theorem for Computable Actions of Amenable Groups.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1269, doi. 10.1007/s00224-017-9822-5
- By:
- Publication type:
- Article
5
The Algebraic Theory of Parikh Automata.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1241, doi. 10.1007/s00224-017-9817-2
- By:
- Publication type:
- Article
6
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1223, doi. 10.1007/s00224-017-9816-3
- By:
- Publication type:
- Article
7
The Complexity of Tensor Rank.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1161, doi. 10.1007/s00224-017-9800-y
- By:
- Publication type:
- Article
8
Exact Localisations of Feedback Sets.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1048, doi. 10.1007/s00224-017-9777-6
- By:
- Publication type:
- Article
9
Self-Stabilizing Leader Election in Dynamic Networks.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 977, doi. 10.1007/s00224-017-9758-9
- By:
- Publication type:
- Article
10
From Tree Automata to String Automata Minimization.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1203, doi. 10.1007/s00224-017-9815-4
- By:
- Publication type:
- Article
11
Exploration of the <italic>T</italic>-Interval-Connected Dynamic Graphs: the Case of the Ring.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1144, doi. 10.1007/s00224-017-9796-3
- By:
- Publication type:
- Article
12
Syntactic Complexity of Regular Ideals.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1175, doi. 10.1007/s00224-017-9803-8
- By:
- Publication type:
- Article
13
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1125, doi. 10.1007/s00224-017-9787-4
- By:
- Publication type:
- Article
14
Co-c.e. Sets with Disconnected Complements.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1109, doi. 10.1007/s00224-017-9781-x
- By:
- Publication type:
- Article
15
A Closer Look at Fault Tolerance.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 5, p. 1085, doi. 10.1007/s00224-017-9779-4
- By:
- Publication type:
- Article