2 citations · 4 across the 8 of their papers we have counts for
4 papers · 1 filter
Batched Predecessor and Sorting with Size-Priced Information in External Memory
Michael A. Bender, Mayank Goswami, Dzejla Mededovic +2
In the unit-cost comparison model, a black box takes an input two items and outputs the result of the comparison. Problems like sorting and searching have been studied in this mode…
On the Convergence of Network Systems
Evangelos Kipouridis, Kostas Tsichlas
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeate…
D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures
Efrosini Sourla, Spyros Sioutas, Kostas Tsichlas +1
In this work, we propose D3-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analy…
I/O-Efficient Dynamic Planar Range Skyline Queries
Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas
We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \textit{3-sided range skyline reporting queries} in $\bigO (\log_{2B^ε} n…