Salvador Roura

Orcid: 0000-0003-4394-5939

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Salvador Roura authored at least 27 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Correction: Multidimension: a dimensionality extension of simple games.
Comput. Appl. Math., July, 2024

Author Correction: Multidimension: a dimensionality extension of simple games.
Comput. Appl. Math., 2024

2023
Multidimension: a dimensionality extension of simple games.
Comput. Appl. Math., December, 2023

On the generalized dimension and codimension of simple games.
Eur. J. Oper. Res., 2023

2022
Median and Hybrid Median K-Dimensional Trees.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2019
Corrections to "Jutge.org: Characteristics and Experiences".
IEEE Trans. Learn. Technol., 2019

2018
Jutge.org: Characteristics and Experiences.
IEEE Trans. Learn. Technol., 2018

2016
Quad-kd trees: A general framework for kd trees and quad trees.
Theor. Comput. Sci., 2016

2014
Multikey Quickselect.
Algorithmica, 2014

Quad-K-d Trees.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Better Feedback for Educational Online Judges.
Proceedings of the CSEDU 2014, 2014

2013
Fibonacci BSTs: A new balancing method for binary search trees.
Theor. Comput. Sci., 2013

Fun in CS2.
Proceedings of the CSEDU 2013, 2013

2012
Complete voting systems with two classes of voters: weightedness and counting.
Ann. Oper. Res., 2012

Jutge.org: an educational programming judge.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

2009
Lists revisited: Cache-conscious STL lists.
ACM J. Exp. Algorithmics, 2009

2007
Minimal Representations for Majority Games.
Proceedings of the Computation and Logic in the Real World, 2007

2001
Optimal Sampling Strategies in Quicksort and Quickselect.
SIAM J. Comput., 2001

Digital Access to Comparison-Based Tree Data Structures and Algorithms.
J. Algorithms, 2001

Improved master theorems for divide-and-conquer recurrences.
J. ACM, 2001

A New Method for Balancing Binary Search Trees.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
On the competitiveness of the move-to-front rule.
Theor. Comput. Sci., 2000

1999
Improving Mergesort for Linked Lists.
Proceedings of the Algorithms, 1999

1998
Randomized Binary Search Trees.
J. ACM, 1998

Optimal Sampling Strategies in Quicksort.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
An Improved Master Theorem for Divide-and-Conquer Recurrences.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Randomization of Search Trees by Subtree Size.
Proceedings of the Algorithms, 1996


  Loading...