✦ LIBER ✦

Distributed computing with advice: information sensitivity of graph coloring

✍ Scribed by Pierre Fraigniaud; Cyril Gavoille; David Ilcinkas; Andrzej Pelc

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of distributed graph c

✍ Cyril Gavoille; Ralf Klasing; Adrian Kosowski; Łukasz Kuszner; Alfredo Navarra 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Computational complexity of distributed

✍ N.S.V. Rao; S.S. Iyengar; R.L. Kashyap 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 498 KB

[Communications in Computer and Informat

✍ Pichappan, Pit; Ahmadi, Hojat; Ariwa, Ezendu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 268 KB

[Communications in Computer and Informat

✍ Balasubramaniam, P.; Uthayakumar, R. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 162 KB

[Communications in Computer and Informat

✍ Chen, Ran 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 365 KB

A Cloud-Based BPM Architecture with User

✍ Yan-Bo Han; Jun-Yi Sun; Gui-Ling Wang; Hou-Fu Li 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 595 KB