2009 | ||
---|---|---|
85 | Spyros Angelopoulos, Alejandro López-Ortiz: Interruptible Algorithms for Multi-Problem Solving. IJCAI 2009: 380-386 | |
84 | Andrew R. Curtis, Alejandro López-Ortiz: Capacity Provisioning a Valiant Load-Balanced Network. INFOCOM 2009: 3006-3010 | |
83 | Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz: Online Sorted Range Reporting. ISAAC 2009: 173-182 | |
82 | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala: Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212 | |
81 | Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger: Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. ISAAC 2009: 45-54 | |
80 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148 | |
79 | Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala: Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-229 | |
78 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: On the relative dominance of paging algorithms. Theor. Comput. Sci. 410(38-40): 3694-3701 (2009) | |
2008 | ||
77 | Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel: Optimal Scheduling of Contract Algorithms with Soft Deadlines. AAAI 2008: 868-873 | |
76 | Reza Dorrigiv, Alejandro López-Ortiz: Adaptive Searching in One and Two Dimensions. CCCG 2008 | |
75 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: List Update Algorithms for Data Compression. DCC 2008: 512 | |
74 | Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz: List Update with Locality of Reference. LATIN 2008: 399-410 | |
73 | Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger: Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). SPAA 2008: 185-187 | |
72 | Reza Dorrigiv, Alejandro López-Ortiz: Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. WALCOM 2008: 13-24 | |
71 | Reza Dorrigiv, Alejandro López-Ortiz: On Certain New Models for Paging with Locality of Reference. WALCOM 2008: 200-209 | |
2007 | ||
70 | 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 | |
69 | Alejandro López-Ortiz: Valiant Load Balancing, Benes Networks and Resilient Backbone Design. CAAN 2007: 2 | |
68 | Alejandro López-Ortiz: Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. CAAN 2007: 3-12 | |
67 | 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 | |
66 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499 | |
65 | Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat: Search Algorithms for Unstructured Peer-to-Peer Networks. LCN 2007: 343-352 | |
64 | Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz: On the separation and equivalence of paging strategies. SODA 2007: 229-237 | |
2006 | ||
63 | Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant: A Quadratic Propagator for the Inter-Distance Constraint. AAAI 2006 | |
62 | Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel: Optimal Scheduling of Contract Algorithms for Anytime Problems. AAAI 2006 | |
61 | Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 | |
60 | Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 | |
59 | Reza Dorrigiv, Alejandro López-Ortiz: Adaptive Analysis of On-line Algorithms. Robot Navigation 2006 | |
58 | Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu: Faster Adaptive Set Intersections for Text Searching. WEA 2006: 146-157 | |
57 | Alejandro López-Ortiz, J. Ian Munro: Foreword. ACM Transactions on Algorithms 2(4): 491 (2006) | |
2005 | ||
56 | 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 | |
55 | 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 | |
54 | Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz: Cross-Stitching Using Little Thread. CCCG 2005: 199-202 | |
53 | Claude-Guy Quimper, Alejandro López-Ortiz: From Linear Relaxations to Global Constraint Propagation. CP 2005: 867 | |
52 | 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 | |
51 | 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) | |
50 | 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) | |
49 | Alejandro López-Ortiz: Algorithmic foundations of the internet. SIGACT News 36(2): 45-62 (2005) | |
48 | Reza Dorrigiv, Alejandro López-Ortiz: A Survey of Performance Measures for On-line Algorithms SIGACT News 36(3): 67-81 (2005) | |
2004 | ||
47 | Alejandro López-Ortiz: Algorithmic Foundations of the Internet: Foreword. CAAN 2004: 155-158 | |
46 | Alejandro López-Ortiz: Search Engines and Web Information Retrieval. CAAN 2004: 183-191 | |
45 | Alejandro López-Ortiz: Algorithmic Foundations of the Internet: Roundup. CAAN 2004: 192-204 | |
44 | Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski: Improved Algorithms for the Global Cardinality Constraint. CP 2004: 542-556 | |
43 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS 2004: 735-747 | |
42 | 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 | |
41 | 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) | |
40 | 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) | |
39 | 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 | ||
38 | 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 | |
37 | 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 | |
36 | 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 | |
35 | 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 | |
34 | 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 | |
33 | 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 | |
32 | 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 | |
31 | Joseph Douglas Horton, Alejandro López-Ortiz: On the number of distributed measurement points for network tomography. Internet Measurement Comference 2003: 204-209 | |
30 | 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 | |
29 | Alejandro López-Ortiz, Sven Schuierer: Searching and on-line recognition of star-shaped polygons. Inf. Comput. 185(1): 66-88 (2003) | |
28 | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) | |
27 | Erik D. Demaine, Alejandro López-Ortiz: A linear lower bound on index size for text retrieval. J. Algorithms 48(1): 2-15 (2003) | |
26 | 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 | ||
25 | 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 | |
24 | Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing k2, n: A lower bound. CCCG 2002: 146-148 | |
23 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002: 348-360 | |
22 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Robot Localization without Depth Perception. SWAT 2002: 249-259 | |
21 | Alejandro López-Ortiz, Sven Schuierer: Online Parallel Heuristics and Robot Searching under the Competitive Framework. SWAT 2002: 260-269 | |
20 | 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 | ||
19 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX 2001: 91-104 | |
18 | Alejandro López-Ortiz, Graeme Sweet: Parallel searching on a lattice. CCCG 2001: 125-128 | |
17 | Erik D. Demaine, Alejandro López-Ortiz: A linear lower bound on index size for text retrieval. SODA 2001: 289-294 | |
16 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: On universally easy classes for NP-complete problems. SODA 2001: 910-911 | |
15 | Alejandro López-Ortiz, Sven Schuierer: Lower Bounds for Streets and Generalized Streets. Int. J. Comput. Geometry Appl. 11(4): 401-421 (2001) | |
14 | Alejandro López-Ortiz, Sven Schuierer: The ultimate strategy to search on m rays? Theor. Comput. Sci. 261(2): 267-295 (2001) | |
2000 | ||
13 | Peter Anderson, Alejandro López-Ortiz: A New Lower Bound for Kernel Searching. CCCG 2000 | |
12 | 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 | |
11 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Adaptive set intersections, unions, and differences. SODA 2000: 743-752 | |
1999 | ||
10 | Christoph A. Bröcker, Alejandro López-Ortiz: Position-Independent Street Searching. WADS 1999: 241-252 | |
1998 | ||
9 | Alejandro López-Ortiz, Sven Schuierer: The exact cost of exploring streets with a cab. CCCG 1998 | |
8 | Alejandro López-Ortiz, Sven Schuierer: The Ultimate Strategy to Search on m Rays? COCOON 1998: 75-84 | |
1997 | ||
7 | 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 | |
6 | Alejandro López-Ortiz, Sven Schuierer: Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons. WADS 1997: 284-296 | |
1996 | ||
5 | Alejandro López-Ortiz, Sven Schuierer: Generalized Streets Revisited. ESA 1996: 546-558 | |
4 | Alejandro López-Ortiz, Sven Schuierer: Walking Streets Faster. SWAT 1996: 345-356 | |
1995 | ||
3 | Alejandro López-Ortiz, Sven Schuierer: Going Home Through an Unknown Street. WADS 1995: 135-146 | |
1994 | ||
2 | Alejandro López-Ortiz: New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. Inf. Process. Lett. 51(6): 311-314 (1994) | |
1 | Alejandro López-Ortiz: Linear pattern matching of repeated substrings. SIGACT News 25(3): 114-121 (1994) |