# Alejandro López-Ortiz

According to our database1, Alejandro López-Ortiz
• authored at least 190 papers between 1994 and 2017.
• has a "Dijkstra number"2 of three.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2017
Inverted Treaps.
ACM Trans. Inf. Syst., 2017

The within-strip discrete unit disk cover problem.
Theor. Comput. Sci., 2017

Optimal scheduling of contract algorithms with soft deadlines.
J. Scheduling, 2017

Multi-processor Search and Scheduling Problems with Setup Cost.
Theory Comput. Syst., 2017

Lower Bounds for Graph Exploration Using Local Policies.
J. Graph Algorithms Appl., 2017

The impact of processing order on performance: A taxonomy of semi-FIFO policies.
J. Comput. Syst. Sci., 2017

On the list update problem with advice.
Inf. Comput., 2017

2016
Analyzing Cache Behaviour in Multicore Architectures.
Encyclopedia of Algorithms, 2016

Alternative Performance Measures in Online Algorithms.
Encyclopedia of Algorithms, 2016

Intersections of Inverted Lists.
Encyclopedia of Algorithms, 2016

Online Scheduling FIFO Policies with Admission and Push-Out.
Theory Comput. Syst., 2016

On the Advice Complexity of the k-server Problem Under Sparse Metrics.
Theory Comput. Syst., 2016

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors.
J. Network and Computer Applications, 2016

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101).
Dagstuhl Reports, 2016

Arbitrary Overlap Constraints in Graph Packing Problems.
CoRR, 2016

Recognition of Triangulation Duals of Simple Polygons With and Without Holes.
CoRR, 2016

Lower Bounds for Graph Exploration Using Local Policies.
CoRR, 2016

Algorithmica, 2016

Optimal Distributed Searching in the Plane with and Without Uncertainty.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Lower Bounds for Graph Exploration Using Local Policies.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Recognition of Triangulation Duals of Simple Polygons With and Without Holes.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.
TOCT, 2015

On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods.
Theory Comput. Syst., 2015

List Colouring Big Graphs On-Line.
CoRR, 2015

Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG).
Comput. Geom., 2015

Parameterized Analysis of Paging and List Update Algorithms.
Algorithmica, 2015

Kernelization Algorithms for Packing Problems Allowing Overlaps.
Proceedings of the Theory and Applications of Models of Computation, 2015

Algorithms in the Ultra-Wide Word Model.
Proceedings of the Theory and Applications of Models of Computation, 2015

Paid Exchanges are Worth the Price.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Efficient Online Strategies for Renting Servers in the Cloud.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Computing Weak Consistency in Polynomial Time: [Extended Abstract].
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

List Colouring and Partial List Colouring of Graphs On-line.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

All-Around Near-Optimal Solutions for the Online Bin Packing Problem.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Local policies for efficiently patrolling a triangulated region by a robot swarm.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Online Packing of Equilateral Triangles.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Multi-target ray searching problems.
Theor. Comput. Sci., 2014

The Hausdorff Core Problem on Simple Polygons.
JoCG, 2014

Parameterized Algorithms for the H-Packing with t-Overlap Problem.
J. Graph Algorithms Appl., 2014

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.
J. Artif. Intell. Res., 2014

Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms.
IJNC, 2014

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091).
Dagstuhl Reports, 2014

Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm.
CoRR, 2014

Optimal Strategies for Search and Rescue Operations with Robot Swarms.
CoRR, 2014

Efficient Online Strategies for Renting Servers in the Cloud.
CoRR, 2014

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem.
CoRR, 2014

Kernelization Algorithms for Packing Problems Allowing Overlaps.
CoRR, 2014

Algorithms in the Ultra-Wide Word Model.
CoRR, 2014

The ${\mathcal{G}}$ -Packing with t-Overlap Problem.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

On the online fault-tolerant server consolidation problem.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

On the List Update Problem with Advice.
Proceedings of the Language and Automata Theory and Applications, 2014

Better Compression through Better List Update Algorithms.
Proceedings of the Data Compression Conference, 2014

