Dimitrios Los

Math. Comput. Simul., 2025

2024

An Improved Drift Theorem for Balanced Allocations.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, October, 2024

The Power of Filling in Balanced Allocations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Naively Sorting Evolving Data is Optimal and Robust.

[BibT_eX]

[DOI]

George Giakkoupis

Marcos Kiwi

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Balanced Allocations with the Choice of Noise.

[BibT_eX]

[DOI]

J. ACM, December, 2023

A Brief Summary of PODC 2022.

[BibT_eX]

[DOI]

SIGACT News, March, 2023

Mean-Biased Processes for Balanced Allocations.

[BibT_eX]

[DOI]

CoRR, 2023

Balanced Allocation in Batches: The Tower of Two Choices.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Bounds for Repeated Balls-Into-Bins.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Balanced Allocations in Batches: The Tower of Two Choices.

[BibT_eX]

[DOI]

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

Balanced Allocations with Heterogeneous Bins: The Power of Memory.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Balanced Allocations in Batches: Simplified and Generalized.

[BibT_eX]

[DOI]

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

Brief Announcement: Tight Bounds for Repeated Balls-into-Bins.

[BibT_eX]

[DOI]

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

Balanced Allocations: Caching and Packing, Twinning and Thinning.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Balanced Allocations with Incomplete Information: The Power of Two Queries.

[BibT_eX]

[DOI]