[ACM Press the sixteenth annual ACM symposium - Barcelona, Spain (2004.06.27-2004.06.30)] Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04 - Balanced graph partitioning

[ACM Press the sixteenth annual ACM symp

✍ Andreev, Konstantin; Räcke, Harald 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 127 KB

In this paper we consider the problem of (k, ν)-balanced graph partitioning -dividing the vertices of a graph into k almost equal size components (each of size less than ν • n k ) so that the capacity of edges between different components is minimized. This problem is a natural generalization of sev

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Cambridge, Massachusetts, USA (2006.07.30-2006.08.02)] Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 - Reconfigurable resource scheduling

✍ Plaxton, C. Greg; Sun, Yu; Tiwari, Mitul; Vin, Harrick 📂 Article 📅 2006 🏛 ACM Press 🌐 English ⚖ 242 KB

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Cambridge, Massachusetts, USA (2006.07.30-2006.08.02)] Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 - Reconfigurable resource scheduling

✍ Plaxton, C. Greg; Sun, Yu; Tiwari, Mitul; Vin, Harrick 📂 Article 📅 2006 🏛 ACM Press 🌐 English ⚖ 242 KB

We consider a class of scheduling problems that we refer to as reconfigurable resource scheduling. This class of problems is motivated by emerging applications that involve dynamically allocating a large number of shared resources to a variety of services. We design efficient online algorithms for c

[ACM Press the sixth annual ACM symposiu

[ACM Press the sixth annual ACM symposium - Cape May, New Jersey, United States (1994.06.27-1994.06.29)] Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94 - A comparison of parallel algorithms for connected components

✍ Greiner, John 📂 Article 📅 1994 🏛 ACM Press ⚖ 860 KB

[ACM Press the thirty-sixth annual ACM s

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB

[ACM Press the thirty-sixth annual ACM s

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB

[ACM Press the sixteenth annual ACM symposium - Barcelona, Spain (2004.06.27-2004.06.30)] Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04 - Balanced graph partitioning

✦ Synopsis