scispace - formally typeset
A

Alejandro López-Ortiz

Researcher at University of Waterloo

Publications -  198
Citations -  3856

Alejandro López-Ortiz is an academic researcher from University of Waterloo. The author has contributed to research in topics: Competitive analysis & List update problem. The author has an hindex of 33, co-authored 193 publications receiving 3719 citations. Previous affiliations of Alejandro López-Ortiz include Open Text Corporation & University of New Brunswick.

Papers
More filters
Journal ArticleDOI

The impact of processing order on performance: A taxonomy of semi-FIFO policies

TL;DR: This work builds a taxonomy of Semi-FIFO policies and provides worst case guarantees for different processing orders and performs a comprehensive simulation study that validates the results.
Posted Content

Optimal Distributed Searching in the Plane with and without Uncertainty

TL;DR: An optimal strategy for searching with k robots starting from a common origin and moving at unit speed is developed and applied to more realistic scenarios such as differential search speeds, late arrival times to the search effort and low probability of detection under poor visibility conditions.
Book ChapterDOI

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting

TL;DR: This work shows that an adaptive form of pyramid broadcasting is optimal for both measures of resource consumption and performance simultaneously, up to constant factors, and shows that the maximum throughput for a fixed network bandwidth cannot be obtained by any online strategy.
Journal ArticleDOI

Effect of the synthesis method on the MnCo2O4 towards the photocatalytic production of H2

TL;DR: In this paper , manganese cobaltite spinel (MnCo2O4) spinel was synthetized by Pechini and hydrothermal method, characterized and evaluated toward H2 production through water splitting under visible-light irradiation.
Journal ArticleDOI

Sorting with networks of data structures

TL;DR: This paper studies the question of which are the smallest general graphs that can sort an arbitrary permutation and what is their efficiency, and shows that certain two-node graphs can sort in time @Q(n^2) and no simpler graph can sort all permutations.