Computer Science Papers
Books and Volumes
Edited
- Proceedings
of the Workshop on Combinatorial and Algorithmic Aspects of Networking, Angele Hamel and A. López-Ortiz,
eds. Lecture Notes in Computer Science, 3405, Springer, 2005.
- Proceedings
of the 9th Workshop on Algorithms and Data Structures, eds. Frank Dehne, A. López-Ortiz
and Joerg-Rudiger Sack, Lecture Notes in Computer Science, 3608, Springer,
2005
Book Chapters
- Overprovisioning
or Rightprovisioning?.
A López-Ortiz. In proceedings of the Fourth
Workshop on Combinatorial and Algorithmic Aspects of Networking.
Lecture Notes in Computer Science, 4852, Springer, 2007.
- Closing the gap
between theory and practice: New measures for on-line algorithm analysis, Reza Dorrigiv and A. López-Ortiz. In proceedings of the 2008
Workshop on Algorithms and Computation (WALCOM), Lecture Notes in
Computer Science, 4921, 2008.
- Algorithmic
Foundations of the Internet. A. López-Ortiz. Proceedings of the Workshop on
Combinatorial and Algorithmic Aspects of Networking, Angele Hamel and
A. López-Ortiz, eds. Lecture Notes in Computer Science, 3405, Springer
Verlag, 2005.
- Search
Engines and Web Information Retrieval. Proceedings of the
Workshop on Combinatorial and Algorithmic Aspects of Networking, Angele Hamel and A. López-Ortiz, eds. Lecture Notes in
Computer Science, 3405, Springer Verlag, 2005.
Journal Articles
7. 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 and Alejandro Salinger. In Discrete
Mathematics, Algorithms and Applications (DMAA), to appear.
8. A Quadratic Propagator
for the Inter-Distance Constraint, Claude-Guy
Quimper, A. López-Ortiz, Gilles Pesant. Invited submission to Special Issue of Constraint
Programming Letters journal on selected constraint programming papers from AAAI
06, to appear.
- An
Efficient Bounds Consistency Algorithm for the Global Cardinality
Constraint. Claude-Guy Quimper, Alexander Golynski, A.
López-Ortiz, and Peter van Beek. To appear in Journal of Constraints, vol.
10, issue 2, 2005. Special issue of selected papers from the 9th
International Conference on Principles and Practice of Constraint Programming
(CP 2003).
- Fast
String Sorting in the word RAM model using Order Preserving Compression. A.
López-Ortiz, M. Mirzazadeh, M.A. Safari and H. SheikhAttar. Journal of
Experimental Algorithmics, v. 10, 2005.
- Longest
Increasing Subsequences in Sliding Windows. M.H.
Albert, A. Golynski, A.M. Hamel, A. López-Ortiz S. S. Rao and M.A.
Safari. Theoretical Computer Science, vol. 321, pp. 405-414, 2004.
- A Linear Lower
Bound on Index Size for Text Retrieval. Erik D. Demaine and A.
López-Ortiz. Journal of Algorithms, Vol. 48, no. 1, pp. 2-15, 2003.
Special issue of selected papers from the 12th Annual ACM-SIAM Symposium
on Discrete Algorithms (SODA 2001).
- On-line
parallel heuristics, processor scheduling and robot searching under the
competitive framework. A. López-Ortiz and Sven
Schuierer. Theoretical Computer Science, vol. 310, no.1-3, pp.
527-537, 2004.
- Finding
Hidden Independent Sets in Interval Graphs. Therese
Biedl, Bro?a Brejova, Erik D. Demaine, Angele M. Hamel, A. López-Ortiz and
Tomas Vina?. Theoretical Computer Science, vol. 310, no.1-3, pp.
287-307, 2004.
- Drawing K_{2,n}:
A Lower Bound. Therese Biedl, Timothy Chan, A. López-Ortiz. To
appear in Information Processing Letters, v. 85, n. 6, pp. 303-305,
2003.
- On Universally
Easy Classes for NP-complete Problems. Erik D. Demaine, A.
López-Ortiz and J. Ian Munro. Theoretical Computer Science, vol.
304, no 1-3, pp. 471-476, 2003
- Searching and
On-line Recognition of Star Shaped Polygons. A. López-Ortiz and
Sven Schuierer. Information and Computation, vol. 185, no. 1, pp.
66-88, 2003.
- Online Routing
in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Svante
Carlsson, Erik D. Demaine, Rudolf Fleischer, A. López-Ortiz, Pat Morin,
and J. Ian Munro. International Journal of Computational Geometry and
Applications, v. 12, n. 4, August 2002, pp. 283-295. Special issue of
selected papers from the 11th Annual International Symposium on Algorithms
and Computation, (ISAAC 2000).
- Lower Bounds for
Searching in Streets and Generalized Streets. A.
López-Ortiz and Sven Schuierer. International Journal of Computational
Geometry and Applications, v. 11, n.4, pp 401-421, 2001.
- The Ultimate
Strategy to Search on m-Rays? A. López-Ortiz and Sven
Schuierer. Theoretical Computer Science, v.261, n.1, pp. 267-295,
2001. Special issue of selected papers from the 4th Computing and
Combinatorics Conference, (COCOON 1998).
- Rounding Cubic
Roots and the Monthly. A. López-Ortiz and Luke O'Connor.
Research note. Miscelanea Matematica, Mexican Mathematical Society,
1999.
- New Lower Bounds
for Element Distinctness on a One-tape Turing Machine.
A. López-Ortiz. Information Processing Letters. 51 (1994) 311-314.
- Reasoning over
Impossible Worlds, A. López-Ortiz. Journal of Computing and
Information Vol 1, 1995. Also in International Conference on Computing
and Informatics, ICCI, 1994
Conference Papers
23. Optimal Scheduling of Contract Algorithms with Soft
Deadlines,
A. López-Ortiz, Spyros Angelopoulos and Angele Hamel. To appear in proceedings
of 23rd Conference on Artificial Intelligence (AAAI-08).
24. Optimal Speedup on a Low-Degree Multi-Core
Parallel,
Reza Dorrigiv, A. López-Ortiz, and Alejandro Salinger. To appear in Proceedings
of 20th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2008.
25. List Update with Locality of Reference,
Spyros Angelopoulos, Reza Dorrigiv, and A. López-Ortiz.In proceedings of 8th
Latin-American Conference on Informatics (LATIN), Lecture Notes in Computer
Science, 4957, Springer, pp. 399-410, 2008.
26. Experimental Evaluation of List Update
Algorithms for Data Compression, Reza Dorrigiv, A. López-Ortiz and J.
Ian Munro. To appear in Proceedings of 2008 Data Compression Conference,
IEEE Computer Society, 2008.
27. On Certain New Models for Paging with
Locality of Reference, Reza Dorrigiv and A. López-Ortiz. In
proceedings of the 2008 Workshop on Algorithms and Computation (WALCOM), Lecture
Notes in Computer Science, 4921, Springer, pp. 200-209, 2008.
28. On the Relative Dominance of Paging
Algorithms,
Reza Dorrigiv, A. López-Ortiz, J. Ian Munro. In proceedings of the 18th
International Symposium on Algorithms and Computation (ISAAC), Lecture
Notes in Computer Science, Springer, 4835, pp. 488-499, 2007.
29. Reconstructing convex polygons and
polyhedra from edge and face counts in orthogonal projections,
Masud Hasan, Therese Biedl and A. López-Ortiz. In proceedings of the IARCS
Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS), Lecture Notes in Computer Science, 4855,
Springer, pp 400-411, 2007.
30. Search Algorithms for Unstructured
Peer-to-Peer Networks, Reza Dorrigiv, A. López-Ortiz, Pawel
Pralat. In proceedings of the 32nd Annual IEEE Conference on Local Computer Networks
(LCN), pp. 343-352, 2007.
- On the
Separation and Equivalence of Paging Strategies, Spyros
Angelopoulos, Reza Dorrigiv, and A. López-Ortiz. To appear in Proceedings
of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA),
2007.
- Optimal
Scheduling of Contract Algorithms for Any-time Problems.
A. López-Ortiz, Spyros Angelopoulos and Angele Hamel. Proceedings of
21st National Conference on Artificial Intelligence
(AAAI-06).
- A Quadratic
Propagator for the Inter-Distance Constraint, Claude-Guy
Quimper, A. López-Ortiz, Gilles Pesant. Proceedings of 21st
National Conference on Artificial Intelligence (AAAI-06).
- Faster Adaptive
Set Intersections for Text Searching. Jeremy
Barbay, A. López-Ortiz, Tyler Lu. Proceedings of 5th
International Workshop on Experimental Algorithms (WEA), Lecture Notes
in Computer Science 4007, Springer, pp. 146-157, 2006.
- Cross-Stitching
Using Little Thread. Therese Biedl, Joseph D. Horton, A.
López-Ortiz. Proceedings of 16th Canadian Conference on
Computational Geometry, 2005.
- Bandwidth
reduction for video-on-demand broadcasting using secondary content
insertion. Claude-Guy Quimper, A. López-Ortiz and Alexander
Golynski. In Proceedings of 12th Annual Multimedia
Computing and Networking (MMCN '05), 2005. pp. 167-175.
- Sharper Upper and Lower Bounds
for an Approximation Scheme for CONSENSUS-PATTERN. Bro?a
Brejova, Daniel G. Brown, Ian M. Harrower, A. López-Ortiz, Toma Vina?.
Proceedings of 16th Annual Symposium on Combinatorial
Pattern Matching, (CPM), 2005. Lecture Notes in Computer Science,
3537, Springer, pp. 1-10, 2005.
- Improved
Algorithms for the Global Cardinality Constraint, Claude-Guy Quimper, A. López-Ortiz,
Peter van Beek, and Alexander Golynski. In Proceedings of 10th
International Conference on Principles and Practice of Constraint
Programming (CP), Lecture Notes in Computer Science, 3258, Springer,
2004.
- Efficient
View Point Selection for Silhouettes of Convex Polyhedra.
Therese Biedl, Masud Hasan, A. López-Ortiz. 29th
International Symposium on Mathematical Foundations of Computer Science
(MFCS), Lecture Notes in Computer Science, 3153, Springer, pp.
735-747, 2004.
- Finding Frequent
Items in Sliding Windows with Multinomially-Distributed Item Frequencies,
Lukasz Golab, David DeHaan, A. López-Ortiz and Erik Demaine. In
Proceedings of 16th International Conference on Scientific and
Statistical Database Management (SSDBM), IEEE Computer Society, pp.
425-426, 2004.
- The
Cost of Cache-Oblivious Searching, Michael A. Bender, Gerth
Stoelting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John
Iacono and Alejandro López-Ortiz. In Proceedings of Foundations of
Computer Science (FOCS), pp. 271-282, 2003.
- On the
Number of Distributed Measurement Points for Network Tomography,
Joseph D. Horton, A. López-Ortiz. In Proceedings of ACM Internet
Measurements Conference (IMC), pp. 204-209, 2003.
- Identifying
Frequent Items in Sliding Windows over On-Line Packet Streams,
Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, and J.
Ian Munro. In Proceedings of ACM Internet Measurements Conference (IMC),
pp. 173-178, 2003.
- Optimal Dynamic
Video-On-Demand using Adaptive Broadcasting, Therese Biedl,
Erik D. Demaine, Alexander Golynski, Joseph D. Horton, A. López-Ortiz.
Guillaume Poirier and Claude-Guy Quimper. In Proceedings of European
Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2832,
Springer-Verlag, pp. 90-101, 2003.
- An
Efficient Bound Consistency Algorithm for the Global Cardinality
Constraint Problem.
Claude-Guy. Quimper, Peter van Beek, A. López-Ortiz, Alexander Golynski,
and Samed B. Sadjad. In Proceedings of 9th International
Conference on Principles and Practice of Constraint Programming (CP),
Lecture Notes in Computer Science 2833, Springer-Verlag, pp. 600-614,
2003.
- A Fast and
Simple Algorithm for Bounds Consistence of the Alldifferent Constraint.
A. López-Ortiz, Claude-Guy Quimper, John Tromp and Peter van Beek. In
Proceedings of 18th International Joint Conference on
Artificial Intelligence (IJCAI), pp. 245-250, 2003.
- Curves of Width
One and the River Shore Problem. Timothy Chan, Alexander
Golynski and A. López-Ortiz. To appear in Proceedings of Canadian
Conference on Computational Geometry, 2003.
- Finding
Hidden Independent Sets in Interval Graphs. Therese
Biedl, Bro?a Brejova, Erik D. Demaine, Angele M. Hamel, A. López-Ortiz and
Tomas Vina?. In Proceedings of 9th Annual International Computing and
Combinatorics Conference, (COCOON), Lecture Notes in Computer Science
2697, Springer-Verlag, pp. 182-191, 2003.
- Frequent
Items in Sliding Windows. David DeHaan,
Lukasz Golab, Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. DIMACS
Workshop on Streaming Data Analysis. DIMACS Center, Rutgers University, March 24 - 26, 2003.
- Curves of
Minimum Width and the Asteroid Mapping Problem. Timothy Chan,
Alexander Golynski and A. López-Ortiz. In Proceedings of 12th
Annual Video Review of Computational Geometry, in Proceedings of the 19th
Annual ACM Symposium on Computational Geometry (SoCG), 2003.
- Frequency
Estimation of Internet Packet Streams with Limited Space. Erik
D. Demaine, J. Ian Munro and A. López-Ortiz. In Proceedings of European
Symposium on Algorithms, 2002.
- Drawing K_{2,n}:
A Lower Bound. Therese Biedl, Timothy Chan, A. López-Ortiz. In
Proceedings of Canadian Conference on Computational Geometry, 2002.
- Searching for
the Centre of a Circle. Therese Biedl, Joseph D. Horton, A.
López-Ortiz, Masud Hasad, Tomas Vinar. In Proceedings of Canadian
Conference on Computational Geometry, 2002.
- Robot
Localization without Depth Perception. Erik D. Demaine, J. Ian
Munro and A. López-Ortiz. In Proceedings of Scandinavian Workshop on
Algorithm Theory, (SWAT), 2002.
- On-line Parallel
Heuristics and Robot Searching under the Competitive Framework.
A. López-Ortiz and Sven Schuierer. In Proceedings of Scandinavian
Workshop on Algorithm Theory, (SWAT), 2002.
- A Linear Lower
Bound on Index Size for Text Retrieval. Erik D. Demaine and A.
López-Ortiz. Proceedings of 12th Symposium on Discrete Algorithms
(SODA 2001), Washington, DC, 2001. Invited to special issue of Journal of
Algorithms on selected papers from SODA.
- On
Universally Easy Classes for NP-complete Problems. Erik D.
Demaine, A. López-Ortiz and J. Ian Munro. Proceedings of 12th Symposium
on Discrete Algorithms (SODA 2001).
- Experiments on
Adaptive Set Intersections for Text Retrieval Systems. Erik D.
Demaine, A. López-Ortiz and J. I. Munro. Proceedings of the 3rd Workshop
on Algorithm Engineering and Experiments (ALENEX), Lecture Notes in
Computer Science, Washington, DC, 2001.
- Parallel
Searching on a Lattice. A. López-Ortiz and G. Sweet.
Proceedings of the 13th Canadian Conference on Computational Geometry,
(CCCG), pp.125-128, 2001.
- Online Routing
in Convex Subdivisions. P. Bose, A. Brodnik, S. Carlsson, Erik
D. Demaine, R. Fleischer, A. López-Ortiz, P. Morin, and J. I. Munro.
Proceedings of the 11th Annual International Symposium on Algorithms
and Computation (ISAAC 2000), Lecture Notes in Computer Science, Taipei, Taiwan, December 18-20, 2000.
- A New Lower
Bound for Kernel Searching.
P. Anderson, A. López-Ortiz. Proceedings of 12th Canadian
Conference on Computational Geometry, 2000.
- Adaptive Set
Intersections, Unions, and Differences. Erik D. Demaine, A.
López-Ortiz, and J. Ian Munro. Proc. of Eleventh ACM-SIAM Symposium on
Discrete Algorithms, SODA 2000.
- Position
Independent Street Searching. C.A. Hipke, and A López-Ortiz. Workshop
on Algorithms and Data Structures, 1999.
- The Exact Cost
of Exploring Streets with a CAB. A. López-Ortiz and S.
Schuierer. Proceedings of 10th Canadian Conference on Computational
Geometry, 1998.
- The Ultimate
Strategy to Search on m-Rays? A. López-Ortiz and S. Schuierer.
In Proceedings of the 4th Computing and Combinatorics Conference,
(COCOON), 1998.
- Position-Independent
Near Optimal Searching and On-line Recognition in Star Polygons.
A. López-Ortiz and S. Schuierer. Workshop on Algorithms and Data
Structures. 1997.
- Position-Independent
Near Optimal Searching and On-line Recognition in Star Polygons.
ACM Symosium. on Computational Geometry 1997.
- Generalized
Streets Revisited . A. López-Ortiz and S. Schuierer. Proceedings
of the European Symposium on Algorithms (ESA), 1996. Lecture Notes in
Computer Science 1136. Springer-Verlag.
- Walking Streets
Faster. A. López-Ortiz and S. Schuierer. Proceedings of the
Scandinavian Workshop on Algorithms and Theory (SWAT), 1996. Lecture
Notes in Computer Science 1097. Springer-Verlag.
- A
Multicollaborative Push-Caching HTTP Protocol for the WWW, A.
López-Ortiz and Daniel M. German. Poster presentation World Wide Web
Conference (WWW 5), 1996.
- Going Home
Through an Unknown Street. Alex López-Ortiz and Sven Schuierer.
Proceedings of Fourth Workshop on Algorithms and Data Structures,
WADS '95. Lecture Notes in Computer Science, 955, Springer-Verlag, 1995.
- Simple,
Efficient and Robust Strategies to Traverse Streets. Alex
López-Ortiz and Sven Schuierer. Extended Abstract in Proceedings of Seventh
Canadian Conference on Computational Geometry, CCCG '95.
Expository Papers
- A Survey of
Performance Measures for On-line Algorithms. Reza
Dorrigiv and A. López-Ortiz. Invited survey, SIGACT News, Vol.
36, No. 3, September 2005.
- Algorithmic
Foundations of the Internet. A. López-Ortiz. Invited survey, SIGACT
News, Vol. 36, No. 2, June 2005.
- From Linear
Relaxations to Global Constraint Propagation. Claude-Guy
Quimper, A. López-Ortiz. CP 2005: 867.
- Linear Pattern
Matching of Repeated Substrings. A. López-Ortiz. SIGACT News.
Vol. 25, No. 3, September 1994.
- Frequently Asked
Questions about Theoretical Computer Science. A. López-Ortiz. news://comp.theory,
1998.
- Perl:
A string processing language. A. López-Ortiz and D. M. German. Soluciones
Avanzadas, November, 1996.
- SGML: Lo que esta escrito en los espacios en blanco. Daniel M. German and Alex López-Ortiz. Soluciones Avanzadas,
December, 1995.
- Computadoras y Viruses. Daniel M. German, Alejandro López-Ortiz. Newsletter
of the Mexican Mathematical Society, 1989.
- Computer Chess:
Past to Present UW Imprint, 1993.
Serial contributions to the
monthly column Weaving the Net written jointly with Daniel M. German and
Claudia Iturriaga-- for Soluciones Avanzadas, an Information
Technologies and Business Strategy trade journal (ISSN 0188-8048):
82. Internet por la Oficina Empieza A. López-Ortiz and Daniel M. German. January 1996.
83. Es la red lo suficientemente segura? A. López-Ortiz and Daniel M. German. February 1996.
84. Criptografma
de Llave Publica A. López-Ortiz and Daniel M.
German. March 1996.
85. SET:
La Tarjeta de Credito Electrsnica A. López-Ortiz and
Daniel M. German. April 1996.
86. El
Factor Humano A. López-Ortiz and Daniel M. German. May 1996.
87. Instalando
un Servidor de Web A. López-Ortiz and Daniel M.
German. May 1996.
88. Java:
Promesa o Realidad? A. López-Ortiz and Daniel M.
German. June 1996.
89. Conexiones
a Web con Cache A. López-Ortiz and
Daniel M. German. July 1996.
90. Poniendo
la crema sobre la z A. López-Ortiz and
Daniel M. German. August 1996.
91. La
extra, la extra A. López-Ortiz and Daniel M.
German. September 1996.
92. Censura
o Moderacisn en la Internet A. López-Ortiz and
Claudia Iturriaga. November 1996.
93. Apocalipsis
Informatico A. López-Ortiz and Claudia Iturriaga. December
1996.
Technical
Reports
94. List
Update with Locality of Reference: MTF Outperforms All Other Algorithms. Spyros Angelopoulos, Reza Dorrigiv, and
Alejandro Lopez-Ortiz. Technical Report, CS-2006-46, School of Computer Science, University of Waterloo, 2006.
95. 74. URL-Enhanced Adaptive
Page-Refresh Models. Robert Warren, Dana Wilkinson,
Alejandro López-Ortiz. Technical Report, CS-2005-16, School of Computer Science, University of Waterloo, 2005.
96. Finding
Frequent Items in Sliding Windows with Multinomially-Distributed Item
Frequencies. Lukasz Golab, David DeHaan, Alejandro Lopez-Ortiz, and
Erik D. Demaine, Technical Report, CS-2004-06, School of Computer
Science, University of Waterloo, (updated version of CS-2003-06), 2004.
97. An
Efficient Bound Consistency Algorithm for the Global Cardinality Constraint
Problem. Claude-Guy Quimper, Peter van Beek, A.
López-Ortiz, Alexander Golynski, and Samed B. Sadjad. Technical Report, CS-2003-10,
School of Computer Science, University of Waterloo, 2003.
98. Exploiting
Statistics of Web Traces to Improve Caching Algorithms. Alexander Golynski, A. López-Ortiz and Ray Sweidan. Technical
Report, CS-2003-34, School of Computer Science, University of Waterloo, 2003.
99. Faster
Practical Algorithms for the All-diff Constraint Satisfaction Problem. A.
López-Ortiz, C.G. Quimper, J. Tromp and P. van Beek. Technical Report,
CS-2003-05, School of Computer Science, University of Waterloo, 2003.
100. Finding
Hidden Independent Sets in Interval Graphs. T.Biedl, B. Brejova, E.D.
Demaine, A.M. Hamel, A. López-Ortiz and T. Vinar. Technical report
CS-2001-26, Department of Computer Science, University of Waterloo, December 2001.
101. Frequent
Items in Sliding Windows. David DeHaan, Erik D. Demaine,
Lukasz Golab, Alejandro López-Ortiz, and J. Ian Munro. Technical
Report, CS-2003-06, School of Computer Science, University of Waterloo, 2003.
102. High
Arity Nodes, Routing and Internet Tomography. J.D. Horton
and A. López-Ortiz. Technical Report, TR01-143, Faculty of Computer
Science, University of New Brunswick, July 2001.
103. Frequency
Estimation of Internet Packet Streams with Limited Space. E. Demaine,
A. López-Ortiz, and J. I. Munro. Massachusetts Institute of Technology, August
2002.
104. An Omega(n log^2 n/log
log n) lower bound for Algorithm W in a synchronous fail-stop (no restart)
PRAM. A. López-Ortiz. Research Note. Technical report
TR00-128, Faculty of Computer Science, University of New Brunswick, 2000.
105. Position
Independent Street Searching. C.A. Hipke, and A López-Ortiz. Technical
report TR98-122, Faculty of Computer Science, University of New Brunswick, 1998.
106. Adaptive
Set Intersections. E. Demaine,
A. López-Ortiz, and J. Ian Munro. Technical report TR98-120, Faculty of
Computer Science, University of New Brunswick, 1998.
107. Going Home Through
an Unknown Street. Christian Icking, Alejandro López-Ortiz,
Sven Schuierer, Ines Semrau. Technical Report 228, Department of
Computer Science, FernUniversitdt Hagen, Germany, 1998. (A collection of
results from the previous technical report of the same name, together with
improvements by the other authors)
108. The
Exact Cost of Exploring Streets with a CAB. A. López-Ortiz and S.
Schuierer. Technical report TR98-119, Faculty of Computer Science, University of New Brunswick, 1998.
109. The
Ultimate Strategy to Search on m-Rays? A. López-Ortiz and S. Schuierer. Technical
report TR98-118, Faculty of Computer Science, University of New Brunswick, 1998.
110. On Line Target
Searching in Bounded and Unbounded Domains, A.
López-Ortiz. Technical Report CS-96-25, Dept of Computer Science,
University of Waterloo, 1996.
111. A
Multicollaborative Push-Caching HTTP Protocol for the WWW, A.
López-Ortiz and Daniel M. German. Technical Report CS-96-12, Dept. of
Computer Science, Universtiy of Waterloo, 1996.
112. Spanish
Morphology for Verb Declination. Alex López-Ortiz and Daniel M.
German. Technical Report CS-96-10, Department of Computer Science, University of Waterloo, 1996.
113. Walking Streets Faster. Alex
López-Ortiz and Sven Schuierer. Technical Report CS-95-20, Department of
Computer Science, University of Waterloo, 1995.
114. Going Home Through an
Unknown Street Alex López-Ortiz and
Sven Schuierer. Technical Report #445, December 1994, Department of
Computer Science, The University of Western Ontario. (Improved results appear
on the paper of the same name in the Refereed Publications section above).
115. Probabilistic Complexity
Classes. A. López-Ortiz, Technical
Report, CS-91-11, Department of Computer Science, University of Waterloo, 1991. Also in Research Abstracts, Structures in Complexity Theory, 1992.
116. MP
Particle Movement. J. L. Abreu,
M. Olivers, M. Garza, A. López-Ortiz. Technical Report 72. Institute of Applied Mathematics and Systems.
Universidad Nacional Autsnoma de Mexico, 1987.