Published Research Results

• Minimal Representations for Majority Games
  Josep Freixas, Xavier Molinero, Salvador Roura
  CiE 2007: 297-306

• Lists Revisited: Cache Conscious STL Lists
  Leonor Frias, Jordi Petit, Salvador Roura
  WEA 2006: 121-133

• A New Method for Balancing Binary Search Trees
  Salvador Roura
  ICALP 2001: 469-480

• Improved master theorems for divide-and-conquer recurrences
  Salvador Roura
  J. ACM 48(2): 170-205 (2001)

• Digital Access to Comparison-Based Tree Data Structures and Algorithms
  Salvador Roura
  J. Algorithms 40(1): 1-23 (2001)

• Optimal Sampling Strategies in Quicksort and Quickselect
  Conrado Martínez, Salvador Roura
  SIAM J. Comput. 31(3): 683-705 (2001)

• On the competitiveness of the move-to-front rule
  Conrado Martínez, Salvador Roura
  Theor. Comput. Sci. 242(1-2): 313-325 (2000)

• Improving Mergesort for Linked Lists
  Salvador Roura
  ESA 1999: 267-276

• Optimal Sampling Strategies in Quicksort
  Conrado Martínez, Salvador Roura
  ICALP 1998: 327-338

• Randomized Binary Search Trees
  Conrado Martínez, Salvador Roura
  J. ACM 45(2): 288-323 (1998)

• An Improved Master Theorem for Divide-and-Conquer Recurrences
  Salvador Roura
  ICALP 1997: 449-459

• Randomization of Search Trees by Subtree Size
  Salvador Roura, Conrado Martínez
  ESA 1996: 91-106