27 citations · 69 across the 12 of their papers we have counts for
15 papers
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization
Esther M. Arkin, Rathish Das, Jie Gao +4
Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are conside…
Data Inference from Encrypted Databases: A Multi-dimensional Order-Preserving Matching Approach
Yanjun Pan, Alon Efrat, Ming Li +5
Due to increasing concerns of data privacy, databases are being encrypted before they are stored on an untrusted server. To enable search operations on the encrypted data, searchab…
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The Musketeers
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian +8
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precise…
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
Rathish Das, Shih-Yu Tsai, Sharmila Duppala +5
A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to n…
Network Optimization on Partitioned Pairs of Points
Esther M. Arkin, Aritra Banik, Paz Carmi +5
Given pairs of points, , in some metric space, we study the problem of two-coloring the points within each pa…
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
Esther M. Arkin, Antonio Fernandez Anta, Joseph S. B. Mitchell +1
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of…