activity
20102018
most citedOn Advice Complexity of the k-server Problem under Sparse Metrics

11 citations · 20 across the 14 of their papers we have counts for

collaborators
Showing cs.NIShow all

2 papers · 1 filter

cs.NI2012★ 2 cited

FIFO Queueing Policies for Packets with Heterogeneous Processing

Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko +2

We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can…

cs.NI2012★ 1 cited

Balancing Work and Size with Bounded Buffers

Kirill Kogan, Alejandro Lopez-Ortiz, Sergey I. Nikolenko +2

We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processi…