[ACM Press the twenty-sixth annual ACM symposium - Portland, Oregon, USA (2007.08.12-2007.08.15)] Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07 - DoS-resilient secure aggregation queries in sensor networks

[ACM Press the twenty-sixth annual ACM s

[ACM Press the twenty-sixth annual ACM symposium - Portland, Oregon, USA (2007.08.12-2007.08.15)] Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07 - Toward an optimal social network defense against Sybil attacks

✍ Yu, Haifeng; Gibbons, Phillip B.; Kaminsky, Michael 📂 Article 📅 2007 🏛 ACM Press ⚖ 296 KB

[ACM Press the twenty-sixth annual ACM s

[ACM Press the twenty-sixth annual ACM symposium - Portland, Oregon, USA (2007.08.12-2007.08.15)] Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07 - Toward an optimal social network defense against Sybil attacks

✍ Yu, Haifeng; Gibbons, Phillip B.; Kaminsky, Michael 📂 Article 📅 2007 🏛 ACM Press ⚖ 296 KB

[ACM Press the twenty-fifth annual ACM s

[ACM Press the twenty-fifth annual ACM symposium - Denver, Colorado, USA (2006.07.23-2006.07.26)] Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06 - On the complexity of distributed graph coloring

✍ Kuhn, Fabian; Wattenhofer, Roger 📂 Article 📅 2006 🏛 ACM Press ⚖ 193 KB

[ACM Press the twenty-fifth annual ACM s

[ACM Press the twenty-fifth annual ACM symposium - Denver, Colorado, USA (2006.07.23-2006.07.26)] Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06 - On the complexity of distributed graph coloring

✍ Kuhn, Fabian; Wattenhofer, Roger 📂 Article 📅 2006 🏛 ACM Press ⚖ 193 KB

Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a distributed setting. Processors of a distributed system are nodes of an undirected graph G. There is an edge between two no

[ACM Press the twenty-third annual ACM s

[ACM Press the twenty-third annual ACM symposium - St. John's, Newfoundland, Canada (2004.07.25-2004.07.28)] Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04 - Selfish caching in distributed systems

✍ Chun, Byung-Gon; Chaudhuri, Kamalika; Wee, Hoeteck; Barreno, Marco; Papadimitrio 📂 Article 📅 2004 🏛 ACM Press ⚖ 307 KB

[ACM Press the twenty-third annual ACM s

[ACM Press the twenty-third annual ACM symposium - St. John's, Newfoundland, Canada (2004.07.25-2004.07.28)] Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04 - Specification faithfulness in networks with rational nodes

✍ Shneidman, Jeffrey; Parkes, David C. 📂 Article 📅 2004 🏛 ACM Press ⚖ 239 KB