TCS Journal 2024 Journal Article
Advice complexity of adaptive priority algorithms
- Joan Boyar
- Kim S. Larsen
- Denis Pankratov
Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
TCS Journal 2024 Journal Article
ICML Conference 2023 Conference Paper
Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms. Previous work on learning-augmented paging has investigated predictions on (i) when the current page will be requested again (reoccurrence predictions), (ii) the current state of the cache in an optimal algorithm (state predictions), (iii) all requests until the current page gets requested again, and (iv) the relative order in which pages are requested. We study learning-augmented paging from the new perspective of requiring the least possible amount of predicted information. More specifically, the predictions obtained alongside each page request are limited to one bit only. We develop algorithms satisfy all three desirable properties of learning-augmented algorithms – that is, they are consistent, robust and smooth – despite being limited to a one-bit prediction per request. We also present lower bounds establishing that our algorithms are essentially best possible.
ECAI Conference 2016 Conference Paper
Flight routes are paths calculated on a network of waypoints representing 3D-coordinates. A common approach is first to calculate a path in a 2D-network, taking into account feasibility constraints, and then to optimize the altitude of the flight.
TCS Journal 2015 Journal Article
TCS Journal 2015 Journal Article
TCS Journal 2014 Journal Article
TCS Journal 2014 Journal Article
TCS Journal 2013 Journal Article
TCS Journal 2010 Journal Article
TCS Journal 2006 Journal Article
SODA Conference 2005 Conference Paper