Alex López-Ortiz
List of publications from the DBLP Bibliography Server - FAQ| 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) | |
| c82 | 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 | |
| c81 | Alejandro López-Ortiz, Alejandro Salinger: On the Sublinear Processor Gap for Parallel Architectures. TAMC 2013: 193-204 | |
| c80 | 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 | |
| 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. Geometry 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) | |
| c79 | Robert Fraser, Alejandro López-Ortiz: The Within-Strip Discrete Unit Disk Cover Problem. CCCG 2012: 53-58 | |
| c78 | Reza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik: Optimal Average Case Strategy for Looking Around a Corner. CCCG 2012: 277-282 | |
| c77 | 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 | |
| c76 | ||
| c75 | Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin: A taxonomy of Semi-FIFO policies. IPCCC 2012: 295-304 | |
| c74 | 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 | |
| i5 | 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) | |
| i4 | 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) | |
| i3 | 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 C. 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 C. Biedl, Masud Hasan, Alejandro López-Ortiz: Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geometry 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) | |
| c73 | Alejandro López-Ortiz, Alejandro Salinger: Brief announcement: paging for multicore processors. SPAA 2011: 137-138 | |
| c72 | Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz: COCA Filters: Co-occurrence Aware Bloom Filters. SPIRE 2011: 313-325 | |
| c71 | 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 | |
| c70 | Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou: Multi-target Ray Searching Problems. WADS 2011: 37-48 | |
| c69 | Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson: On the Discrete Unit Disk Cover Problem. WALCOM 2011: 146-157 | |
| c68 | Reza Dorrigiv, Alejandro López-Ortiz: A New Perspective on List Update: Probabilistic Locality and Working Set. WAOA 2011: 150-163 | |
| i2 | Margareta Ackerman, David Loker, Alejandro López-Ortiz: Orthogonal Query Expansion. CoRR abs/1109.0530 (2011) | |
| 2010 | ||
| j22 | Therese C. Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro: Sorting with networks of data structures. Discrete Applied Mathematics 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. Discrete Math., Alg. and Appl. 2(1): 77-88 (2010) | |
| c67 | Andrew R. Curtis, Srinivasan Keshav, Alejandro López-Ortiz: LEGUP: using heterogeneity to reduce the cost of data center network upgrades. CoNEXT 2010: 14 | |
| e4 | Alejandro López-Ortiz (Ed.): 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 | |
| i1 | 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) | |
| 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 Journal of Experimental 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) | |
| c66 | Spyros Angelopoulos, Alejandro López-Ortiz: Interruptible Algorithms for Multi-Problem Solving. IJCAI 2009: 380-386 | |
| c65 | Andrew R. Curtis, Alejandro López-Ortiz: Capacity Provisioning a Valiant Load-Balanced Network. INFOCOM 2009: 3006-3010 | |
| c64 | 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 | |
| c63 | Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz: Online Sorted Range Reporting. ISAAC 2009: 173-182 | |
| c62 | 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 | |
| c61 | Jérémy Barbay, Alex López-Ortiz: Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. SCCC 2009: 11-17 | |
| c60 | 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 | |
| c59 | Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz: Parameterized Analysis of Paging and List Update Algorithms. WAOA 2009: 104-115 | |
| c58 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148 | |
| 2008 | ||
| c57 | Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel: Optimal Scheduling of Contract Algorithms with Soft Deadlines. AAAI 2008: 868-873 | |
| c56 | ||
| c55 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: List Update Algorithms for Data Compression. DCC 2008: 512 | |
| c54 | Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz: List Update with Locality of Reference. LATIN 2008: 399-410 | |
| c53 | Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger: Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). SPAA 2008: 185-187 | |
| c52 | Reza Dorrigiv, Alejandro López-Ortiz: Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. WALCOM 2008: 13-24 | |
| c51 | Reza Dorrigiv, Alejandro López-Ortiz: On Certain New Models for Paging with Locality of Reference. WALCOM 2008: 200-209 | |
| 2007 | ||
| c50 | Alejandro López-Ortiz: Valiant Load Balancing, Benes Networks and Resilient Backbone Design. CAAN 2007: 2 | |
| c49 | Alejandro López-Ortiz: Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. CAAN 2007: 3-12 | |
| c48 | 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 | |
| c47 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499 | |
| c46 | Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat: Search Algorithms for Unstructured Peer-to-Peer Networks. LCN 2007: 343-352 | |
| c45 | 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 (Eds.): Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 | |
| 2006 | ||
| j17 | ||
| c44 | Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant: A Quadratic Propagator for the Inter-Distance Constraint. AAAI 2006: 123-128 | |
| c43 | Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel: Optimal Scheduling of Contract Algorithms for Anytime Problems. AAAI 2006: 874-879 | |
| c42 | Reza Dorrigiv, Alejandro López-Ortiz: Adaptive Analysis of On-line Algorithms. Robot Navigation 2006 | |
| c41 | Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 | |
| c40 | Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 | |
| c39 | Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu: Faster Adaptive Set Intersections for Text Searching. WEA 2006: 146-157 | |
| 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 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 Journal of Experimental Algorithmics 10 (2005) | |
| j14 | ||
| 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 C. 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 (Eds.): 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 | |
| e1 | Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack (Eds.): 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 | |
| 2004 | ||
| j12 | 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) | |
| 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 | ||
| c34 | ||
| c33 | ||
| 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 C. 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 C. 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. 1-3(304): 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 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 | |
| c27 | 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 | |
| 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 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 | |
| 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 Comference 2003: 173-178 | |
| c21 | Joseph Douglas Horton, Alejandro López-Ortiz: On the number of distributed measurement points for network tomography. Internet Measurement Comference 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. Geometry Appl. 12(4): 283-296 (2002) | |
| c20 | 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 | |
| c19 | Therese C. 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. Geometry 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 | ||
| 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 | ||
| 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 | |
| 1999 | ||
| c8 | Christoph A. Bröcker, Alejandro López-Ortiz: Position-Independent Street Searching. WADS 1999: 241-252 | |
| 1998 | ||
| c7 | ||
| 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. Symposium on Computational Geometry 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 | ||
| c2 | ||
| 1995 | ||
| c1 | ||
| 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) | |
Colors in the list of coauthors
Last update Sat May 25 10:18:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page