activity
20102018
most citedOn Advice Complexity of the k-server Problem under Sparse Metrics

11 citations · 20 across the 14 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

cs.DS2014★ 1 cited

Algorithms in the Ultra-Wide Word Model

Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson +1

The effective use of parallel computing resources to speed up algorithms in current multi-core parallel architectures remains a difficult challenge, with ease of programming playin…

cs.RO2014

Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm

Daniela Maftuleac, Seoung Kyou Lee, Sandor P. Fekete +3

We present and analyze methods for patrolling an environment with a distributed swarm of robots. Our approach uses a physical data structure - a distributed triangulation of the wo…

cs.RO2014

Optimal Distributed Searching in the Plane with and without Uncertainty

Alejandro Lopez-Ortiz, Daniela Maftuleac

We consider the problem of multiple agents or robots searching for a target in the plane. This is motivated by Search and Rescue operations (SAR) in the high seas which in the past…

cs.DS2014

Efficient Online Strategies for Renting Servers in the Cloud

Shahin Kamali, Alejandro López-Ortiz

In Cloud systems, we often deal with jobs that arrive and depart in an online manner. Upon its arrival, a job should be assigned to a server. Each job has a size which defines the…

cs.DS2014★ 1 cited

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem

Shahin Kamali, Alejandro López-Ortiz

In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing. It has long be…