A Parameterized Algorithm for Packing Overlapping Subgraphs.
Proceedings of the Computer Science - Theory and Applications, 2014

Balancing work and size with bounded buffers.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

Almost Online Square Packing.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Multi-Pivot Quicksort: Theory and Experiments.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
A novel approach for leveraging co-occurrence to improve the false positive error in signature files.
J. Discrete Algorithms, 2013

On Advice Complexity of the k-server Problem under Sparse Metrics
CoRR, 2013

On the List Update Problem with Advice.
CoRR, 2013

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On the Sublinear Processor Gap for Parallel Architectures.
Proceedings of the Theory and Applications of Models of Computation, 2013

On Advice Complexity of the k-server Problem under Sparse Metrics.
Proceedings of the Structural Information and Communication Complexity, 2013

Faster and smaller inverted indices with treaps.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

Orthogonal query recommendation.
Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

The Distance 4-Sector of Two Points Is Unique.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Efficient demand assignment in multi-connected microgrids with a shared central grid.
Proceedings of the Sustainable Internet and ICT for Sustainability, 2013

Efficient demand assignment in multi-connected microgrids.
Proceedings of the Fourth International Conference on Future Energy Systems, 2013

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models.
Proceedings of the 2013 Data Compression Conference, 2013

Multi-queued network processors for packets with heterogeneous processing requirements.
Proceedings of the Fifth International Conference on Communication Systems and Networks, 2013

A Survey of Algorithms and Models for List Update.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Optimal strategies for the list update problem under the MRM alternative cost model.
Inf. Process. Lett., 2012

List update with probabilistic locality of reference.
Inf. Process. Lett., 2012

On the discrete Unit Disk Cover Problem.
Int. J. Comput. Geometry Appl., 2012

CoRR, 2012

FIFO Queueing Policies for Packets with Heterogeneous Processing
CoRR, 2012

Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors
CoRR, 2012

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
Algorithmica, 2012

Minimizing Cache Usage in Paging.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

FIFO Queueing Policies for Packets with Heterogeneous Processing.
Proceedings of the Design and Analysis of Algorithms, 2012

A taxonomy of Semi-FIFO policies.
Proceedings of the 31st IEEE International Performance Computing and Communications Conference, 2012

Paging for multi-core shared caches.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

REWIRE: An optimization-based framework for unstructured data center network design.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Optimal Average Case Strategy for Looking Around a Corner.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

The Within-Strip Discrete Unit Disk Cover Problem.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Untangled monotonic chains and adaptive range search.
Theor. Comput. Sci., 2011

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections.
Int. J. Comput. Geometry Appl., 2011

Orthogonal Query Expansion
CoRR, 2011

Efficient view point selection for silhouettes of convex polyhedra.
Comput. Geom., 2011

The Cost of Cache-Oblivious Searching.
Algorithmica, 2011

A New Perspective on List Update: Probabilistic Locality and Working Set.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

On the Discrete Unit Disk Cover Problem.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Multi-target Ray Searching Problems.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

COCA Filters: Co-occurrence Aware Bloom Filters.
Proceedings of the String Processing and Information Retrieval, 2011

Brief announcement: paging for multicore processors.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.
Discrete Math., Alg. and Appl., 2010

Sorting with networks of data structures.
Discrete Applied Mathematics, 2010

Some New Equiprojective Polyhedra
CoRR, 2010

LEGUP: using heterogeneity to reduce the cost of data center network upgrades.
Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology, 2010

2009
On the relative dominance of paging algorithms.
Theor. Comput. Sci., 2009

On Developing New Models, with Paging as a Case Study.
SIGACT News, 2009

An experimental investigation of set intersection algorithms for text searching.
ACM Journal of Experimental Algorithmics, 2009

An Application of Self-organizing Data Structures to Compression.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Parameterized Analysis of Paging and List Update Algorithms.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Efficient Algorithms for Context Query Evaluation over a Tagged Corpus.
Proceedings of the 2009 International Conference of the Chilean Computer Science Society, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Online Sorted Range Reporting.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Untangled Monotonic Chains and Adaptive Range Search.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Capacity Provisioning a Valiant Load-Balanced Network.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Interruptible Algorithms for Multi-Problem Solving.
Proceedings of the IJCAI 2009, 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

