Ruslan Zabrodin

Orcid: 0000-0002-7021-7163

According to our database1, Ruslan Zabrodin authored at least 3 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model.
CoRR, 2024

2023
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

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


  Loading...