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
An improved line-separable algorithm for discrete unit disk cover
Francisco Claude,Gautam K. Das,Reza Dorrigiv,Stephane Durocher,Robert Fraser,Alejandro López-Ortiz,Bradford G. Nickerson,Alejandro Salinger +7 more
TL;DR: This work considers the line-separable discrete unit disk cover problem (the set of disk centers can be separated from the set of points by a line) and presents an O(n(log n + m) time algorithm that finds an exact solution.
Journal ArticleDOI
Longest increasing subsequences in sliding windows
Michael H. Albert,Alexander Golynski,Angèle M. Hamel,Alejandro López-Ortiz,S. Srinivasa Rao,MohammadAli Safari +5 more
TL;DR: An output-sensitive data structure is proposed that solves the problem of finding the longest increasing subsequence in a sliding window over a given sequence in time O(n log log n+OUTPUT) for a sequence of n elements.
Journal ArticleDOI
On the relative dominance of paging algorithms
TL;DR: This paper gives a finer separation of several known paging algorithms using a new technique called relative interval analysis, and shows that look-ahead is beneficial for a paging algorithm.
Book ChapterDOI
List update with locality of reference
TL;DR: It is proved that Move-to-Front (MTF) is the unique optimal algorithm for list update and an open problem of Martinez and Roura is resolved, namely proposing a measure which can successfully separate MTF from all other list-update algorithms.
Book ChapterDOI
Generalized Streets Revisited
TL;DR: This work considers the problem of a robot inside an unknown polygon that has to find a path from a starting point s to a target point t and assumes that it is equipped with an on-board vision system through which it can get the visibility map of its surroundings.