default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlejandro López-Ortiz
Alex López-Ortiz
Person information
- affiliation: University of Waterloo, School of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j56]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible algorithms for multiproblem solving. J. Sched. 23(4): 451-464 (2020)- [j55]Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid exchanges are worth the price. Theor. Comput. Sci. 824-825: 1-10 (2020)
2010 – 2019
- 2019
- [j54]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. Algorithmica 81(3): 1152-1179 (2019) - 2018
- [j53]Alejandro López-Ortiz, Cynthia B. Pérez, Jazmín Romero:
Arbitrary Overlap Constraints in Graph Packing Problems. Int. J. Found. Comput. Sci. 29(1): 101-122 (2018) - [j52]Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura:
Computing k-Atomicity in Polynomial Time. SIAM J. Comput. 47(2): 420-455 (2018) - [i26]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible Algorithms for Multiproblem Solving. CoRR abs/1810.11291 (2018) - 2017
- [j51]Joan Boyar
, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. Inf. Comput. 253: 411-423 (2017) - [j50]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin:
The impact of processing order on performance: A taxonomy of semi-FIFO policies. J. Comput. Syst. Sci. 88: 220-235 (2017) - [j49]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. J. Graph Algorithms Appl. 21(3): 371-387 (2017) - [j48]Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz:
Multi-processor Search and Scheduling Problems with Setup Cost. Theory Comput. Syst. 60(4): 637-670 (2017) - [j47]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal scheduling of contract algorithms with soft deadlines. J. Sched. 20(3): 267-277 (2017) - [j46]Robert Fraser, Alejandro López-Ortiz:
The within-strip discrete unit disk cover problem. Theor. Comput. Sci. 674: 99-115 (2017) - [j45]Roberto Konow, Gonzalo Navarro, Charles L. A. Clarke, Alejandro López-Ortiz:
Inverted Treaps. ACM Trans. Inf. Syst. 35(3): 22:1-22:45 (2017) - 2016
- [j44]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. Algorithmica 74(1): 507-527 (2016) - [j43]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. J. Netw. Comput. Appl. 74: 31-43 (2016) - [j42]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin:
Online Scheduling FIFO Policies with Admission and Push-Out. Theory Comput. Syst. 58(2): 322-344 (2016) - [j41]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst. 59(3): 476-499 (2016) - [c111]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CCCG 2016: 57-62 - [c110]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. WALCOM 2016: 55-67 - [c109]Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Distributed Searching in the Plane with and Without Uncertainty. WALCOM 2016: 68-79 - [r3]Alejandro López-Ortiz:
Alternative Performance Measures in Online Algorithms. Encyclopedia of Algorithms 2016: 67-72 - [r2]Alejandro López-Ortiz, Alejandro Salinger:
Analyzing Cache Behaviour in Multicore Architectures. Encyclopedia of Algorithms 2016: 78-82 - [r1]Andrew Kane, Alejandro López-Ortiz:
Intersections of Inverted Lists. Encyclopedia of Algorithms 2016: 988-993 - [i25]Alejandro López-Ortiz, Jazmín Romero:
Arbitrary Overlap Constraints in Graph Packing Problems. CoRR abs/1601.03676 (2016) - [i24]Aditya Kumar Akash, Sándor P. Fekete, SeoungKyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. CoRR abs/1603.05944 (2016) - [i23]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CoRR abs/1607.05739 (2016) - [i22]Alejandro López-Ortiz, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick:
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). Dagstuhl Reports 6(3): 1-23 (2016) - 2015
- [j40]Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. Algorithmica 71(2): 330-353 (2015) - [j39]Alejandro López-Ortiz:
Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 48(5): 369 (2015) - [j38]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56(1): 220-250 (2015) - [j37]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. ACM Trans. Comput. Theory 7(3): 13:1-13:29 (2015) - [c108]Shahin Kamali, Alejandro López-Ortiz, Zahed Rahmati:
Online Packing of Equilateral Triangles. CCCG 2015 - [c107]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local policies for efficiently patrolling a triangulated region by a robot swarm. ICRA 2015: 1809-1815 - [c106]Shahin Kamali, Alejandro López-Ortiz:
All-Around Near-Optimal Solutions for the Online Bin Packing Problem. ISAAC 2015: 727-739 - [c105]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring and Partial List Colouring of Graphs On-line. IWOCA 2015: 124-135 - [c104]Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura:
Computing Weak Consistency in Polynomial Time: [Extended Abstract]. PODC 2015: 395-404 - [c103]Shahin Kamali, Alejandro López-Ortiz:
Efficient Online Strategies for Renting Servers in the Cloud. SOFSEM 2015: 277-288 - [c102]Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid Exchanges are Worth the Price. STACS 2015: 636-648 - [c101]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. TAMC 2015: 335-346 - [c100]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. TAMC 2015: 415-427 - [i21]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring Big Graphs On-Line. CoRR abs/1502.02557 (2015) - 2014
- [j36]Alejandro López-Ortiz, Alejandro Salinger, Robert Suderman:
Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms. Int. J. Netw. Comput. 4(1): 131-150 (2014) - [j35]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. J. Artif. Intell. Res. 51: 533-554 (2014) - [j34]Alejandro López-Ortiz, Jazmín Romero:
Parameterized Algorithms for the H-Packing with t-Overlap Problem. J. Graph Algorithms Appl. 18(4): 515-538 (2014) - [j33]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5(1): 14-40 (2014) - [j32]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target ray searching problems. Theor. Comput. Sci. 540: 2-12 (2014) - [c99]Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro:
Multi-Pivot Quicksort: Theory and Experiments. ALENEX 2014: 47-60 - [c98]Shahin Kamali, Alejandro López-Ortiz:
Almost Online Square Packing. CCCG 2014 - [c97]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Balancing work and size with bounded buffers. COMSNETS 2014: 1-8 - [c96]Jazmín Romero, Alejandro López-Ortiz:
A Parameterized Algorithm for Packing Overlapping Subgraphs. CSR 2014: 325-336 - [c95]Shahin Kamali, Alejandro López-Ortiz:
Better Compression through Better List Update Algorithms. DCC 2014: 372-381 - [c94]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. LATA 2014: 210-221 - [c93]Khuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz:
On the online fault-tolerant server consolidation problem. SPAA 2014: 12-21 - [c92]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. STACS 2014: 174-186 - [c91]Jazmín Romero, Alejandro López-Ortiz:
The ${\mathcal{G}}$ -Packing with t-Overlap Problem. WALCOM 2014: 114-124 - [i20]Shahin Kamali, Alejandro López-Ortiz:
An All-Around Near-Optimal Solution for the Classic Bin Packing Problem. CoRR abs/1404.4526 (2014) - [i19]Shahin Kamali, Alejandro López-Ortiz:
Efficient Online Strategies for Renting Servers in the Cloud. CoRR abs/1408.4156 (2014) - [i18]Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Strategies for Search and Rescue Operations with Robot Swarms. CoRR abs/1410.1077 (2014) - [i17]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm. CoRR abs/1410.2295 (2014) - [i16]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. CoRR abs/1411.6915 (2014) - [i15]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. CoRR abs/1411.7359 (2014) - [i14]Alejandro López-Ortiz, Ulrich Carsten Meyer, Robert Sedgewick:
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). Dagstuhl Reports 4(2): 129-149 (2014) - 2013
- [j31]Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz:
A novel approach for leveraging co-occurrence to improve the false positive error in signature files. J. Discrete Algorithms 18: 63-74 (2013) - [c90]Shahin Kamali, Alejandro López-Ortiz:
A Survey of Algorithms and Models for List Update. Space-Efficient Data Structures, Streams, and Algorithms 2013: 251-266 - [c89]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin:
Multi-queued network processors for packets with heterogeneous processing requirements. COMSNETS 2013: 1-10 - [c88]Shahin Kamali, Susana Ladra, Alejandro López-Ortiz, Diego Seco:
Context-Based Algorithms for the List-Update Problem under Alternative Cost Models. DCC 2013: 361-370 - [c87]Kirill Kogan, Sergey I. Nikolenko, Srinivasan Keshav, Alejandro López-Ortiz:
Efficient demand assignment in multi-connected microgrids. e-Energy 2013: 277-278 - [c86]Kirill Kogan, Sergey I. Nikolenko, Srinivasan Keshav, Alejandro López-Ortiz:
Efficient demand assignment in multi-connected microgrids with a shared central grid. SustainIT 2013: 1-5 - [c85]Alejandro López-Ortiz, Alejandro Salinger, Robert Suderman:
Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms. IPDPS Workshops 2013: 601-610 - [c84]Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson:
The Distance 4-Sector of Two Points Is Unique. ISAAC 2013: 612-622 - [c83]Hossein Vahabi, Margareta Ackerman, David Loker, Ricardo Baeza-Yates, Alejandro López-Ortiz:
Orthogonal query recommendation. RecSys 2013: 33-40 - [c82]Roberto Konow, Gonzalo Navarro, Charles L. A. Clarke, Alejandro López-Ortiz:
Faster and smaller inverted indices with treaps. SIGIR 2013: 193-202 - [c81]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. SIROCCO 2013: 55-67 - [c80]Alejandro López-Ortiz, Alejandro Salinger:
On the Sublinear Processor Gap for Parallel Architectures. TAMC 2013: 193-204 - [c79]Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco:
Broadcasting in Conflict-Aware Multi-channel Networks. WALCOM 2013: 158-169 - [e6]Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola:
Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Lecture Notes in Computer Science 8066, Springer 2013, ISBN 978-3-642-40272-2 [contents] - [i13]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. CoRR abs/1305.2108 (2013) - [i12]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. CoRR abs/1311.7357 (2013) - 2012
- [j30]Alejandro López-Ortiz:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 63(3): 569-570 (2012) - [j29]Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
On the discrete Unit Disk Cover Problem. Int. J. Comput. Geom. Appl. 22(5): 407-420 (2012) - [j28]Alexander Golynski, Alejandro López-Ortiz:
Optimal strategies for the list update problem under the MRM alternative cost model. Inf. Process. Lett. 112(6): 218-222 (2012) - [j27]Reza Dorrigiv, Alejandro López-Ortiz:
List update with probabilistic locality of reference. Inf. Process. Lett. 112(13): 540-543 (2012) - [c78]Robert Fraser, Alejandro López-Ortiz:
The Within-Strip Discrete Unit Disk Cover Problem. CCCG 2012: 53-58 - [c77]Reza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik:
Optimal Average Case Strategy for Looking Around a Corner. CCCG 2012: 277-282 - [c76]Andrew R. Curtis, Tommy Carpenter, Mustafa Elsheikh, Alejandro López-Ortiz, Srinivasan Keshav:
REWIRE: An optimization-based framework for unstructured data center network design. INFOCOM 2012: 1116-1124 - [c75]Alejandro López-Ortiz, Alejandro Salinger:
Paging for multi-core shared caches. ITCS 2012: 113-127 - [c74]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin:
A taxonomy of Semi-FIFO policies. IPCCC 2012: 295-304 - [c73]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin, Denis Tugaryov:
FIFO Queueing Policies for Packets with Heterogeneous Processing. MedAlg 2012: 248-260 - [c72]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA 2012: 93-106 - [c71]Alejandro López-Ortiz, Alejandro Salinger:
Minimizing Cache Usage in Paging. WAOA 2012: 145-158 - [i11]Kirill Kogan, Alejandro López-Ortiz, Gabriel Scalosub, Michael Segal:
Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors. CoRR abs/1202.5755 (2012) - [i10]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin, Denis Tugaryov:
FIFO Queueing Policies for Packets with Heterogeneous Processing. CoRR abs/1204.5443 (2012) - [i9]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. CoRR abs/1212.4016 (2012) - 2011
- [j26]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. Algorithmica 61(2): 463-505 (2011) - [j25]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Efficient view point selection for silhouettes of convex polyhedra. Comput. Geom. 44(8): 399-408 (2011) - [j24]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geom. Appl. 21(2): 215-239 (2011) - [j23]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. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c70]Alejandro López-Ortiz, Alejandro Salinger:
Brief announcement: paging for multicore processors. SPAA 2011: 137-138 - [c69]Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz:
COCA Filters: Co-occurrence Aware Bloom Filters. SPIRE 2011: 313-325 - [c68]Alejandro López-Ortiz, Claude-Guy Quimper:
A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times. STACS 2011: 380-391 - [c67]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target Ray Searching Problems. WADS 2011: 37-48 - [c66]Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
On the Discrete Unit Disk Cover Problem. WALCOM 2011: 146-157 - [c65]Reza Dorrigiv, Alejandro López-Ortiz:
A New Perspective on List Update: Probabilistic Locality and Working Set. WAOA 2011: 150-163 - [i8]Margareta Ackerman, David Loker, Alejandro López-Ortiz:
Orthogonal Query Expansion. CoRR abs/1109.0530 (2011) - 2010
- [j22]Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
Sorting with networks of data structures. Discret. Appl. Math. 158(15): 1579-1586 (2010) - [j21]Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, Alejandro Salinger:
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. Discret. Math. Algorithms Appl. 2(1): 77-88 (2010) - [c64]Andrew R. Curtis, Srinivasan Keshav, Alejandro López-Ortiz:
LEGUP: using heterogeneity to reduce the cost of data center network upgrades. CoNEXT 2010: 14 - [e5]Alejandro López-Ortiz:
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Lecture Notes in Computer Science 6034, Springer 2010, ISBN 978-3-642-12199-9 [contents] - [i7]Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz, Sabrina Nusrat, Saad Altaful Quader, Nabila Rahman:
Some New Equiprojective Polyhedra. CoRR abs/1009.2252 (2010)
2000 – 2009
- 2009
- [j20]Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger:
An experimental investigation of set intersection algorithms for text searching. ACM J. Exp. Algorithmics 14 (2009) - [j19]Reza Dorrigiv, Alejandro López-Ortiz:
On Developing New Models, with Paging as a Case Study. SIGACT News 40(4): 98-123 (2009) - [j18]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) - [c63]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible Algorithms for Multi-Problem Solving. IJCAI 2009: 380-386 - [c62]Andrew R. Curtis, Alejandro López-Ortiz:
Capacity Provisioning a Valiant Load-Balanced Network. INFOCOM 2009: 3006-3010 - [c61]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 - [c60]Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz:
Online Sorted Range Reporting. ISAAC 2009: 173-182 - [c59]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 - [c58]Jérémy Barbay, Alex López-Ortiz:
Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. SCCC 2009: 11-17 - [c57]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 - [c56]Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. WAOA 2009: 104-115 - [c55]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148 - [e4]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009. Dagstuhl Seminar Proceedings 09171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i6]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i5]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - 2008
- [c54]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines. AAAI 2008: 868-873 - [c53]Reza Dorrigiv, Alejandro López-Ortiz:
Adaptive Searching in One and Two Dimensions. CCCG 2008 - [c52]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
List Update Algorithms for Data Compression. DCC 2008: 512 - [c51]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
List Update with Locality of Reference. LATIN 2008: 399-410 - [c50]Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger:
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). SPAA 2008: 185-187 - [c49]Reza Dorrigiv, Alejandro López-Ortiz:
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. WALCOM 2008: 13-24 - [c48]Reza Dorrigiv, Alejandro López-Ortiz:
On Certain New Models for Paging with Locality of Reference. WALCOM 2008: 200-209 - [i4]Alejandro López-Ortiz, Reza Dorrigiv, Alejandro Salinger:
Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM). Data Structures 2008 - 2007
- [c47]Alejandro López-Ortiz:
Valiant Load Balancing, Benes Networks and Resilient Backbone Design. CAAN 2007: 2 - [c46]Alejandro López-Ortiz:
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. CAAN 2007: 3-12 - [c45]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. FSTTCS 2007: 400-411 - [c44]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499 - [c43]Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat:
Search Algorithms for Unstructured Peer-to-Peer Networks. LCN 2007: 343-352 - [c42]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the separation and equivalence of paging strategies. SODA 2007: 229-237 - [e3]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [j17]Alejandro López-Ortiz, J. Ian Munro:
Foreword. ACM Trans. Algorithms 2(4): 491 (2006) - [c41]Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant:
A Quadratic Propagator for the Inter-Distance Constraint. AAAI 2006: 123-128 - [c40]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems. AAAI 2006: 874-879 - [c39]Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu:
Faster Adaptive Set Intersections for Text Searching. WEA 2006: 146-157 - [i3]Reza Dorrigiv, Alejandro López-Ortiz:
Adaptive Analysis of On-line Algorithms. Robot Navigation 2006 - [i2]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 - [i1]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 - 2005
- [j16]Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek:
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. Constraints An Int. J. 10(2): 115-135 (2005) - [j15]Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar:
Fast string sorting using order-preserving compression. ACM J. Exp. Algorithmics 10 (2005) - [j14]Alejandro López-Ortiz:
Algorithmic foundations of the internet. SIGACT News 36(2): 45-62 (2005) - [j13]Reza Dorrigiv, Alejandro López-Ortiz:
A Survey of Performance Measures for On-line Algorithms. SIGACT News 36(3): 67-81 (2005) - [c38]Therese Biedl, Joseph Douglas Horton, Alejandro López-Ortiz:
Cross-Stitching Using Little Thread. CCCG 2005: 199-202 - [c37]Claude-Guy Quimper, Alejandro López-Ortiz:
From Linear Relaxations to Global Constraint Propagation. CP 2005: 867 - [c36]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 - [e2]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. Lecture Notes in Computer Science 3405, Springer 2005, ISBN 3-540-27873-7 [contents] - [e1]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. Lecture Notes in Computer Science 3608, Springer 2005, ISBN 3-540-28101-0 [contents] - 2004
- [j12]Therese 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) - [j11]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) - [j10]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) - [c35]Alejandro López-Ortiz:
Algorithmic Foundations of the Internet: Foreword. CAAN 2004: 155-158 - [c34]Alejandro López-Ortiz:
Search Engines and Web Information Retrieval. CAAN 2004: 183-191 - [c33]Alejandro López-Ortiz:
Algorithmic Foundations of the Internet: Roundup. CAAN 2004: 192-204 - [c32]Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski:
Improved Algorithms for the Global Cardinality Constraint. CP 2004: 542-556 - [c31]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS 2004: 735-747 - [c30]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 - 2003
- [j9]Alejandro López-Ortiz, Sven Schuierer:
Searching and on-line recognition of star-shaped polygons. Inf. Comput. 185(1): 66-88 (2003) - [j8]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) - [j7]Erik D. Demaine, Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval. J. Algorithms 48(1): 2-15 (2003) - [j6]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
On universally easy classes for NP-complete problems. Theor. Comput. Sci. 304(1-3): 471-476 (2003) - [c29]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 - [c28]Therese 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 - [c27]Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
the asteroid surveying problem and other puzzles. SCG 2003: 372-373 - [c26]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 - [c25]Therese 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 - [c24]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 - [c23]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 - [c22]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 Conference 2003: 173-178 - [c21]Joseph Douglas Horton, Alejandro López-Ortiz:
On the number of distributed measurement points for network tomography. Internet Measurement Conference 2003: 204-209 - 2002
- [j5]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. Geom. Appl. 12(4): 283-296 (2002) - [c20]Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
Searching for the center of a circle. CCCG 2002: 137-141 - [c19]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing k2, n: A lower bound. CCCG 2002: 146-148 - [c18]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002: 348-360 - [c17]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Robot Localization without Depth Perception. SWAT 2002: 249-259 - [c16]Alejandro López-Ortiz, Sven Schuierer:
Online Parallel Heuristics and Robot Searching under the Competitive Framework. SWAT 2002: 260-269 - 2001
- [j4]Alejandro López-Ortiz, Sven Schuierer:
Lower Bounds for Streets and Generalized Streets. Int. J. Comput. Geom. Appl. 11(4): 401-421 (2001) - [j3]Alejandro López-Ortiz, Sven Schuierer:
The ultimate strategy to search on m rays? Theor. Comput. Sci. 261(2): 267-295 (2001) - [c15]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX 2001: 91-104 - [c14]Alejandro López-Ortiz, Graeme Sweet:
Parallel searching on a lattice. CCCG 2001: 125-128 - [c13]Erik D. Demaine, Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval. SODA 2001: 289-294 - [c12]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
On universally easy classes for NP-complete problems. SODA 2001: 910-911 - 2000
- [c11]Peter Anderson, Alejandro López-Ortiz:
A New Lower Bound for Kernel Searching. CCCG 2000 - [c10]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 - [c9]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Adaptive set intersections, unions, and differences. SODA 2000: 743-752
1990 – 1999
- 1999
- [c8]Christoph A. Bröcker, Alejandro López-Ortiz:
Position-Independent Street Searching. WADS 1999: 241-252 - 1998
- [c7]Alejandro López-Ortiz, Sven Schuierer:
The exact cost of exploring streets with a cab. CCCG 1998 - [c6]Alejandro López-Ortiz, Sven Schuierer:
The Ultimate Strategy to Search on m Rays? COCOON 1998: 75-84 - 1997
- [c5]Alejandro López-Ortiz, Sven Schuierer:
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons. SCG 1997: 445-447 - [c4]Alejandro López-Ortiz, Sven Schuierer:
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons. WADS 1997: 284-296 - 1996
- [c3]Alejandro López-Ortiz, Sven Schuierer:
Generalized Streets Revisited. ESA 1996: 546-558 - [c2]Alejandro López-Ortiz, Sven Schuierer:
Walking Streets Faster. SWAT 1996: 345-356 - 1995
- [c1]Alejandro López-Ortiz, Sven Schuierer:
Going Home Through an Unknown Street. WADS 1995: 135-146 - 1994
- [j2]Alejandro López-Ortiz:
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. Inf. Process. Lett. 51(6): 311-314 (1994) - [j1]Alejandro López-Ortiz:
Linear pattern matching of repeated substrings. SIGACT News 25(3): 114-121 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
