The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alejandro López-Ortiz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel
    Optimal Scheduling of Contract Algorithms for Anytime Problems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant
    A Quadratic Propagator for the Inter-Distance Constraint. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Experiments on Adaptive Set Intersections for Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:91-104 [Conf]
  4. Alejandro López-Ortiz
    Algorithmic Foundations of the Internet: Foreword. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:155-158 [Conf]
  5. Alejandro López-Ortiz
    Search Engines and Web Information Retrieval. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:183-191 [Conf]
  6. Alejandro López-Ortiz
    Algorithmic Foundations of the Internet: Roundup. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:192-204 [Conf]
  7. Peter Anderson, Alejandro López-Ortiz
    A New Lower Bound for Kernel Searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  8. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz
    Drawing k2, n: A lower bound. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:146-148 [Conf]
  9. Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar
    Searching for the center of a circle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:137-141 [Conf]
  10. Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz
    Cross-Stitching Using Little Thread. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:199-202 [Conf]
  11. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
    Curves of width one and the river shore problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:73-75 [Conf]
  12. Alejandro López-Ortiz, Graeme Sweet
    Parallel searching on a lattice. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:125-128 [Conf]
  13. Alejandro López-Ortiz, Sven Schuierer
    The exact cost of exploring streets with a cab. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:182-191 [Conf]
  15. Alejandro López-Ortiz, Sven Schuierer
    The Ultimate Strategy to Search on m Rays? [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:75-84 [Conf]
  16. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
    the asteroid surveying problem and other puzzles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:372-373 [Conf]
  17. Alejandro López-Ortiz, Sven Schuierer
    Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:445-447 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:600-614 [Conf]
  19. Claude-Guy Quimper, Alejandro López-Ortiz
    From Linear Relaxations to Global Constraint Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:867- [Conf]
  20. Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski
    Improved Algorithms for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:542-556 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:1-10 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:90-101 [Conf]
  23. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Frequency Estimation of Internet Packet Streams with Limited Space. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:348-360 [Conf]
  24. Alejandro López-Ortiz, Sven Schuierer
    Generalized Streets Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:546-558 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:271-282 [Conf]
  26. Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, Peter van Beek
    A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:245-250 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:173-178 [Conf]
  28. Joseph Douglas Horton, Alejandro López-Ortiz
    On the number of distributed measurement points for network tomography. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:204-209 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  30. Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz
    Efficient View Point Selection for Silhouettes of Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:735-747 [Conf]
  31. Erik D. Demaine, Alejandro López-Ortiz
    A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:289-294 [Conf]
  32. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Adaptive set intersections, unions, and differences. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:743-752 [Conf]
  33. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:910-911 [Conf]
  34. Lukasz Golab, David DeHaan, Alejandro López-Ortiz, Erik D. Demaine
    Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2004, pp:425-426 [Conf]
  35. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Robot Localization without Depth Perception. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:249-259 [Conf]
  36. Alejandro López-Ortiz, Sven Schuierer
    Online Parallel Heuristics and Robot Searching under the Competitive Framework. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:260-269 [Conf]
  37. Alejandro López-Ortiz, Sven Schuierer
    Walking Streets Faster. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:345-356 [Conf]
  38. Christoph A. Bröcker, Alejandro López-Ortiz
    Position-Independent Street Searching. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:241-252 [Conf]
  39. Alejandro López-Ortiz, Sven Schuierer
    Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:284-296 [Conf]
  40. Alejandro López-Ortiz, Sven Schuierer
    Going Home Through an Unknown Street. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:135-146 [Conf]
  41. Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu
    Faster Adaptive Set Intersections for Text Searching. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:146-157 [Conf]
  42. Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek
    An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    Constraints, 2005, v:10, n:2, pp:115-135 [Journal]
  43. Alejandro López-Ortiz, Sven Schuierer
    Searching and on-line recognition of star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:185, n:1, pp:66-88 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  45. Alejandro López-Ortiz, Sven Schuierer
    Lower Bounds for Streets and Generalized Streets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:401-421 [Journal]
  46. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz
    Drawing K2, n: A lower bound. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:303-305 [Journal]
  47. Alejandro López-Ortiz
    New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:6, pp:311-314 [Journal]
  48. Erik D. Demaine, Alejandro López-Ortiz
    A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:2-15 [Journal]
  49. Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar
    Fast string sorting using order-preserving compression. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  50. Alejandro López-Ortiz, J. Ian Munro
    Foreword. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:491- [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:405-414 [Journal]
  52. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:287-307 [Journal]
  53. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:471-476 [Journal]
  54. Alejandro López-Ortiz, Sven Schuierer
    The ultimate strategy to search on m rays? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:267-295 [Journal]
  55. Alejandro López-Ortiz, Sven Schuierer
    On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:527-537 [Journal]
  56. Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
    On the separation and equivalence of paging strategies. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:229-237 [Conf]

  57. Optimal Scheduling of Contract Algorithms with Soft Deadlines. [Citation Graph (, )][DBLP]


  58. Valiant Load Balancing, Benes Networks and Resilient Backbone Design. [Citation Graph (, )][DBLP]


  59. Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. [Citation Graph (, )][DBLP]


  60. Adaptive Searching in One and Two Dimensions. [Citation Graph (, )][DBLP]


  61. Adaptive Analysis of On-line Algorithms. [Citation Graph (, )][DBLP]


  62. 06421 Abstracts Collection -- Robot Navigation. [Citation Graph (, )][DBLP]


  63. 06421 Executive Summary -- Robot Navigation. [Citation Graph (, )][DBLP]


  64. List Update Algorithms for Data Compression. [Citation Graph (, )][DBLP]


  65. Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. [Citation Graph (, )][DBLP]


  66. Interruptible Algorithms for Multi-Problem Solving. [Citation Graph (, )][DBLP]


  67. Capacity Provisioning a Valiant Load-Balanced Network. [Citation Graph (, )][DBLP]


  68. On the Relative Dominance of Paging Algorithms. [Citation Graph (, )][DBLP]


  69. Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. [Citation Graph (, )][DBLP]


  70. Online Sorted Range Reporting. [Citation Graph (, )][DBLP]


  71. Untangled Monotonic Chains and Adaptive Range Search. [Citation Graph (, )][DBLP]


  72. List Update with Locality of Reference. [Citation Graph (, )][DBLP]


  73. Search Algorithms for Unstructured Peer-to-Peer Networks. [Citation Graph (, )][DBLP]


  74. Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). [Citation Graph (, )][DBLP]


  75. Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. [Citation Graph (, )][DBLP]


  76. Parameterized Analysis of Paging and List Update Algorithms. [Citation Graph (, )][DBLP]


  77. An Application of Self-organizing Data Structures to Compression. [Citation Graph (, )][DBLP]


  78. Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. [Citation Graph (, )][DBLP]


  79. On Certain New Models for Paging with Locality of Reference. [Citation Graph (, )][DBLP]


  80. Sorting with networks of data structures. [Citation Graph (, )][DBLP]


Search in 1.341secs, Finished in 1.343secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002