4 citations · 4 across the 4 of their papers we have counts for
4 papers
On the Hardness of Network Design for Bottleneck Routing Games
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas +1
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess'…
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos +3
This work studies the problem of 2-dimensional searching for the 3-sided range query of the form in both main and external memory, by considering a vari…
Random input helps searching predecessors
D. Belazzougui, A. C. Kaporis, P. G. Spirakis
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only bits of memory, for any constant . The input keys are random wrt a…
Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators
Dimitris Kalles, Alexis Kaporis
In this paper we examine sorting on the assumption that we do not know in advance which way to sort a sequence of numbers and we set at work simple local comparison and swap operat…