Ruslan Zabrodin

According to our database, Ruslan Zabrodin authored at least 2 papers between 2022 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands.

Harald Räcke, Stefan Schmid, Ruslan Zabrodin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

Approximate Dynamic Balanced Graph Partitioning.

Harald Räcke, Stefan Schmid, Ruslan Zabrodin

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022