( en | de | ru )

 

Disambiguation of "López-Ortiz, Alejandro"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive set intersections, unions, and differences.

, , and . SODA, page 743-752. ACM/SIAM, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alejandro López-Ortiz

Gabriel Alejandro López

Alejandro López Pamplona

Alejandro Martínez López-Portillo

Ormeño Ortiz Armando Alejandro

 

Other publications of authors with the same name

A linear lower bound on index size for text retrieval., and . J. Algorithms, 48 (1): 2-15 (2003)Algorithmic foundations of the internet. SIGACT News, 36 (2): 45--62 (June 2005)List Colouring and Partial List Colouring of Graphs On-line., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 124-135. Springer, (2015)Online Bin Packing with Advice., , , and . STACS, volume 25 of LIPIcs, page 174-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Multi-queued network processors for packets with heterogeneous processing requirements., , , and . COMSNETS, page 1-10. IEEE, (2013)Interruptible Algorithms for Multiproblem Solving., and . CoRR, (2018)On the online fault-tolerant server consolidation problem., , and . SPAA, page 12-21. ACM, (2014)Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.. CAAN, volume 4852 of Lecture Notes in Computer Science, page 3-12. Springer, (2007)Online Routing in Convex Subdivisions., , , , , , , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 47-59. Springer, (2000)All-Around Near-Optimal Solutions for the Online Bin Packing Problem., and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 727-739. Springer, (2015)