| 2008 |
|---|
| 76 | | Spyros Angelopoulos,
Alejandro López-Ortiz,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
AAAI 2008: 868-873 |
| 75 | | Reza Dorrigiv,
Alejandro López-Ortiz:
Adaptive Searching in One and Two Dimensions.
CCCG 2008 |
| 74 | EE | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
List Update Algorithms for Data Compression.
DCC 2008: 512 |
| 73 | EE | Spyros Angelopoulos,
Reza Dorrigiv,
Alejandro López-Ortiz:
List Update with Locality of Reference.
LATIN 2008: 399-410 |
| 72 | EE | Reza Dorrigiv,
Alejandro López-Ortiz,
Alejandro Salinger:
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM).
SPAA 2008: 185-187 |
| 71 | EE | Reza Dorrigiv,
Alejandro López-Ortiz:
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis.
WALCOM 2008: 13-24 |
| 70 | EE | Reza Dorrigiv,
Alejandro López-Ortiz:
On Certain New Models for Paging with Locality of Reference.
WALCOM 2008: 200-209 |
| 2007 |
|---|
| 69 | | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 68 | EE | Alejandro López-Ortiz:
Valiant Load Balancing, Benes Networks and Resilient Backbone Design.
CAAN 2007: 2 |
| 67 | EE | Alejandro López-Ortiz:
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.
CAAN 2007: 3-12 |
| 66 | EE | Therese C. Biedl,
Masud Hasan,
Alejandro López-Ortiz:
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.
FSTTCS 2007: 400-411 |
| 65 | EE | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
On the Relative Dominance of Paging Algorithms.
ISAAC 2007: 488-499 |
| 64 | EE | Reza Dorrigiv,
Alejandro López-Ortiz,
Pawel Pralat:
Search Algorithms for Unstructured Peer-to-Peer Networks.
LCN 2007: 343-352 |
| 63 | EE | Spyros Angelopoulos,
Reza Dorrigiv,
Alejandro López-Ortiz:
On the separation and equivalence of paging strategies.
SODA 2007: 229-237 |
| 2006 |
|---|
| 62 | | Claude-Guy Quimper,
Alejandro López-Ortiz,
Gilles Pesant:
A Quadratic Propagator for the Inter-Distance Constraint.
AAAI 2006 |
| 61 | | Alejandro López-Ortiz,
Spyros Angelopoulos,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems.
AAAI 2006 |
| 60 | EE | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation.
Robot Navigation 2006 |
| 59 | EE | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation.
Robot Navigation 2006 |
| 58 | EE | Reza Dorrigiv,
Alejandro López-Ortiz:
Adaptive Analysis of On-line Algorithms.
Robot Navigation 2006 |
| 57 | EE | Jérémy Barbay,
Alejandro López-Ortiz,
Tyler Lu:
Faster Adaptive Set Intersections for Text Searching.
WEA 2006: 146-157 |
| 56 | EE | Alejandro López-Ortiz,
J. Ian Munro:
Foreword.
ACM Transactions on Algorithms 2(4): 491 (2006) |
| 2005 |
|---|
| 55 | | Alejandro López-Ortiz,
Angèle M. Hamel:
Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers
Springer 2005 |
| 54 | | Frank K. H. A. Dehne,
Alejandro López-Ortiz,
Jörg-Rüdiger Sack:
Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Springer 2005 |
| 53 | EE | Therese C. Biedl,
Joseph Douglas Horton,
Alejandro López-Ortiz:
Cross-Stitching Using Little Thread.
CCCG 2005: 199-202 |
| 52 | EE | Claude-Guy Quimper,
Alejandro López-Ortiz:
From Linear Relaxations to Global Constraint Propagation.
CP 2005: 867 |
| 51 | EE | Brona Brejová,
Daniel G. Brown,
Ian M. Harrower,
Alejandro López-Ortiz,
Tomás Vinar:
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.
CPM 2005: 1-10 |
| 50 | EE | Alejandro López-Ortiz,
Mehdi Mirzazadeh,
Mohammad Ali Safari,
M. Hossein Sheikh Attar:
Fast string sorting using order-preserving compression.
ACM Journal of Experimental Algorithmics 10: (2005) |
| 49 | EE | Claude-Guy Quimper,
Alexander Golynski,
Alejandro López-Ortiz,
Peter van Beek:
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Constraints 10(2): 115-135 (2005) |
| 48 | EE | Alejandro López-Ortiz:
Algorithmic foundations of the internet.
SIGACT News 36(2): 45-62 (2005) |
| 47 | EE | Reza Dorrigiv,
Alejandro López-Ortiz:
A Survey of Performance Measures for On-line Algorithms
SIGACT News 36(3): 67-81 (2005) |
| 2004 |
|---|
| 46 | EE | Alejandro López-Ortiz:
Algorithmic Foundations of the Internet: Foreword.
CAAN 2004: 155-158 |
| 45 | EE | Alejandro López-Ortiz:
Search Engines and Web Information Retrieval.
CAAN 2004: 183-191 |
| 44 | EE | Alejandro López-Ortiz:
Algorithmic Foundations of the Internet: Roundup.
CAAN 2004: 192-204 |
| 43 | EE | Claude-Guy Quimper,
Alejandro López-Ortiz,
Peter van Beek,
Alexander Golynski:
Improved Algorithms for the Global Cardinality Constraint.
CP 2004: 542-556 |
| 42 | EE | Therese C. Biedl,
Masud Hasan,
Alejandro López-Ortiz:
Efficient View Point Selection for Silhouettes of Convex Polyhedra.
MFCS 2004: 735-747 |
| 41 | EE | Lukasz Golab,
David DeHaan,
Alejandro López-Ortiz,
Erik D. Demaine:
Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies.
SSDBM 2004: 425-426 |
| 40 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding hidden independent sets in interval graphs.
Theor. Comput. Sci. 310(1-3): 287-307 (2004) |
| 39 | EE | Alejandro López-Ortiz,
Sven Schuierer:
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.
Theor. Comput. Sci. 310(1-3): 527-537 (2004) |
| 38 | EE | Michael H. Albert,
Alexander Golynski,
Angèle M. Hamel,
Alejandro López-Ortiz,
S. Srinivasa Rao,
Mohammad Ali Safari:
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci. 321(2-3): 405-414 (2004) |
| 2003 |
|---|
| 37 | | Timothy M. Chan,
Alexander Golynski,
Alejandro López-Ortiz,
Claude-Guy Quimper:
Curves of width one and the river shore problem.
CCCG 2003: 73-75 |
| 36 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding Hidden Independent Sets in Interval Graphs.
COCOON 2003: 182-191 |
| 35 | EE | Claude-Guy Quimper,
Peter van Beek,
Alejandro López-Ortiz,
Alexander Golynski,
Sayyed Bashir Sadjad:
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
CP 2003: 600-614 |
| 34 | EE | Therese C. Biedl,
Erik D. Demaine,
Alexander Golynski,
Joseph Douglas Horton,
Alejandro López-Ortiz,
Guillaume Poirier,
Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
ESA 2003: 90-101 |
| 33 | EE | Michael A. Bender,
Gerth Stølting Brodal,
Rolf Fagerberg,
Dongdong Ge,
Simai He,
Haodong Hu,
John Iacono,
Alejandro López-Ortiz:
The Cost of Cache-Oblivious Searching.
FOCS 2003: 271-282 |
| 32 | | Alejandro López-Ortiz,
Claude-Guy Quimper,
John Tromp,
Peter van Beek:
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint.
IJCAI 2003: 245-250 |
| 31 | EE | Lukasz Golab,
David DeHaan,
Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Identifying frequent items in sliding windows over on-line packet streams.
Internet Measurement Comference 2003: 173-178 |
| 30 | EE | Joseph Douglas Horton,
Alejandro López-Ortiz:
On the number of distributed measurement points for network tomography.
Internet Measurement Comference 2003: 204-209 |
| 29 | EE | Timothy M. Chan,
Alexander Golynski,
Alejandro López-Ortiz,
Claude-Guy Quimper:
the asteroid surveying problem and other puzzles.
Symposium on Computational Geometry 2003: 372-373 |
| 28 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Searching and on-line recognition of star-shaped polygons.
Inf. Comput. 185(1): 66-88 (2003) |
| 27 | EE | Therese C. Biedl,
Timothy M. Chan,
Alejandro López-Ortiz:
Drawing K2, n: A lower bound.
Inf. Process. Lett. 85(6): 303-305 (2003) |
| 26 | EE | Erik D. Demaine,
Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval.
J. Algorithms 48(1): 2-15 (2003) |
| 25 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
Theor. Comput. Sci. 1-3(304): 471-476 (2003) |
| 2002 |
|---|
| 24 | EE | Therese C. Biedl,
Masud Hasan,
Joseph Douglas Horton,
Alejandro López-Ortiz,
Tomás Vinar:
Searching for the center of a circle.
CCCG 2002: 137-141 |
| 23 | EE | Therese C. Biedl,
Timothy M. Chan,
Alejandro López-Ortiz:
Drawing k2, n: A lower bound.
CCCG 2002: 146-148 |
| 22 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space.
ESA 2002: 348-360 |
| 21 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Robot Localization without Depth Perception.
SWAT 2002: 249-259 |
| 20 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Online Parallel Heuristics and Robot Searching under the Competitive Framework.
SWAT 2002: 260-269 |
| 19 | EE | Prosenjit Bose,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
Alejandro López-Ortiz,
Pat Morin,
J. Ian Munro:
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl. 12(4): 283-296 (2002) |
| 2001 |
|---|
| 18 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems.
ALENEX 2001: 91-104 |
| 17 | EE | Alejandro López-Ortiz,
Graeme Sweet:
Parallel searching on a lattice.
CCCG 2001: 125-128 |
| 16 | EE | Erik D. Demaine,
Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval.
SODA 2001: 289-294 |
| 15 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
SODA 2001: 910-911 |
| 14 | | Alejandro López-Ortiz,
Sven Schuierer:
Lower Bounds for Streets and Generalized Streets.
Int. J. Comput. Geometry Appl. 11(4): 401-421 (2001) |
| 13 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The ultimate strategy to search on m rays?
Theor. Comput. Sci. 261(2): 267-295 (2001) |
| 2000 |
|---|
| 12 | EE | Peter Anderson,
Alejandro López-Ortiz:
A New Lower Bound for Kernel Searching.
CCCG 2000 |
| 11 | EE | Prosenjit Bose,
Pat Morin,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
J. Ian Munro,
Alejandro López-Ortiz:
Online Routing in Convex Subdivisions.
ISAAC 2000: 47-59 |
| 10 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Adaptive set intersections, unions, and differences.
SODA 2000: 743-752 |
| 1999 |
|---|
| 9 | EE | Christoph A. Bröcker,
Alejandro López-Ortiz:
Position-Independent Street Searching.
WADS 1999: 241-252 |
| 1998 |
|---|
| 8 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The exact cost of exploring streets with a cab.
CCCG 1998 |
| 7 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The Ultimate Strategy to Search on m Rays?
COCOON 1998: 75-84 |
| 1997 |
|---|
| 6 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons.
Symposium on Computational Geometry 1997: 445-447 |
| 5 | | Alejandro López-Ortiz,
Sven Schuierer:
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons.
WADS 1997: 284-296 |
| 1996 |
|---|
| 4 | | Alejandro López-Ortiz,
Sven Schuierer:
Generalized Streets Revisited.
ESA 1996: 546-558 |
| 3 | | Alejandro López-Ortiz,
Sven Schuierer:
Walking Streets Faster.
SWAT 1996: 345-356 |
| 1995 |
|---|
| 2 | | Alejandro López-Ortiz,
Sven Schuierer:
Going Home Through an Unknown Street.
WADS 1995: 135-146 |
| 1994 |
|---|
| 1 | | Alejandro López-Ortiz:
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine.
Inf. Process. Lett. 51(6): 311-314 (1994) |
