A distributed low tree-depth decomposition algorithm for bounded expansion classes.
- Published in:
- Distributed Computing, 2016, v. 29, n. 1, p. 39, doi. 10.1007/s00446-015-0251-x
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2016 AND VI 29 AND IP 1
Results: 5
1
2
Time versus cost tradeoffs for deterministic rendezvous in networks.
- Published in:
- Distributed Computing, 2016, v. 29, n. 1, p. 51, doi. 10.1007/s00446-015-0253-8
- By:
- Publication type:
- Article
3
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions.
- Published in:
- Distributed Computing, 2016, v. 29, n. 1, p. 17, doi. 10.1007/s00446-015-0254-7
- By:
- Publication type:
- Article
4
Close to linear space routing schemes.
- Published in:
- Distributed Computing, 2016, v. 29, n. 1, p. 65, doi. 10.1007/s00446-015-0256-5
- By:
- Publication type:
- Article
5
Fair and resilient Incentive Tree mechanisms.
- Published in:
- Distributed Computing, 2016, v. 29, n. 1, p. 1, doi. 10.1007/s00446-015-0250-y
- By:
- Publication type:
- Article