We introduce the idea of local searching in a bounded universe in order to unify these two types of structures. Consider a query x into the dictionary and let p ...

Given a bounded universe {0, 1,...,U−1}, we show how to perform (successor) searches in O(log log ∆) expected time and updates in O(loglog∆) expected ...

Given a bounded universe { 0, 1, U - 1 }, we show how to perform predecessor searches in O ( log log Δ ) expected time, where Δ is the difference between ...

No information is available for this page. · Learn why

Here, we show how to obtain a data structure with similar guarantees for the query and update times that reduces the space requirement to O(n). This solves an ...

A dynamic data structure for predecessor searching in U that needs time for queries and expected time for updates, where \(\varDelta \) is the difference ...

Fast local searches and updates in bounded universes ... Ottawa, Kanada : Canadian Conference on Computational Geometry (2010) 280 p. ... pp. 261-264. , 4 p.

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.

Jul 5, 2017 · Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space ... Fast local searches and updates in bounded universes. Comput. Geom ...

Apr 5, 2017 · Fast local searches and updates in bounded universes. Comput. Geom. Theory. Appl., 46(2):181–189, 2013. [3] T. H. Cormen, C. E. Leiserson ...