2008
On Certain New Models for Paging with Locality of Reference.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM).
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

List Update with Locality of Reference.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

List Update Algorithms for Data Compression.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM).
Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

Adaptive Searching in One and Two Dimensions.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Optimal Scheduling of Contract Algorithms with Soft Deadlines.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
On the separation and equivalence of paging strategies.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Search Algorithms for Unstructured Peer-to-Peer Networks.
Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

On the Relative Dominance of Paging Algorithms.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Valiant Load Balancing, Benes Networks and Resilient Backbone Design.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
Foreword.
ACM Trans. Algorithms, 2006

Faster Adaptive Set Intersections for Text Searching.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

06421 Abstracts Collection -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

06421 Executive Summary -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

A Quadratic Propagator for the Inter-Distance Constraint.
Proceedings of the Proceedings, 2006

Optimal Scheduling of Contract Algorithms for Anytime Problems.
Proceedings of the Proceedings, 2006

2005
Algorithmic foundations of the internet.
SIGACT News, 2005

A Survey of Performance Measures for On-line Algorithms
SIGACT News, 2005

Fast string sorting using order-preserving compression.
ACM Journal of Experimental Algorithmics, 2005

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Constraints, 2005

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

From Linear Relaxations to Global Constraint Propagation.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.
Theor. Comput. Sci., 2004

Finding hidden independent sets in interval graphs.
Theor. Comput. Sci., 2004

Longest increasing subsequences in sliding windows.
Theor. Comput. Sci., 2004

Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Efficient View Point Selection for Silhouettes of Convex Polyhedra.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Improved Algorithms for the Global Cardinality Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Algorithmic Foundations of the Internet: Roundup.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Search Engines and Web Information Retrieval.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Algorithmic Foundations of the Internet: Foreword.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
On universally easy classes for NP-complete problems.
Theor. Comput. Sci., 2003

A linear lower bound on index size for text retrieval.
J. Algorithms, 2003

Drawing K2, n: A lower bound.
Inf. Process. Lett., 2003

Searching and on-line recognition of star-shaped polygons.
Inf. Comput., 2003

On the number of distributed measurement points for network tomography.
Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Identifying frequent items in sliding windows over on-line packet streams.
Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint.
Proceedings of the IJCAI-03, 2003

The Cost of Cache-Oblivious Searching.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Proceedings of the Algorithms, 2003

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2003

the asteroid surveying problem and other puzzles.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Finding Hidden Independent Sets in Interval Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Curves of width one and the river shore problem.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2002

Online Parallel Heuristics and Robot Searching under the Competitive Framework.
Proceedings of the Algorithm Theory, 2002

Robot Localization without Depth Perception.
Proceedings of the Algorithm Theory, 2002

Frequency Estimation of Internet Packet Streams with Limited Space.
Proceedings of the Algorithms, 2002

Searching for the center of a circle.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Drawing k2, n: A lower bound.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
The ultimate strategy to search on m rays?
Theor. Comput. Sci., 2001

Lower Bounds for Streets and Generalized Streets.
Int. J. Comput. Geometry Appl., 2001

On universally easy classes for NP-complete problems.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A linear lower bound on index size for text retrieval.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Parallel searching on a lattice.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Experiments on Adaptive Set Intersections for Text Retrieval Systems.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Adaptive set intersections, unions, and differences.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Online Routing in Convex Subdivisions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

A New Lower Bound for Kernel Searching.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Position-Independent Street Searching.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
The Ultimate Strategy to Search on m Rays?
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

The exact cost of exploring streets with a cab.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Walking Streets Faster.
Proceedings of the Algorithm Theory, 1996

Generalized Streets Revisited.
Proceedings of the Algorithms, 1996

1995
Going Home Through an Unknown Street.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Linear pattern matching of repeated substrings.
SIGACT News, 1994

New Lower Bounds for Element Distinctness on a On-Tape Turing Machine.
Inf. Process. Lett., 1994