- Fast String Sorting using Order Preserving Compression
- Cross-Stitching Using Little Thread Therese Biedl y Joseph D. Horton z Alex Lopez-Ortiz y
- Improved Algorithms for the Global Cardinality Claude-Guy Quimper, Alejandro L opez-Ortiz, Peter van Beek, and
- Searching and On-line Recognition of Star-Shaped Polygons
- Rounding Cubic Roots and the Monthly Alejandro L'opezOrtiz 1 , Luke O'Connor 2
- Online Target Searching in Bounded and Unbounded Domains
- Drawing K 2;n : A Lower Bound Therese Biedl y Timothy M. Chan y Alejandro L opez-Ortiz y
- Finding Hidden Independent Sets in Interval Graphs Therese Biedl 1 , Brona Brejova 1 , Erik D. Demaine 2 , Angele M. Hamel 3 , Alejandro LopezOrtiz 1 ,
- Algorithmic Foundations of the Internet Alejandro Lopez-Ortiz
- On-line Parallel Heuristics, Processor Scheduling and Robot Searching under the Competitive Framework
- An E#cient Bounds Consistency Algorithm for the Global Cardinality Constraint
- Curves of Bounded Width and the Asteroid Surveying Problem Timothy Chan # Alexander Golynski # Alejandro LopezOrtiz #
- PositionIndependent Near Optimal Searching and Online Recognition in Star Polygons ?
- Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies
- Reasoning and Knowledge over Impossible Worlds
- Fast String Sorting using Order Preserving Compression
- Simple, Efficient and Robust Strategies to Traverse Streets \Lambda Alejandro L'opezOrtiz y Sven Schuierer z
- Longest Increasing Subsequences in Sliding Michael H. Albert 1 , Alexander Golynski 2 , Ang ele M. Hamel 3 , Alejandro
- Probabilistic Complexity Classes 1 Alejandro L'opezOrtiz
- Going Home Through an Unknown Street Christian Icking
- A fast and simple algorithm for bounds consistency of the alldi erent constraint
- On-line Parallel Heuristics and Robot Searching under the Competitive Framework ?
- Faster Adaptive Set Intersections for Text Searching
- Ecient View Point Selection for Silhouettes of Convex Polyhedra ?
- Optimal Scheduling of Contract Algorithms for Anytime Problems Alejandro Lopez-Ortiz
- Going Home Through an Unknown Street \Lambda Alejandro L'opezOrtiz y Sven Schuierer z
- Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
- On Universally Easy Classes for NP-complete Problems Erik D. Demaine Alejandro L opez-Ortiz y J. Ian Munro
- A Quadratic Propagator for the Inter-Distance Constraint Claude-Guy Quimper
- Bandwidth Reduction for Video-on-Demand Broadcasting Using Secondary Content Insertion
- The Exact Cost of Exploring Streets with a CAB Extended Abstract
- The Cost of Cache-Oblivious Searching Michael A. Bender y Gerth St lting Brodal zx Rolf Fagerberg z Dongdong Ge
- A Survey of Performance Measures for On-line Reza Dorrigiv Alejandro L opez-Ortiz
- Walking Streets Faster Alejandro L opez-Ortiz y Sven Schuierer z
- An E#cient Bounds Consistency Algorithm for the Global Cardinality Constraint
- The Ultimate Strategy to Search on m Rays? Alejandro L opez-Ortiz y Sven Schuierer z
- Generalized Streets Revisited \Lambda Alejandro L'opezOrtiz Sven Schuierer
- Identifying Frequent Items in Sliding Windows over OnLine Packet Streams
- On the Separation and Equivalence of Paging Strategies Spyros Angelopoulos
- On the Number of Distributed Measurement Points for Network Tomography
- n= log log n) lower bound for Algorithm W in a synchronous fail-stop (no
- PositionIndependent Street Searching Christoph A. Brocker 1 and Alejandro L'opezOrtiz 2
- Lower Bounds for Streets and Generalized Streets Alejandro L opez-Ortiz y Sven Schuierer z
- On the Number of Distributed Measurement Points for Network Tomography
- New Lower Bounds for Element Distinctness on a Onetape Turing Machine
- Going Home Through an Unknown Street \Lambda Alejandro L'opezOrtiz y Sven Schuierer z
- Redondeando Ra'ices C'ubicas Alejandro L'opezOrtiz
- Parallel Searching on a Lattice Alejandro L opez-Ortiz
- Algorithmic Foundations of the Internet Alejandro L opez-Ortiz
