default search action
Salvador Roura
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Xavier Molinero
, Fabián Riquelme
Author Correction: Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 43(4): 237 (2024) - [j15]Xavier Molinero
Correction: Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 43(5): 296 (2024) - 2023
- [j14]Xavier Molinero
Multidimension: a dimensionality extension of simple games. Comput. Appl. Math. 42(8): 339 (2023) - [j13]Xavier Molinero
On the generalized dimension and codimension of simple games. Eur. J. Oper. Res. 306(2): 927-940 (2023) - 2022
- [c12]Amalia Duch
Median and Hybrid Median K-Dimensional Trees. LATIN 2022: 38-53
2010 – 2019
- 2019
- [j12]Jordi Petit, Salvador Roura, Josep Carmona, Jordi Cortadella
Corrections to "Jutge.org: Characteristics and Experiences". IEEE Trans. Learn. Technol. 12(2): 290 (2019) - 2018
- [j11]Jordi Petit
Jutge.org: Characteristics and Experiences. IEEE Trans. Learn. Technol. 11(3): 321-333 (2018) - 2016
- [j10]Nikolett Bereczky, Amalia Duch
Quad-kd trees: A general framework for kd trees and quad trees. Theor. Comput. Sci. 616: 126-140 (2016) - 2014
- [j9]Leonor Frias, Salvador Roura:
Multikey Quickselect. Algorithmica 69(4): 958-973 (2014) - [c11]Anaga Mani, Divya Venkataramani, Jordi Petit, Salvador Roura:
Better Feedback for Educational Online Judges. CSEDU (2) 2014: 176-183 - [c10]Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-K-d Trees. LATIN 2014: 743-754 - 2013
- [j8]Salvador Roura:
Fibonacci BSTs: A new balancing method for binary search trees. Theor. Comput. Sci. 482: 48-59 (2013) - [c9]Amalia Duch, Jordi Petit, Enric Rodríguez-Carbonell
Fun in CS2. CSEDU 2013: 437-442 - 2012
- [j7]Josep Freixas
Complete voting systems with two classes of voters: weightedness and counting. Ann. Oper. Res. 193(1): 273-289 (2012) - [c8]Jordi Petit, Omer Giménez, Salvador Roura:
Jutge.org: an educational programming judge. SIGCSE 2012: 445-450
2000 – 2009
- 2009
- [j6]Leonor Frias, Jordi Petit, Salvador Roura:
Lists revisited: Cache-conscious STL lists. ACM J. Exp. Algorithmics 14 (2009) - 2007
- [c7]Josep Freixas, Xavier Molinero
Minimal Representations for Majority Games. CiE 2007: 297-306 - 2006
- [c6]Leonor Frias, Jordi Petit, Salvador Roura:
Lists Revisited: Cache Conscious STL Lists. WEA 2006: 121-133 - 2001
- [j5]Salvador Roura:
Improved master theorems for divide-and-conquer recurrences. J. ACM 48(2): 170-205 (2001) - [j4]Salvador Roura:
Digital Access to Comparison-Based Tree Data Structures and Algorithms. J. Algorithms 40(1): 1-23 (2001) - [j3]Conrado Martínez
Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput. 31(3): 683-705 (2001) - [c5]Salvador Roura:
A New Method for Balancing Binary Search Trees. ICALP 2001: 469-480 - 2000
- [j2]Conrado Martínez
On the competitiveness of the move-to-front rule. Theor. Comput. Sci. 242(1-2): 313-325 (2000)
1990 – 1999
- 1999
- [c4]Salvador Roura:
Improving Mergesort for Linked Lists. ESA 1999: 267-276 - 1998
- [j1]Conrado Martínez
Randomized Binary Search Trees. J. ACM 45(2): 288-323 (1998) - [c3]Conrado Martínez, Salvador Roura:
Optimal Sampling Strategies in Quicksort. ICALP 1998: 327-338 - 1997
- [c2]Salvador Roura:
An Improved Master Theorem for Divide-and-Conquer Recurrences. ICALP 1997: 449-459 - 1996
- [c1]Salvador Roura, Conrado Martínez
Randomization of Search Trees by Subtree Size. ESA 1996: 91-106
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: