✦ LIBER ✦

On the complexity of distributed stable matching with small messages

✍ Scribed by Alex Kipnis; Boaz Patt-Shamir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the message complexity of distributed

✍ Nicola Santoro 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 736 KB

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

A note on the behaviour of the stable di

✍ Noel Cressie 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 143 KB

On the Convergence of U-Statistics with

✍ L. Heinrich; W. Wolf 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 322 KB

On the invariance of the set of stable m

✍ Ruth Martínez; Jordi Massó; Alejandro Neme; Jorge Oviedo 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 405 KB

On lower bounds for the complexity of di

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB