Maciej Pacut

Orcid: 0000-0002-6379-1490

According to our database1, Maciej Pacut authored at least 28 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Online Graph Embedding in Star Graphs.
CoRR, May, 2026

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items.
CoRR, April, 2026

Online Algorithms with Unreliable Guidance.
CoRR, February, 2026

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems (Invited Talk).
Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks, 2026

2025
RIFO: Pushing the Efficiency of Programmable Packet Schedulers.
IEEE Trans. Netw., 2025

2024
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions.
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024

Dependency-Aware Online Caching.
Proceedings of the IEEE INFOCOM 2024, 2024

Learning Minimum Linear Arrangement of Cliques and Lines.
Proceedings of the 44th IEEE International Conference on Distributed Computing Systems, 2024

2023
Self-adjusting grid networks.
Inf. Comput., June, 2023

Self-Adjusting Partially Ordered Lists.
Proceedings of the IEEE INFOCOM 2023, 2023

Online Algorithms with Randomly Infused Advice.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion.
SIGMETRICS Perform. Evaluation Rev., 2022

Brief Announcement: Temporal Locality in Online Algorithms.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021
Self-Adjusting Packet Classification.
CoRR, 2021

Online List Access with Precedence Constraints.
CoRR, 2021

Locality in Online Algorithms.
CoRR, 2021

Optimal Online Balanced Graph Partitioning.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020
Dynamic Balanced Graph Partitioning.
SIAM J. Discret. Math., 2020

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

An Optimal Algorithm for Online Multiple Knapsack.
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.
Comput. Commun. Rev., 2019

2017
Data locality and replica aware virtual cluster embeddings.
Theor. Comput. Sci., 2017

Online Tree Caching.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Online Balanced Repartitioning.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
Hardness of Virtual Network Embedding with Replica Selection.
CoRR, 2015

How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings.
Proceedings of the 23rd IEEE International Conference on Network Protocols, 2015

2013
Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem.
Proceedings of the Parallel Processing and Applied Mathematics, 2013


  Loading...