activity
20242026
collaborators

6 papers

cs.DS2026

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms

Ofek Gila, Michael T. Goodrich, Vinesh Sridhar

While modern general-purpose computing systems have ample amounts of memory, it is still the case that embedded computer systems, such as in a refrigerator, are memory limited; hen…

cs.CG2025

The Rectilinear Marco Polo Problem

Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh +2

We study the rectilinear Marco Polo problem, which generalizes the Euclidean version of the Marco Polo problem for performing geometric localization to rectilinear search environme…

cs.DS2025

Fast Geographic Routing in Fixed-Growth Graphs

Ofek Gila, Michael T. Goodrich, Abraham M. Illickan +1

In the 1960s, the social scientist Stanley Milgram performed his famous "small-world" experiments where he found that people in the US who are far apart geographically are neverthe…

cs.DS2025

Zip-Tries: Simple Dynamic Data Structures for Strings

David Eppstein, Ofek Gila, Michael T. Goodrich +1

In this paper, we introduce zip-tries, which are simple, dynamic, memory-efficient data structures for strings. Zip-tries support search and update operations for -length string…

cs.CG2025

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization

Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh +2

We introduce and study the Marco Polo problem, which is a combinatorial approach to geometric localization. In this problem, we are told there are one or more points of interest (P…

cs.DS2024

Highway Preferential Attachment Models for Geographic Routing

Ofek Gila, Evrim Ozel, Michael T. Goodrich

In the 1960s, the world-renowned social psychologist Stanley Milgram conducted experiments that showed that not only do there exist ``short chains'' of acquaintances between any tw…