(Δ+1) vertex coloring in O(n) communication.
- Published in:
- Distributed Computing, 2025, v. 38, n. 1, p. 19, doi. 10.1007/s00446-024-00475-3
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2025 AND VI 38 AND IP 1
Results: 4
1
2
Fast and fair randomized wait-free locks.
- Published in:
- Distributed Computing, 2025, v. 38, n. 1, p. 51, doi. 10.1007/s00446-024-00474-4
- By:
- Publication type:
- Article
3
Communication lower bounds for cryptographic broadcast protocols: Communication lower bounds for cryptographic broadcast protocols: E. Blum et al.
- Published in:
- Distributed Computing, 2025, v. 38, n. 1, p. 1, doi. 10.1007/s00446-024-00473-5
- By:
- Publication type:
- Article
4
Deterministic fault-tolerant connectivity labeling scheme: Deterministic fault-tolerant connectivity labeling scheme: T. Izumi et al.
- Published in:
- Distributed Computing, 2025, v. 38, n. 1, p. 31, doi. 10.1007/s00446-024-00472-6
- By:
- Publication type:
- Article