3 papers
cs.DS2021
Self-Adjusting Packet Classification
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper is motivated by the vision of more efficient packet classification mechanisms that self-optimize in a demand-aware manner. At the heart of our approach lies a self-adjus…
cs.DS2021
Online List Access with Precedence Constraints
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper considers a natural generalization of the online list access problem in the paid exchange model, where additionally there can be precedence constraints ("dependencies")…
cs.DS2020
An Optimal Algorithm for Online Multiple Knapsack
Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch
In the online multiple knapsack problem, an algorithm faces a stream of items, and each item has to be either rejected or stored irrevocably in one of bins (knapsacks) of equal…