Books and Volumes Edited

  • Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola, eds. Proceedings of the Conference on Space Efficient Data Structures, Streams and Algorithm. Lecture Notes in Computer Science, 8066, Springer, 2013.
  • Therese Biedl, Alejandro López-Ortiz eds. Proceedings of the 25th Canadian Conference on Computational Geometry, 2013.
  • Alejandro López-Ortiz ed. Proceedings of the 9th Latin American Theoretical Informatics Symposium . Lecture Notes in Computer Science, 6034. Springer. 2010.
  • Frank Dehne, Alejandro López-Ortiz and Jörg-Rudiger Sack. eds. Proceedings of the 9th Workshop on Algorithms and Data Structures . Lecture Notes in Computer Science, 3608. Springer. 2005.
  • Angèle Hamel and Alejandro López-Ortiz. eds. Proceedings of the first Workshop on Combinatorial and Algorithmic Aspects of Networking . Lecture Notes in Computer Science, 3405. Springer. 2005.
  • Top

    Book Chapters

  • Alejandro López-Ortiz, Ulrich Carsten Meyer and Robert Sedgewick. Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). Dagstuhl Reports 4(2): 129-149, 2014.
  • Reza Dorrigiv and Alejandro López-Ortiz. Closing the gap between theory and practice: New measures for on-line algorithm analysis . In proceedings of the Workshop on Algorithms and Computation (WALCOM), Lecture Notes in Computer Science, 4921. 2008.
  • Alejandro López-Ortiz. Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design . In proceedings of the Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking. Lecture Notes in Computer Science, 4852. Springer. 2007.
  • Alejandro López-Ortiz. Algorithmic Foundations of the Internet . Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking, Lecture Notes in Computer Science, 3405. Springer Verlag. 2005.
  • Alejandro López-Ortiz. Search Engines and Web Information Retrieval . Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking, Lecture Notes in Computer Science, 3405. Springer Verlag. 2005.
  • Top

    Journal Articles

  • Henning Fernau, A. López-Ortiz, and Jazmin Romero. Using Parametric Transformations Towards Polynomial Kernels for Packing Problems Allowing Overlaps. ACM Transactions on Computation Theory, vol. 7, no. 3, 2015.
  • Kirill Kogan, A. López-Ortiz, Sergey Nikolenko and Alexander Sirotkin. Online Scheduling FIFO Policies with Admission and Pushout. To appear in Theory of Computing Systems, 2015.
  • Sushmita Gupta, Shahin Kamali and A. López-Ortiz. On the Advice Complexity of the k-Server Problem under Sparse Metrics. To appear in Theory of Computing Systems, 2015.
  • Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, A. López-Ortiz, and Diego SecoOn Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. In Special Issue on best papers from WAOA 2012. Theory of Computing Systems, vol. 56, n. 1, pp. 220-250, 2015.
  • Reza Dorrigiv, Martin R. Ehmsen and Alejandro López-Ortiz. Parameterized Analysis of Paging and List Update Algorithms. Algorithmica, vol. 71, n. 2, p. 330-353, 2015.
  • Joan Boyar, Shahin Kamali, Alejandro López-Ortiz and Kim S. Larsen. Online Bin Packing with Advice. To appear in Algorithmica, 2015.
  • Alejandro López-Ortiz, Spyros Angelopoulos and Angèle M. Hamel. Optimal Scheduling of Contract Algorithms for Any-time Problems. Journal of Artificial Intelligence Research, vol. 51, 2014, pp. 533-554.
  • Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger and Matthew Skala. The Hausdorff Core on Simple Polygons. Journal of Computational Geometry, vol. 5, no. 1, pp. 14-40, 2014.
  • Spyros Angelopoulos, Alejandro López-Ortiz and Konstantinos Panagiotou. Multi-target Ray Searching Problems. Theoretical Computer Science, Vol. 540, pp. 2-12, 2014.
  • Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, and Diego Seco.On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. To appear in Special Issue on best papers from WAOA 2012. Theory of Computing Systems, 2014.
  • Sushmita Gupta, Shahin Kamali and Alejandro López-Ortiz.On the Advice Complexity of the k-Server Problem under Sparse Metrics. To appear in Theory of Computing Systems, 2014.
  • Alejandro López-Ortiz, Alejandro Salinger and Robert Suderman.Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms. International Journal of Networking and Computing, vol. 4, no. 1, pp. 131-150, 2014.
  • Pedram Ghodsnia, Alejandro López-Ortiz, J. Ian Munro and Kamran Tirdad. COCA Filters: Co-Occurrence Aware Bloom Filters. Special issue of Journal of Discrete Algorithms for best papers from SPIRE 2011, vol.8, pp. 63-74, 2013.
  • Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, and Bradford G. Nickerson. On the Discrete Unit Disk Cover Problem. International Journal on Computational Geometry and Applications, vol. 22, no. 5, pp. 407-419, 2012..
  • Reza Dorrigiv and Alejandro López-Ortiz.List Update with Probabilistic Locality of Reference. Information Processing Letters, vol. 112, pp. 540-543, 2012.
  • Alexander Golynski and Alejandro López-OrtizOptimal Strategies for the List Update Problem Under the MRM Alternative Cost Model. Information Processing Letters, vol 112, pp. 218-222, 2012.
  • Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger and Matthew Skala. Untangled Monotonic Chains and Adaptive Range Search . Theoretical Computer Science, Vol. 412(32). 2011.
    Invited paper from the 20th International Symposium on Algorithms and Computation (ISAAC)
  • Therese Biedl, Masud Hasan and Alejandro López-Ortiz. Efficient View Point Selection for Silhouettes of Convex Polyhedra . Computational Geometry: Theory and Applications, Vol. 44. 2011.
  • Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono and Alejandro López-Ortiz. The Cost of Cache-Oblivious Searching . Algorithmica, Vol. 61(2). 2011.
  • Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz and J. Ian Munro. Sorting with Networks of Data Structures . Discrete Applied Mathematics, Vol. 158(15). 2010.
  • Therese Biedl, Masud Hasan and Alejandro López-Ortiz. Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections . International Journal on Computational Geometry and Applications, Vol. 21(2). 2010.
  • Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson and Alejandro Salinger. An Improved Line-Separable Algorithm for Discrete Unit Disk Cover . Discrete Mathematics, Algorithms and Applications (DMAA), Vol. 2(1). 2010.
  • Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu and Alejandro Salinger. An Experimental Investigation of Set Intersection Algorithms for Text Searching . Journal on Experimental Algorithmics, Vol. 14. 2009.
    Invited paper from the 5th International Workshop on Experimental Algorithms (WEA 2006)
  • Reza Dorrigiv, Alejandro López-Ortiz and J. Ian Munro. On the Relative Dominance of Paging Algorithms . In Theoretical Computer Science, Vol. 410. 2009.
  • Claude-Guy Quimper, Alejandro López-Ortiz and Gilles Pesant. A Quadratic Propagator for the Inter-Distance Constraint . Constraint Programming Letters, Vol. 3. 2008.
    Invited submission to Special Issue of Constraint Programming Letters journal on selected constraint programming papers from AAAI'06
  • Alejandro López-Ortiz, Mahdi Mirzazadeh, Mohammed Ali Safari and Hossein SheikhAttar. Fast String Sorting using Order Preserving Compression . Journal of Experimental Algorithmics, Vol. 10. 2005.
  • Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz and Peter van Beek. An Efficient Bound Consistency Algorithm for the Global Cardinality Constraint Problem . Journal of Constraints. 2005.
    Invited paper to special issue of selected papers from 9th International Conference on Principles and Practice of Constraint Programming (CP'03)
  • Alejandro López-Ortiz and Sven Schuierer. On-line Parallel Heuristics and Robot Searching under the Competitive Framework . Theoretical Computer Science, Vol. 310(1-3). 2004.
  • Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, Srinivas S. Rao and Mohammed Ali Safari. Longest Increasing Subsequences in Sliding Windows . Theoretical Computer Science, Vol. 321. 2004.
  • Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz and Tomas Vinar. Finding Hidden Independent Sets in Interval Graphs . Theoretical Computer Science, Vol. 310(1-3). 2004.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. On Universally Easy Classes for NP-complete Problems . Theoretical Computer Science, Vol. 304(1-3). 2003.
    (Also in SODA'01)
  • Erik D. Demaine and Alejandro López-Ortiz. A Linear Lower Bound on Index Size for Text Retrieval . Journal of Algorithms, Vol. 48(1). 2003.
    Invited paper to special issue of selected papers from the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001
  • Therese Biedl, Timothy Chan and Alejandro López-Ortiz. Drawing K2,n: A Lower Bound . Information Processing Letters, Vol. 85(6). 2003.
    (Also in CCCG'02 conference)
  • Alejandro López-Ortiz and Sven Schuierer. Searching and On-line Recognition of Star Shaped Polygons . Information and Computation, Vol. 185(1). 2003.
  • Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin and J. Ian Munro. Online Routing in Convex Subdivisions . International Journal of Computational Geometry and Applications, Vol. 12(4). 2002.
    Special issue of selected papers from the 11th Annual International Symposium on Algorithms and Computation, (ISAAC 2000).
  • Alejandro López-Ortiz and Sven Schuierer. Lower Bounds for Streets and Generalized Streets . International Journal of Computational Geometry and Applications, Vol. 11(4). 2001.
  • Alejandro López-Ortiz and Sven Schuierer. The Ultimate Strategy to Search on m-Rays? . Theoretical Computer Science, Vol. 261(1). 2001.
    Special issue of selected papers from 4th Annual International Computing and Combinatorics Conference (COCOON'98)
  • Alejandro López-Ortiz and Luke O'Connor. Rounding Cubic Roots and the American Mathematical Monthly . Research note. Miscelánea Matemática, Mexican Mathematical Society. 1999.
  • Alejandro López-Ortiz. Reasoning over Impossible Worlds . Journal of Computing and Information, Vol. 1. 1995.
  • Alejandro López-Ortiz. New Lower Bounds for Element Distinctness on a One-tape Turing Machine . Information Processing Letters, Vol. 51. 1994.
  • Top

    Conference Papers

  • Wojciech M. Golab, Xiaozhou (Steve) Li, A. López-Ortiz, and Naomi Nishimura. Computing Weak Consistency in Polynomial Time. Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (PODC), pp. 395-404, 2015.
  • Shahin Kamali, and A. López-Ortiz. All-Around Near-Optimal Solutions for the Online Bin Packing Problem. To appear in Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC), 2015.
  • A. López-Ortiz, and Daniela Maftuleac. Lower Bounds for Graph Exploration Using Local Policies. To appear in Proceedings of 2015 Workshop on Algorithms and Computation (WALCOM), 2016.
  • A. López-Ortiz and Daniela Maftuleac. Optimal Distributed Searching in the Plane with and without Uncertainty. To appear in Proceedings of 2015 Workshop on Algorithms and Computation (WALCOM), 2016.
  • Martin Derka, A. López-Ortiz, and Daniela Maftuleac. List Colouring and Partial List Colouring of Graphs On-Line. To appear in 26th International Workshop on Combinatorial Algorithms, (IWOCA), 2015.
  • Daniela Maftuleac, Seoung Kyou Lee, Sandor P. Fekete, Aditya Kumar Akash, A. López-Ortiz, and James McLurkin. Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm, Proceedings of International Conference on Robotics and Automation (ICRA), pp. 1809-1815, 2015.
  • A. López-Ortiz, Marc Renault and Adi Rosen. Paid Exchanges are Worth the Price, Proceedings of 32nd Symposium on Theoretical Aspects of Computer Science (STACS), pp. 636-648, 2015.
  • Shahin Kamali, A. López Ortiz and Zahed Rahmati. Online Packing of Equilateral Triangles To appear in 27th Canadian Conference on Computational Geometry (CCCG), 2015.
  • Arash Farzan, A. López-Ortiz, Patrick K. Nicholson, Alejandro Salinger. Algorithms in the Ultra-Wide Word Model Proceedings of Annual Conference on Theory and Applications of Models of Computation (TAMC), pp. 335-346, LNCS 9076, Springer, 2015.
  • Henning Fernau, A. López-Ortiz, and Jazmín Romero. Kernelization Algorithms for Packing Problems Allowing Overlaps Proceedings of Annual Conference on Theory and Applications of Models of Computation (TAMC), pp. 415-427, LNCS 9076, Springer, 2015.
  • Shahin Kamali and Alejandro López-Ortiz. Efficient Online Strategies for Renting Servers in the Cloud . Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science, (SOFSEM), pp. 277-288, 2015.
  • Shahin Kamali and Alejandro López-Ortiz. Better Compression through Better List Update Algorithms. Proceedings of 2014 Data Compression Conference (DCC), pp. 372-381, 2014.
  • Khuzaima Daudjee, Shahin Kamali and Alejandro López-Ortiz. On the Online Fault-Tolerant Server Consolidation Problem. Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 12-21, 2014.
  • Shrinu Kushagra, Alejandro López-Ortiz, J. Ian Munro and Aurick Qiao. Multi-Pivot Quicksort: Theory and Experiments. Proceedings of the 16th Meeting on Algorithm Engineering and Experiments (ALENEX), pp. 47-60, 2014.
  • Joan Boyar, Shahin Kamali, Alejandro López-Ortiz and Kim S. Larsen. Online Bin Packing with Advice. Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), LIPICS, vol. 25, pp. 174-186, 2014.
  • Joan Boyar, Shahin Kamali, Alejandro López-Ortiz and Kim S. Larsen. On the List Update Problem with Advice. Proceedings of the 8th International Conference on Language and Automata Theory and Applications (LATA), LNCS 8370, Springer, pp. 210-221, 2014.
  • Jazmín Romero and Alejandro López-Ortiz. The G-Packing with t-Overlap Problem. Proceedings of 2014 Workshop on Algorithms and Computation (WALCOM), LNCS 8344, Springer, pp.114-124, 2014.
  • Jazmín Romero and Alejandro López-Ortiz.A Parameterized Algorithm for Packing Overlapping Subgraphs. Proceedings of the 9th International Computer Science Symposium in Russia (CSR), pp. 325-336, 2014.
  • Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin.Patrolling a Region with a Structured Swarm of Robots with Limited Individual Capabilities. Proceedings of First Workshop on Robotic Sensor Networks, (RSN), 2014.
  • Shahin Kamali and Alejandro López-Ortiz. Almost Online Square Packing. To appear in Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG), 2014.
  • Kirill Kogan, Alejandro López-Ortiz, Sergey Nikolenko, Gabriel Scalosub and Michael Segal. Balancing Work and Size with Bounded Buffers. Proceedings of the 6th International Conference on Communication Systems and Networks (COMSNETS), pp. 1-8, 2014.
  • Roberto Konow, Gonzalo Navarro, Charles Clarke and Alejandro López-Ortiz. Faster and Smaller inverted indices with Treaps. Proceedings of the 36th Annual ACM SIGIR Conference, (SIGIR), pp. 193-202, 2013.
  • Kirill Kogan, Sergey Nikolenko, Srinivasan Keshav and Alejandro López-Ortiz. Efficient Demand Assignment in Multi-Connected Microgrids with a Shared Central Grid. Proceedings of the 3th IFIP Conference on Sustainable Internet and ICT for Sustainability, (SustainIT), pp. 1-5, 2013.
  • Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro and Patrick K. Nicholson. The Distance 4-Sector of Two Points is Unique. Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), LNCS 8283, Springer, pp. 612-622, 2013.
  • Hossein Vahabi, Margareta Ackerman, David Loker, Ricardo Baeza-Yates and Alejandro López-Ortiz. Orthogonal Query Recommendation. Proceedings of 7th ACM Conference on Recommender Systems, (RecSys), pp. 33-40, 2013.
  • Sushmita Gupta, Shahin Kamali and Alejandro López-Ortiz. On Advice Complexity of the k-server Problem under Sparse Metrics. Proceedings of 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 55-67, 2013.
  • Alejandro López-Ortiz and Alejandro Salinger. On the Sublinear Processor Gap for Parallel Architectures. . Proceedings of 10th annual conference on Theory and Applications of Models of Computation (TAMC), pp. 193-204, 2013.
  • Shahin Kamali, Susana Ladra, Alejandro López-Ortiz and Diego Seco. Context-Based Algorithms for the List-Update Problem under Alternative Cost Models. Proceedings of 2013 Data Compression Conference (DCC), pp. 361-370, 2013.
  • Alejandro López-OrtizAlejandro Salinger and Robert Suderman. Towards a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms. Proceedings of the 15th Workshop on Advances on Parallel and Distributed Processing Symposium (IPDPS Workshop APDCM), pp. 601-610, 2013.
  • Kirill Kogan, Alejandro López-Ortiz, Sergey Nikolenko, and Alexander Sirotkin. Multi-Queued Network Processors for Packets with Heterogeneous Processing Requirements. Proceedings of the Fifth International Conference on Communication Systems and Networks (COMSNETS), pp. 1-10, 2013.
  • Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmin Romero, Alejandro Salinger and Diego Seco. Broadcasting in Conflict-Aware Multi-Channel Networks. Proceedings of the 2013 Workshop on Algorithms and Computation (WALCOM), Lecture Notes in Computer Science, 7748, Springer, pp. 158-169, 2013.
  • Kirill Kogan, Sergey Nikolenko, Srinivasan Keshav and Alejandro López-Ortiz. Efficient Demand Assignment in Multi-Connected Microgrids. Proceedings of the 4th International Conference on Future Energy Systems (ACM e-Energy), pp. 277-278, 2013.
  • Kirill Kogan, Alejandro López-Ortiz, Sergey Nikolenko, and Alexander Sirotkin. A Taxonomy of Semi-FIFO Policies. Proceedings of the 31st IEEE International Performance Computing and Communications Conference (IPCCC), pp. 295-304, 2012.
  • Kirill Kogan, Alejandro López-Ortiz, Sergey Nikolenko, Alexander Sirotkin and Denis Tugaryov. FIFO Queueing Policies for Packets with Heterogeneous Processing. Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), Lecture Notes in Computer Science, 7659, Springer, pp. 248-260, 2012.
  • Alejandro Lôpez-Ortiz and Alejandro Salinger. Minimizing Cache Usage in Paging. Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA), pp. 145-158, 2012.
  • Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, and Diego Seco. On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA), pp. 93-106, 2012.
  • Alejandro López-Ortiz and Alejandro Salinger. Paging for Multi-core Shared Caches. Proceedings of the 3rd ACM Conference on Innovations in Theoretical Computer Science (ITCS), (formerly ICS), pp. 113-127, 2012.
  • Andrew Curtis, Tommy Carpenter, Mustafa Elsheikh, Alejandro López-Ortiz and Srinivasan Keshav. REWIRE: An Optimization-based Framework for Data Center Network Expansion and Upgrade Design. Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM), 2012.
  • Robert Fraser and Alejandro López-Ortiz. The Within-Strip Discrete Unit Disk Cover Problem Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG), pp. 53-58, 2012.
  • Reza Dorrigiv, Alejandro López-Ortiz and Selim Tawfik. Optimal Average Case Strategy for Looking Around a Corner Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG), pp. 277-282, 2012.
  • Pedram Ghodsnia, Alejandro López-Ortiz, J. Ian Munro and Kamran Tirdad. COCA Filters: Co-Occurrence Aware Bloom Filters . Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS 7024, Springer, pp. 313-325, 2011.
  • Spyros Angelopoulos, Alejandro López-Ortiz and Konstantinos Panagiotou. Multi-target Ray Searching Problems . To appear in proceedings of the Algorithms and Data Structures Symposium (WADS). 2011.
  • Reza Dorrigiv and Alejandro López-Ortiz. A New Perspective on List Update: Probabilistic Locality and Working Set . To appear in proceedings of the 9th Workshop on Approximation and Online Algorithm (WAOA). 2011.
  • Claude-Guy Quimper and Alejandro López-Ortiz. A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times . In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs 9. 2011.
  • Gautam Das, Robert Fraser, Alejandro López-Ortiz and Bradford Nickerson. On the Discrete Unit Disk Cover Problem . In Proceedings of the 2011 Workshop on Algorithms and Computation (WALCOM). Lecture Notes in Computer Science, 6552. 2011.
  • Andrew Curtis, Alejandro López-Ortiz and S. Keshav. LEGUP: Using Heterogeneity to Reduce the Cost of Data Center Network Upgrades . In proceedings of ACM CoNEXT 2010 (CoNEXT'10). 2010.
  • Andrew Curtis and Alejandro López-Ortiz. Capacity Provisioning a Valiant Load-Balanced Network . Proceedings of 28th IEEE Conference on Computer and Communications (INFOCOM). 2009.
  • Spyros Angelopoulos and Alejandro López-Ortiz. Interruptible algorithms for Multi-Problem Solving . Proceedings of 21st International Joint Conference on Artificial Intelligence (IJCAI). 2009.
  • Reza Dorrigiv, Alejandro López-Ortiz and J. Ian Munro. Application of Self-Organizing Data Structures to Data Compression . In Proceedings of 8th International Symposium on Experimental Algorithms (SEA), Lecture Notes in Computer Science, 5526. 2009.
  • Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz and Alejandro Salinger. Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm . In Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 5878. 2009.
  • Reza Dorrigiv, Martin R. Ehmsen and Alejandro López-Ortiz. Parameterized Analysis of Paging and List Update Algorithms . In proceedings of 7th Workshop on Approximation and Online Algorithms (WAOA). 2009.
  • Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger and Matthew Skala. Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance . In Proceedings of 11th Algorithms and Data Structures Symposium, (WADS), Lecture Notes in Computer Science, 5564. 2009.
  • Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve and Alejandro López-Ortiz. Online Sorted Range Reporting . In Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 5878. 2009.
  • Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger and Matthew Skala. Untangled Monotonic Chains and Adaptive Range Search . In Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 5878. 2009.
  • Spyros Angelopoulos, Reza Dorrigiv and Alejandro López-Ortiz. List Update with Locality of Reference. In Proceedings of 8th Latin-American Conference on Informatics (LATIN), Lecture Notes in Computer Science, 4957. Springer. 2008.
  • Reza Dorrigiv and Alejandro López-Ortiz. Adaptive Searching in One and Two Dimensions . In proceedings of 20th Canadian Conference on Computational Geometry. 2008.
  • Reza Dorrigiv, Alejandro López-Ortiz and J. Ian Munro. Experimental Evaluation of List Update Algorithms for Data Compression . Proceedings of 2008 Data Compression Conference (DCC), IEEE Computer Society. 2008.
  • Alejandro López-Ortiz, Spyros Angelopoulos and Angèle M. Hamel. Optimal Scheduling of Contract Algorithms with Soft Deadlines . In Proceedings of 23rd Conference on Artificial Intelligence (AAAI-08). 2008.
  • Reza Dorrigiv, Alejandro López-Ortiz and Alejandro Salinger. Optimal Speedup on a Low-Degree Multi-Core Parallel Architectures . In proceedings of 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 2008.
  • Reza Dorrigiv and Alejandro López-Ortiz. On Certain New Models for Paging with Locality of Reference. In Proceedings of the 2008 Workshop on Algorithms and Computation (WALCOM), Lecture Notes in Computer Science, 4921. Springer. 2008.
  • Robert Fraser, Alejandro Salinger, Reza Dorrigiv, Joseph D. Horton and Alejandro López-Ortiz. Defensive Strategies for a Soccer Goalkeeper with a Single Adversary . In Proceeding of 18th Annual Canadian Conference on Intelligent Systems (IS). 2008.
  • Robert Fraser and Alejandro López-Ortiz. Two-dimensional string matching techniques for protein contact maps . Poster presentation in 16th Annual International Conference Intelligent Systems for Molecular Biology (ISMB'08). 2008.
  • Reza Dorrigiv, Alejandro López-Ortiz and Pawel Pralat. Search Algorithms for Unstructured Peer-to-Peer Networks . In Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN). 2007.
  • Masud Hasan, Therese Biedl and Alejandro López-Ortiz. Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections . In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science, 4855, Springer. 2007.
  • Spyros Angelopoulos, Reza Dorrigiv and Alejandro López-Ortiz. On the Separation and Equivalence of Paging Strategies. In Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA'07). 2007.
  • Reza Dorrigiv, Alejandro López-Ortiz and J. Ian Munro. On the Relative Dominance of Paging Algorithms . In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 4835, Springer. 2007.
  • Alejandro López-Ortiz, Spyros Angelopoulos and Angèle M. Hamel. Optimal Scheduling of Contract Algorithms for Any-time Problems . In Proceedings of 21st National Conference on Artificial Intelligence (AAAI'06). 2006.
  • Jérémy Barbay, Alejandro López-Ortiz and Tyler Lu. Faster Adaptive Set Intersections for Text Searching . In Proceedings of 5th International Workshop on Experimental Algorithms (WEA), Lecture Notes in Computer Science 4007, Springer. 2006.
    Also invited paper to special issue of ACM Journal of Experimental Algorithmics (under submission)
  • Claude-Guy Quimper, Alejandro López-Ortiz and Gilles Pesant. A Quadratic Propagator for the Inter-Distance Constraint . In Proceedings of 21st National Conference on Artificial Intelligence (AAAI'06). 2006.
  • Therese Biedl, Joseph D. Horton and Alejandro López-Ortiz. Cross-Stitching Using Little Thread . Proceedings of 17th Canadian Conference on Computational Geometry. 2005.
  • Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz and Tomás Vinar. Sharper Upper and Lower Bounds for an Approximation Scheme for CONSENSUS-PATTERN . Proceedings of 16th Annual Symposium on Combinatorial Pattern Matching, (CPM) Lecture Notes in Computer Science, 3537, Springer. 2005.
  • Alexander Golynski, Alejandro López-Ortiz, Guillaume Poirier and Claude-Guy Quimper. Bandwidth reduction for video-on-demand broadcasting using secondary content insertion . Proceedings of 12th Annual Multimedia Computing and Networking (MMCN'05). 2005.
  • Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek and Alexander Golynski. Improved Algorithms for the Global Cardinality Constraint . In Proceedings of 10th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, 3258, Springer. 2004.
  • Therese Biedl, Masud Hasan and Alejandro López-Ortiz. Efficient View Point Selection for Silhouettes of Convex Polyhedra . Proceedings of 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, 3153, Springer. 2004.
  • Lukasz Golab, David DeHaan, Alejandro López-Ortiz and Erik D. Demaine. Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies . In Proceedings of 16th International Conference on Scientific and Statistical Database Management (SSDBM), IEEE Computer Society. 2004.
  • Joseph D. Horton and Alejandro López-Ortiz. On the Number of Distributed Measurement Points for Network Tomography . Proceedings of ACM Internet Measurements Conference (IMC). 2003.
  • Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Identifying Frequent Items in Sliding Windows over On-Line Packet Streams . Proceedings of ACM Internet Measurements Conference (IMC). 2003.
  • Timothy Chan, Alexander Golynski, Alejandro López-Ortiz and Claude-Guy Quimper. Curves of Minimum Width and the Asteroid Mapping Problem . 12th Annual Video Review of Computational Geometry, Proceedings of 19^th^ Annual ACM Symposium on Computational Geometry (SoCG). 2003.
  • Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski and Samed B. Sadjad. An Efficient Bound Consistency Algorithm for the Global Cardinality Constraint Problem . Proceedings of Constraint Programming (CP), Lecture Notes in Computer Science 2833, Springer-Verlag. 2003.
  • Timothy Chan, Alexander Golynski and Alejandro López-Ortiz. Curves of Width One and the River Shore Problem . Proceedings of Canadian Conference on Computational Geometry. 2003.
  • Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono and Alejandro López-Ortiz. The Cost of Cache-Oblivious Searching . Proceedings of Foundations of Computer Science (FOCS). 2003.
  • Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz and Tomas Vinar. Finding Hidden Independent Sets in Interval Graphs . Proceedings of 9th Annual International Computing and Combinatorics Conference, (COCOON), Lecture Notes in Computer Science 2697, Springer-Verlag. 2003.
  • Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp and Peter van Beek. A Fast and Simple Algorithm for Bounds Consistence of the Alldifferent Constraint . Proceedings of Eighteenth International Joint Conference on Artificial Intelligence (IJCAI). 2003.
  • Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph D. Horton, Alejandro López-Ortiz, Guillaume Poirier and Claude-Guy Quimper. Optimal Dynamic Video-On-Demand using Adaptive Broadcasting . Proceedings of European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2832, Springer-Verlag. 2003.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Robot Localization without Depth Perception . Proceedings of Scandinavian Workshop on Algorithm Theory, (SWAT), Lecture Notes in Computer Science 2368, Springer. 2002.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Frequency Estimation of Internet Packet Streams with Limited Space . In Proceedings of European Symposium on Algorithms (ESA), 2002, Lecture Notes in Computer Science 2461. 2002.
  • Alejandro López-Ortiz and Sven Schuierer. On-line Parallel Heuristics and Robot Searching under the Competitive Framework . Proceedings of Scandinavian Workshop on Algorithm Theory, (SWAT'02), Lecture Notes in Computer Science 2368, Springer. 2002.
  • Therese Biedl, J.D. Horton, Alejandro López-Ortiz, M. Hasan and T. Vinar. Searching for the Centre of a Circle . Proceedings of Canadian Conference on Computational Geometry. 2002.
  • Therese Biedl, Timothy Chan and Alejandro López-Ortiz. Drawing K2,n: A Lower Bound . Proceedings of Canadian Conference on Computational Geometry. 2002.
    (Also in Information Processing Letters)
  • Alejandro López-Ortiz and G. Sweet. Parallel Searching on a Lattice . Proceedings of the 13th Canadian Conference on Computational Geometry. 2001.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Experiments on Adaptive Set Intersections for Text Retrieval Systems . Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments (ALENEX), Lecture Notes in Computer Science, Springer. 2001.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. On Universally Easy Classes for NP-complete Problems . Proceedings of 12th Symposium on Discrete Algorithms (SODA'01). 2001.
    (Also in Theoretical Computer Science)
  • Erik D. Demaine and Alejandro López-Ortiz. A Linear Lower Bound on Index Size for Text Retrieval . Proceedings of 12th Symposium on Discrete Algorithms (SODA'01). 2001.
  • Peter Anderson and Alejandro López-Ortiz. A New Lower Bound for Kernel Searching . Proceedings of 12th Canadian Conference on Computational Geometry. 2000.
  • Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin and J. Ian Munro. Online Routing in Convex Subdivisions . Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science. 2000.
    (Also in International Journal of Computational Geometry and Applications)
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Adaptive Set Intersections, Unions and Differences . Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA'00). 2000.
  • Christoph A. Bröcker and Alejandro López-Ortiz. Position Independent Street Searching . Proceedings of the Workshop on Algorithms and Data Structures (WADS). 1999.
  • Alejandro López-Ortiz and Sven Schuierer. The Ultimate Strategy to Search on m-Rays? . Extended abstract Proceedings of the 4th Annual International Computing and Combinatorics Conference, (COCOON'98), Lecture Notes in Computer Science 1449, Springer-Verlag. 1998.
    (Also in Theoretical Computer Science)
  • Alejandro López-Ortiz and Sven Schuierer. The Exact Cost of Exploring Streets with a CAB Strategy . Proceedings of the 10th Canadian Conference on Computational Geometry. 1998.
  • Alejandro López-Ortiz and Sven Schuierer. Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons . Proceedings of the Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 1272, Springer-Verlag. 1997.
  • Alejandro López-Ortiz and Sven Schuierer. Walking Streets Faster . Proceedings of the 5th Scandinavian Workshop on Algorithms and Theory (SWAT), Lecture Notes in Computer Science 1097, Springer-Verlag. 1996.
  • Alejandro López-Ortiz and Sven Schuierer. Generalized Streets Revisited . Proceedings of the 4th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 1136, Springer-Verlag. 1996.
  • Alejandro López-Ortiz and Daniel Morales-Germán. A Multi-collaborative Push-Caching Scheme for the WWW . Poster Proceedings of the 5th International World Wide Web Conference (approx. 60 talks, and 20 poster presentations). 1996.
  • Alejandro López-Ortiz and Sven Schuierer. Going Home Through an Unknown Street . Proceedings of the 4th Workshop in Algorithms and Data Structures (WADS), in Lecture Notes in Computer Science 955, Springer-Verlag. 1995.
  • Alejandro López-Ortiz and Sven Schuierer. Simple, Efficient and Robust Strategies to Traverse a Street . Proceedings of the 7th Canadian Conference on Computational Geometry. 1995.
  • Top

    Expository Papers

  • Reza Dorrigiv and Alejandro López-Ortiz. On Developing New Models, with Paging as a Case Study . SIGACT News, Vol. 40(4). 2009.
  • Claude-Guy Quimper and Alejandro López-Ortiz. From Linear Relaxations to Global Constraint Propagation . CP. 2005.
  • Reza Dorrigiv and Alejandro López-Ortiz. A Survey of Performance Measures for On-line Algorithms . Invited survey, SIGACT News, Vol. 36(3). 2005.
  • Alejandro López-Ortiz and D. Morales-Germán. Perl: A string processing language (in Spanish) . Soluciones Avanzadas. 1996.
  • Alejandro López-Ortiz and D. Morales-Germán. SGML: What is written on the blank spaces . Soluciones Avanzadas. 1995.
  • Alejandro López-Ortiz. Linear Pattern Matching of Repeated Substrings . SIGACT News, Vol. 25(3). 1994.
  • Alejandro López-Ortiz and D. Morales-Germán. Computer Viruses (in Spanish) . Newsletter of the Mexican Mathematical Society. 1989.
  • Top

    Workshop Publications

  • Masud Hasan, Md. Monoar Hossain, Sabrina Nusrat and Alejandro López-Ortiz. Smallest and Some New Equiprojective Polyhedra . Proceedings of 11th International Conference on Computer and Information Technology. 2008.
  • David DeHaan, Erik D. Demaine, Lukasz Golab, Alejandro López-Ortiz and J. Ian Munro. Frequent Items in Sliding Windows . DIMACS Workshop on Streaming Data Analysis. 2003.
  • Top

    Technical Reports

  • Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac. List Colouring Big Graphs On-Line. CoRR abs/1502.02557, 2015.
  • Henning Fernau, Alejandro López-Ortiz, Jazmin Romero. Kernelization Algorithms for Packing Problems Allowing Overlaps. CoRR abs/1411.6915, 2014.
  • Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinge. Algorithms in the Ultra-Wide Word Model. CoRR abs/1411.7359, 2014.
  • Daniela Maftuleac, Seoung Kyou Lee, Sandor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz and James McLurkin. Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm . CoRR abs 1410.2295, 2014.
  • Alejandro López-Ortiz and Daniela Maftuleac. Optimal Strategies for Search and Rescue Operations with Robot Swarms . CoRR abs 1410.1077, 2014.
  • Shahin Kamali and Alejandro López-Ortiz. Efficient Online Strategies for Renting Servers in the Cloud. CoRR abs 1408.4156, 2014.
  • Shahin Kamali and Alejandro López-Ortiz. An All-around Near ptimal Solution for the Classic Bin Packing Problem. CoRR abs 1404.4526, 2014.
  • Shahin Kamali and Alejandro López-Ortiz. On the List Update Problem with Advice. CoRR abs 1311.7357, 2013.
  • Sushmita Gupta, Shahin Kamali and Alejandro López-Ortiz. On Advice Complexity of the k-server Problem under Sparse Metrics. CoRR abs 1305.2108, 2013.
  • Joan Boyar, Shahin Kamali, Alejandro López-Ortiz and Kim S. Larsen. Online Bin Packing with Advice. CoRR abs 1212.4016, 2012.
  • Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmin Romero, Alejandro Salinger and Diego Seco. Broadcasting in Conflict-Aware Multi-Channel Networks. Technical Report CS-2012-22, School of Computer Science, University of Waterloo, 2012.
  • Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson and Alejandro Salinger. Algorithms in the Ultra-Wide Word Model . Technical Report CS-2012-21, School of Computer Science, University of Waterloo, 2012.
  • Alejandro López-Ortiz and Alejandro Salinger. On the Sublinear Processor Gap for Multi-Core Architectures . Technical Report CS-2012-20, School of Computer Science, University of Waterloo, 2012.
  • Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, and Diego Seco. On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Technical Report CS-2012-14 , School of Computer Science, University of Waterloo, 2012.
  • Alejandro López-Ortiz and Alejandro Salinger. Minimizing Cache Usage in Paging . Technical Report CS-2012-15 , School of Computer Science, University of Waterloo, 2012.
  • Kirill Kogan, Alejandro López-Ortiz, Sergey Nikolenko, Alexander Sirotkin and Denis Tugaryov. FIFO Queueing Policies for Packets with Heterogeneous Processing. CoRR abs 1204.5443, 2012.
  • Kirill Kogan, Alejandro López-Ortiz, Gabriel Scalosub and Michael Segal. Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors. CoRR abs 1202.5755, 2012.
  • Alejandro López-Ortiz and Alejandro Salinger. Paging for Multicore Processors . Technical Report CS-2011-12 , School of Computer Science, University of Waterloo, 2011.
  • Andrew Curtis, Tommy Carpenter, Mustafa Elsheikh, Alejandro López-Ortiz and Srinivasan Keshav. REWIRE: An Optimization-based Framework for Data Center Network Expansion and Upgrade Design. Technical Report CS-2011-21, School of Computer Science, University of Waterloo, 2011.
  • Margareta Ackerman, David Loker, and Alejandro López-Ortiz. Orthogonal Query Expansion CoRR abs 1109.0530, 2011.
  • Spyros Angelopoulos, Alejandro López-Ortiz and Konstantinos Panagiotou. Multi-target Ray Searching Problems . Technical Report CS-2011-07, School of Computer Science, University of Waterloo, 2011.
  • Margareta Ackerman, David Loker, and Alejandro López-Ortiz. Orthogonal Query Expansion Technical Report CS-2011-23, School of Computer Science, University of Waterloo, 2011.
  • Alejandro López-Ortiz and Alejandro Salinger. Paging for Multicore (CMP) Caches . Technical Report CS-2010-15. School of Computer Science, University of Waterloo. 2010.
  • Andrew R. Curtis, S. Keshav and Alejandro López-Ortiz. Reducing Waste in Data Center Network Upgrades . Technical Report, CS-2010-08. School of Computer Science, University of Waterloo. 2010.
  • Andrew Curtis and Alejandro López-Ortiz. Capacity Provisioning of Valiant Load-Balanced Networks . Technical Report, CS-2009-02. School of Computer Science University of Waterloo. 2009.
  • Robert Fraser and Alejandro López-Ortiz. Adaptive two-dimensional string matching for protein contact maps . Technical Report, CS-2008-14. School of Computer Science, University of Waterloo. 2008.
  • Reza Dorrigiv, Alejandro López-Ortiz and J. Ian Munro. Experimental Evaluation of List Update Algorithms for Data Compression . Technical Report, CS-2007-38. School of Computer Science, University of Waterloo. 2007.
  • Reza Dorrigiv and Alejandro López-Ortiz. The Cooperative Ratio of On-line Algorithms . Technical Report, CS-2007-39. School of Computer Science, University of Waterloo. 2007.
  • Spyros Angelopoulos, Reza Dorrigiv and Alejandro López-Ortiz. List Update with Locality of Reference: MTF Outperforms All Other Algorithms . Technical Report, CS-2006-46. School of Computer Science, University of Waterloo. 2006.
  • Robert Warren, Dana Wilkinson and Alejandro López-Ortiz. URL-Enhanced Adaptive Page-Refresh Models . Technical Report, CS-2005-16. School of Computer Science, University of Waterloo. 2005.
  • Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp and Peter van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint problem . Technical Report, CS-2003-05. School of Computer Science, University of Waterloo. 2003.
  • David DeHaan, Erik D. Demaine, Lukasz Golab, Alejandro López-Ortiz and J. Ian Munro. Towards Identifying Frequent Items in Sliding Windows . Technical Report, CS-2003-06. School of Computer Science, University of Waterloo. 2003.
  • Alexander Golynski, Alejandro López-Ortiz and Ray Sweidan. Exploiting Statistics of Web Traces to Improve Caching Algorithms . Technical Report, CS-2003-34. School of Computer Science, University of Waterloo. 2003.
  • Therese Biedl, Brona Brejova, Erik D. Demaine, Angele M. Hamel, Alejandro López-Ortiz and Tomas Vinar. Finding Hidden Independent Sets in Interval Graphs . Technical Report, CS-2001-26. School of Computer Science, University of Waterloo. 2001.
  • J.D. Horton and Alejandro López-Ortiz. High Arity Nodes, Routing and Internet Tomography . Technical Report, TR01-143. Faculty of Computer Science, University of New Brunswick. 2001.
  • Alejandro López-Ortiz. An Omega(n log2n / log log n) lower bound for Algorithm W in a synchronous fail-stop (no restart) PRAM . Research Note. Technical Report TR00-128. Faculty of Computer Science, University of New Brunswick. 2000.
  • Ch. Icking, Alejandro López-Ortiz, Sven Schuierer and I. Semrau. Going Home Through an Unknown Street . Technical Report 228. Department of Computer Science, FernUniversitít Hagen, Germany. 1998.
    (A collection of improvements on [20] and the previous technical report of the same name)
  • Christopher A. Hipke and Alejandro López-Ortiz. Position Independent Street Searching . Technical report TR98-122. Faculty of Computer Science, University of New Brunswick. 1998.
  • Alejandro López-Ortiz and Sven Schuierer. The Exact Cost of Exploring Streets with a CAB . Technical report TR98-119. Faculty of Computer Science University of New Brunswick. 1998.
  • Erik D. Demaine, Alejandro López-Ortiz and J. Ian Munro. Adaptive Set Intersections . Technical Report TR 98-120. Faculty of Computer Science, University of New Brunswick. 1998.
  • Alejandro López-Ortiz and D. Morales-Germá n. Spanish Morphology for Automated Verb Declination . Technical Report CS-96-12. School of Computer Science, University of Waterloo. 1996.
  • Alejandro López-Ortiz. On-line Target Searching on Bounded and Unbounded Domains . Technical Report CS-96-25. School of Computer Science, University of Waterloo. 1996.
  • Alejandro López-Ortiz and Daniel M. German. A Multicollaborative Push-Caching HTTP Protocol for the WWW . Technical Report CS-96-12. School of Computer Science, University of Waterloo. 1996.
  • Alejandro López-Ortiz and Sven Schuierer. Walking Streets Faster . Technical Report CS-95-20. School of Computer Science, University of Waterloo. 1995.
  • Alejandro López-Ortiz and Sven Schuierer. Going Home Through an Unknown Street . Technical Report #445. Department of Computer Science, The University of Western Ontario. 1994.
    (Improved results appear on the paper of the same name in the Refereed Publications section above)
  • Alejandro López-Ortiz. Probabilistic Complexity Classes . Technical Report CS-91-11. School of Computer Science, University of Waterloo. 1991.
    (Also in Research Abstracts, Structures in Complexity Theory (1992))
  • José Luis Abreu, Martha Oliveró, María Garza and Alejandro López-Ortiz. MP Particle Movement . Technical Report #72. Institute of Applied Mathematics and Systems, Universidad Nacional Autónoma de Míxico. 1987.
  • Top