Maciej Pacut

According to our database, Maciej Pacut authored at least 22 papers between 2013 and 2024.

Collaborative distances:

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

2024

Dependency-Aware Online Caching.

Julien Dallot, Amirmehdi Jafari Fesharaki, Maciej Pacut, Stefan Schmid

CoRR, 2024

Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions.

Vamsi Addanki, Maciej Pacut, Stefan Schmid

Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024

2023

Self-adjusting grid networks.

Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid

Inf. Comput., June, 2023

RIFO: Pushing the Efficiency of Programmable Packet Schedulers.

Habib Mostafaei, Maciej Pacut, Stefan Schmid

CoRR, 2023

Self-Adjusting Partially Ordered Lists.

Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid, Juan Vanerio

Proceedings of the IEEE INFOCOM 2023, 2023

Online Algorithms with Randomly Infused Advice.

Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion.

Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid

SIGMETRICS Perform. Evaluation Rev., 2022

Brief Announcement: Temporal Locality in Online Algorithms.

Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko

Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021

Self-Adjusting Packet Classification.

Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid

CoRR, 2021

Online List Access with Precedence Constraints.

Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid

CoRR, 2021

Locality in Online Algorithms.

Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko

CoRR, 2021

Optimal Online Balanced Graph Partitioning.

Maciej Pacut, Mahmoud Parham, Stefan Schmid

Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020

Dynamic Balanced Graph Partitioning.

Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid

SIAM J. Discret. Math., 2020

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning.

Maciej Pacut, Mahmoud Parham, Stefan Schmid

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

An Optimal Algorithm for Online Multiple Knapsack.

Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures.

Klaus-Tycho Foerster, Maciej Pacut, Stefan Schmid

Comput. Commun. Rev., 2019

2017

Data locality and replica aware virtual cluster embeddings.

Carlo Fuerst, Maciej Pacut, Stefan Schmid

Theor. Comput. Sci., 2017

Online Tree Caching.

Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

Online Balanced Repartitioning.

Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Hardness of Virtual Network Embedding with Replica Selection.

Carlo Fuerst, Maciej Pacut, Stefan Schmid

CoRR, 2015

How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings.

Carlo Fuerst, Maciej Pacut, Paolo Costa, Stefan Schmid

Proceedings of the 23rd IEEE International Conference on Network Protocols, 2015

2013

Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem.

Mieczyslaw Wodecki, Wojciech Bozejko, Michal Karpinski, Maciej Pacut

Proceedings of the Parallel Processing and Applied Mathematics, 2013