Follow
Maciej Pacut
Maciej Pacut
Verified email at inet.tu-berlin.de - Homepage
Title
Cited by
Cited by
Year
Online balanced repartitioning
C Avin, A Loukas, M Pacut, S Schmid
International Symposium on Distributed Computing, 243-256, 2016
312016
On the complexity of non-segregated routing in reconfigurable data center architectures
KT Foerster, M Pacut, S Schmid
ACM SIGCOMM Computer Communication Review 49 (2), 2-8, 2019
292019
Dynamic balanced graph partitioning
C Avin, M Bienkowski, A Loukas, M Pacut, S Schmid
SIAM Journal on Discrete Mathematics 34 (3), 1791-1812, 2020
222020
Online tree caching
M Bienkowski, J Marcinkowski, M Pacut, S Schmid, A Spyra
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
142017
Optimal online balanced graph partitioning
M Pacut, M Parham, S Schmid
IEEE INFOCOM 2021-IEEE Conference on Computer Communications, 1-9, 2021
92021
How hard can it be?: Understanding the complexity of replica aware virtual cluster embeddings
C Fuerst, M Pacut, P Costa, S Schmid
2015 IEEE 23rd International Conference on Network Protocols (ICNP), 11-21, 2015
82015
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion
M Pacut, W Dai, A Labbe, KT Foerster, S Schmid
ACM SIGMETRICS Performance Evaluation Review 49 (3), 35-36, 2022
72022
Brief announcement: Deterministic lower bound for dynamic balanced graph partitioning
M Pacut, M Parham, S Schmid
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
62020
Data locality and replica aware virtual cluster embeddings
C Fuerst, M Pacut, S Schmid
Theoretical Computer Science 697, 37-57, 2017
52017
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions
V Addanki, M Pacut, S Schmid
arXiv preprint arXiv:2401.02801, 2024
42024
Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem
M Wodecki, W Bożejko, M Karpiński, M Pacut
International Conference on Parallel Processing and Applied Mathematics, 207-214, 2013
42013
Online algorithms with randomly infused advice
Y Emek, Y Gil, M Pacut, S Schmid
arXiv preprint arXiv:2302.05366, 2023
32023
Self-adjusting partially ordered lists
V Addanki, M Pacut, A Pourdamghani, G Rétvári, S Schmid, J Vanerio
IEEE INFOCOM 2023-IEEE Conference on Computer Communications, 1-10, 2023
22023
An optimal algorithm for online multiple knapsack
M Bienkowski, M Pacut, K Piecuch
ICALP 2020, 13:1-13:17, 2020
22020
RIFO: Pushing the Efficiency of Programmable Packet Schedulers
H Mostafaei, M Pacut, S Schmid
arXiv preprint arXiv:2308.07442, 2023
12023
Self-adjusting grid networks
C Avin, I van Duijn, M Pacut, S Schmid
Information and Computation 292, 105038, 2023
12023
Brief Announcement: Temporal Locality in Online Algorithms
M Pacut, M Parham, J Rybicki, S Schmid, J Suomela, A Tereshchenko
International Symposium on Distributed Computing, 52, 2022
12022
Locality in Online Algorithms
M Pacut, M Parham, J Rybicki, S Schmid, J Suomela, A Tereshchenko
CoRR abs/2102.09413, 2021
12021
Learning Minimum Linear Arrangement of Cliques and Lines
J Dallot, M Pacut, M Bienkowski, D Melnyk, S Schmid
arXiv preprint arXiv:2405.15963, 2024
2024
Dependency-Aware Online Caching
J Dallot, AJ Fesharaki, M Pacut, S Schmid
arXiv preprint arXiv:2401.17146, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20