A. C. Kaporis

activity

20082012

most citedRandom input helps searching predecessors

4 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2012

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 $[a, b] \times (- \infty, c]$ in both main and external memory, by considering a vari…

cs.DS2011★ 4 cited

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 $n^{1 + δ}$ bits of memory, for any constant $δ > 0$ . The input keys are random wrt a…